標題: Titlebook: Computer Science Logic; 19th International W Luke Ong Conference proceedings 2005 Springer-Verlag Berlin Heidelberg 2005 Constraint.ai logi [打印本頁] 作者: 誓約 時間: 2025-3-21 16:05
書目名稱Computer Science Logic影響因子(影響力)
書目名稱Computer Science Logic影響因子(影響力)學科排名
書目名稱Computer Science Logic網(wǎng)絡公開度
書目名稱Computer Science Logic網(wǎng)絡公開度學科排名
書目名稱Computer Science Logic被引頻次
書目名稱Computer Science Logic被引頻次學科排名
書目名稱Computer Science Logic年度引用
書目名稱Computer Science Logic年度引用學科排名
書目名稱Computer Science Logic讀者反饋
書目名稱Computer Science Logic讀者反饋學科排名
作者: 吸引人的花招 時間: 2025-3-21 23:28 作者: 剛開始 時間: 2025-3-22 04:06 作者: COLIC 時間: 2025-3-22 08:29 作者: Resign 時間: 2025-3-22 09:35 作者: Infect 時間: 2025-3-22 16:11
A Semantic Formulation of ???-Lifting and Logical Predicates for Computational Metalanguageexamples, and apply it to the logical predicates for Moggi’s computational metalanguage. We then abstract the semantic ???-lifting as the lifting of strong monads across bifibrations with lifted symmetric monoidal closed structures.作者: Infect 時間: 2025-3-22 19:44 作者: 獨行者 時間: 2025-3-22 21:43
Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations subject by extending it to richer typed .-calculi and rewriting paradigms, culminating in the Calculus of Algebraic Constructions. These works provide theoretical foundations for type-theoretic proof assistants where functions and predicates are defined by oriented higher-order equations. This kind作者: 粉筆 時間: 2025-3-23 02:19
On the Role of Type Decorations in the Calculus of Inductive Constructionspeed-ups are achieved by compiling proof terms, see?[9]. Since compilation erases some type information, we have to show that convertibility is preserved by type erasure. This article shows the equivalence of the Calculus of Inductive Constructions (formalism of Coq) and its domain-free version wher作者: Repetitions 時間: 2025-3-23 06:16 作者: 箴言 時間: 2025-3-23 10:51
Focusing the Inverse Method for Linear Logicleaux systems. In this paper we construct a form of focused derivations for propositional linear logic that is appropriate for forward reasoning in the inverse method. We show that the focused inverse method conservatively generalizes the classical hyperresolution strategy for Horn-theories, and dem作者: Sinus-Rhythm 時間: 2025-3-23 16:29 作者: glomeruli 時間: 2025-3-23 18:28 作者: Neuralgia 時間: 2025-3-24 01:28
Coprimality in Finite Models denoted by ...Within . we construct an interpretation of addition and multiplication on indices of prime numbers. Consequently, the first order theory of . is Π.–complete (in contrast to the decidability of the theory of multiplication in the standard model). This result strengthens an analogous th作者: chondromalacia 時間: 2025-3-24 04:24 作者: 社團 時間: 2025-3-24 09:25
A Logic of Coequations?. of colored trees is a logical consequence of a set?. iff .?contains every tree such that all recolorings of all its subtrees lie in?.. Finally, we characterize covarieties whose presentation needs only .?colors.作者: AORTA 時間: 2025-3-24 10:41 作者: Discrete 時間: 2025-3-24 18:42
https://doi.org/10.1007/978-981-10-7173-7ved by type erasure. This article shows the equivalence of the Calculus of Inductive Constructions (formalism of Coq) and its domain-free version where parameters of inductive types are also erased. It generalizes and strengthens significantly a similar result by Barthe and S?rensen?[5] on the class of functional Domain-free Pure Type Systems.作者: follicular-unit 時間: 2025-3-24 19:46
https://doi.org/10.1007/978-981-10-7173-7e inverse method. We show that the focused inverse method conservatively generalizes the classical hyperresolution strategy for Horn-theories, and demonstrate through a practical implementation that the focused inverse method is considerably faster than the non-focused version.作者: 可觸知 時間: 2025-3-25 02:24 作者: 誓言 時間: 2025-3-25 05:42 作者: Insul島 時間: 2025-3-25 09:48
Focusing the Inverse Method for Linear Logice inverse method. We show that the focused inverse method conservatively generalizes the classical hyperresolution strategy for Horn-theories, and demonstrate through a practical implementation that the focused inverse method is considerably faster than the non-focused version.作者: predict 時間: 2025-3-25 13:55
https://doi.org/10.1007/978-981-10-7173-7roperties and comes equipped with new modalities for the management of the exchange rule. Moreover, both cyclic and linear logic are shown to be embedded into permutative logic. It provides the natural logical framework in which to study and constrain the topological complexity of proofs, and hence the use of the exchange rule.作者: promote 時間: 2025-3-25 18:16
Must We Jettison the Commonwealth?,o the set .. This can be compared to the decidability of the first order theory of ., for . being the set of primes (Maurin, 1997) and to the interpretation of addition and multiplication in ., for .. being the set of primes and squares of primes, given by Bès and Richard, 1998.作者: JUST 時間: 2025-3-25 23:27 作者: 秘密會議 時間: 2025-3-26 03:21 作者: Moderate 時間: 2025-3-26 04:59 作者: Curmudgeon 時間: 2025-3-26 11:42 作者: 細胞學 時間: 2025-3-26 14:59 作者: MAG 時間: 2025-3-26 19:06 作者: A保存的 時間: 2025-3-26 23:38 作者: CYN 時間: 2025-3-27 03:02
From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Sthe consistency algorithm and certain two-person pebble games. Surprisingly, we demonstrate a variety of tractability results using the algorithm, revealing unified structure among apparently different cases of the QCSP.作者: Asymptomatic 時間: 2025-3-27 07:56 作者: CONE 時間: 2025-3-27 12:46
https://doi.org/10.1007/978-981-10-7173-7?. of colored trees is a logical consequence of a set?. iff .?contains every tree such that all recolorings of all its subtrees lie in?.. Finally, we characterize covarieties whose presentation needs only .?colors.作者: APNEA 時間: 2025-3-27 15:07
Luke OngIncludes supplementary material: 作者: hyperuricemia 時間: 2025-3-27 19:34 作者: ethereal 時間: 2025-3-28 00:38
https://doi.org/10.1007/11538363Constraint; ai logics; classical logic; complexity; computational logic; finite models; higher order logic作者: 一夫一妻制 時間: 2025-3-28 04:32 作者: 憤怒事實 時間: 2025-3-28 07:14 作者: 食料 時間: 2025-3-28 13:19 作者: 沙漠 時間: 2025-3-28 15:01 作者: 伙伴 時間: 2025-3-28 22:16
https://doi.org/10.1007/978-981-10-7173-7ments in (different) XML documents), XSLT (for transforming XML documents) and XQuery (for, indeed, querying XML documents). Navigation in an XML document tree is the task of moving from a given node to another node by following a path specified by a certain formula. Hence formulas in navigation lan作者: 擴大 時間: 2025-3-29 01:28 作者: gruelling 時間: 2025-3-29 04:14 作者: fabricate 時間: 2025-3-29 08:39 作者: 喃喃而言 時間: 2025-3-29 13:07
https://doi.org/10.1007/978-981-10-7173-7nd quotients) iff it can be presented by a subset of a cofree coalgebra. We introduce inference rules for these subsets, and prove that they are sound and complete. For example, given a polynomial endofunctor of a signature?Σ, the cofree coalgebra consists of colored Σ-trees, and we prove that a set作者: PAGAN 時間: 2025-3-29 17:18 作者: CRUDE 時間: 2025-3-29 19:48
https://doi.org/10.1007/978-981-10-7173-7r with a least element making the context operators monotone. The first natural candidate is the prefix relation: a prefix of a term is obtained by replacing some subterms by .. We prove that six models induced by the infinitary lambda calculus (which includes B?hm and Lévy-Longo trees) are orderabl作者: VEIL 時間: 2025-3-30 03:12 作者: 伸展 時間: 2025-3-30 04:59
https://doi.org/10.1007/978-981-10-7173-7peed-ups are achieved by compiling proof terms, see?[9]. Since compilation erases some type information, we have to show that convertibility is preserved by type erasure. This article shows the equivalence of the Calculus of Inductive Constructions (formalism of Coq) and its domain-free version wher作者: 緯度 時間: 2025-3-30 11:23 作者: 傲慢人 時間: 2025-3-30 13:10
https://doi.org/10.1007/978-981-10-7173-7leaux systems. In this paper we construct a form of focused derivations for propositional linear logic that is appropriate for forward reasoning in the inverse method. We show that the focused inverse method conservatively generalizes the classical hyperresolution strategy for Horn-theories, and dem作者: CULP 時間: 2025-3-30 19:28
https://doi.org/10.1007/978-981-10-7173-7f GoI, called Multiobject GoI (MGoI) for multiplicative linear logic without units in categories which include previous (untyped) GoI models, as well as models not possible in the original untyped version. The development of MGoI depends on a new theory of partial traces and trace classes, as well a作者: 輕觸 時間: 2025-3-30 22:50
Past Experience in Flexibility,al problems. Although they are intractable in general, a rich line of research has identified restricted cases of these problems that are tractable in polynomial time. Remarkably, many tractable cases of the CSP that have been identified are solvable by a single algorithm, which we call here the con作者: 自負的人 時間: 2025-3-31 04:40
Must We Jettison the Commonwealth?, denoted by ...Within . we construct an interpretation of addition and multiplication on indices of prime numbers. Consequently, the first order theory of . is Π.–complete (in contrast to the decidability of the theory of multiplication in the standard model). This result strengthens an analogous th作者: 鞭子 時間: 2025-3-31 06:21 作者: inspiration 時間: 2025-3-31 09:44
https://doi.org/10.1007/978-981-10-7173-7We prove a strong normalization theorem for abstract term rewriting systems based on domain-theoretic models. The theorem applies to extensions of G?del’s system . by various forms of recursion related to bar recursion for which strong normalization was hitherto unknown.作者: 粗鄙的人 時間: 2025-3-31 16:40
https://doi.org/10.1007/978-981-10-7173-7We provide a game-theoretic characterisation of higher-order matching. The idea is suggested by model checking games. We then show that some known decidable instances of matching can be uniformly proved decidable via the game-theoretic characterisation.作者: 低能兒 時間: 2025-3-31 20:29 作者: endure 時間: 2025-3-31 22:38
Note on Formal Analogical Reasoning in the Juridical ContextThis note describes a formal rule for analogical reasoning in the legal context. The rule derives first order sentences from partial decision descriptions. The construction follows the principle, that the acceptance of an incomplete argument induces the acceptance of the logically weakest assumptions, which complete it.作者: 輪流 時間: 2025-4-1 01:55 作者: AFFIX 時間: 2025-4-1 06:51 作者: 得體 時間: 2025-4-1 11:54 作者: 辭職 時間: 2025-4-1 15:36 作者: 深陷 時間: 2025-4-1 20:41 作者: Cerumen 時間: 2025-4-2 01:06 作者: 多產(chǎn)魚 時間: 2025-4-2 05:17 作者: 比賽用背帶 時間: 2025-4-2 10:35
An Algebraic Approach for the Unsatisfiability of Nonlinear Constraints作者: CEDE 時間: 2025-4-2 14:28
https://doi.org/10.1007/978-981-10-7173-7nately there exists an algebraic formalism which is created solely to study binary relations. This formalism goes back to logic pioneers as de Morgan, Peirce and Schr?der and has been formalized by Tarski as . [7]. (Cf., [5] for a monograph on this topic, and [8] for a database oriented introduction
