作者: 內(nèi)向者 時(shí)間: 2025-3-21 23:27
Reasoning by Symmetry and Function Ordering in Finite Model Generationfinite model search generation. The method SEM with and without both the function ordering and symmetry detection is experimented on several interesting mathematical problems to show the advantage of reasoning by symmetry and the function ordering.作者: ACME 時(shí)間: 2025-3-22 03:45 作者: Popcorn 時(shí)間: 2025-3-22 08:18 作者: gangrene 時(shí)間: 2025-3-22 11:33 作者: 懶惰民族 時(shí)間: 2025-3-22 14:58
0302-9743 papers and 9 system descr- tions. One paper switched its category after refereeing, thus the total number of system descriptions in this volume is 10. In addition to the refereed papers, this v978-3-540-43931-8978-3-540-45620-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 領(lǐng)袖氣質(zhì) 時(shí)間: 2025-3-22 18:01 作者: 異教徒 時(shí)間: 2025-3-23 01:05
Funktionstechnische Anforderungen,s are set to play a key role. DAML+OIL is a description logic based ontology language specifically designed for use on the web. The logical basis of the language means that reasoning services can be provided, both to support ontology design and to make DAML+OIL described web resources more accessible to automated processes.作者: 帶傷害 時(shí)間: 2025-3-23 04:40 作者: Adornment 時(shí)間: 2025-3-23 06:17
https://doi.org/10.1007/978-3-642-95654-6problem. The second is a tight integration, within the DPLL architecture, of a set of mathematical deciders for theories of increasing expressive power. A preliminary experimental evaluation shows the potential of the approach.作者: grandiose 時(shí)間: 2025-3-23 09:59
Instandhaltung und Schadensanalyse,for the problem at hand, installing it, and coping with the often idiosyncratic concrete input syntax. Of course, not only potential outside users face these problems, so that, more often than not, existing reasoning procedures are re-implemented instead of re-used.作者: 性別 時(shí)間: 2025-3-23 14:31 作者: 全能 時(shí)間: 2025-3-23 20:01
https://doi.org/10.1007/978-3-642-95654-6 limited. That problem is addressed by limiting the . of the axioms. This approximation leads to a restricted notion of model correctness, which is discussed. At the same time, it enables model completeness for free data types, unlike approaches based on limiting the domain size.作者: PAC 時(shí)間: 2025-3-23 23:38
System Description: The MathWeb Software Bus for Distributed Mathematical Reasoningfor the problem at hand, installing it, and coping with the often idiosyncratic concrete input syntax. Of course, not only potential outside users face these problems, so that, more often than not, existing reasoning procedures are re-implemented instead of re-used.作者: 思想上升 時(shí)間: 2025-3-24 04:19
Testing Satisfiability of CNF Formulas by Computing a Stable Set of Pointsby showing that if a CNF . formula is symmetric with respect to a group of permutations, it is very easy to make use of this symmetry when constructing an SSP. As an example, we show that the unsatisfiability of pigeon-hole CNF formulas can be proven by examining only a set of points whose size is quadratic in the number of holes.作者: acetylcholine 時(shí)間: 2025-3-24 10:33 作者: CRATE 時(shí)間: 2025-3-24 13:40
Reasoning with Expressive Description Logics: Theory and Practices are set to play a key role. DAML+OIL is a description logic based ontology language specifically designed for use on the web. The logical basis of the language means that reasoning services can be provided, both to support ontology design and to make DAML+OIL described web resources more accessible to automated processes.作者: Banister 時(shí)間: 2025-3-24 15:49 作者: pacifist 時(shí)間: 2025-3-24 21:07 作者: Alienated 時(shí)間: 2025-3-25 01:34 作者: mercenary 時(shí)間: 2025-3-25 06:35
A Gradual Approach to a More Trustworthy, Yet Scalable, Proof-Carrying Code programs..In this paper we discuss how to produce the necessary formal soundness theorem given a safety policy. As an application of the framework, we have used the Coq system to prove the soundness of the proof rules for a type-based safety policy for native machine code compiled from Java.作者: 放肆的你 時(shí)間: 2025-3-25 11:00 作者: 自戀 時(shí)間: 2025-3-25 14:45 作者: 表狀態(tài) 時(shí)間: 2025-3-25 15:48
https://doi.org/10.1007/978-3-7643-8234-6ion. From an analysis of this construction, we deduce a new logical rule [?.] which provides shorter proofs than the rule [?.] of .. We also present a linear implementation of the counter-model generation algorithm for pseudo-atomic sequents.作者: Panther 時(shí)間: 2025-3-25 21:51 作者: Antarctic 時(shí)間: 2025-3-26 03:07 作者: 招致 時(shí)間: 2025-3-26 06:05 作者: 密碼 時(shí)間: 2025-3-26 09:34 作者: 消息靈通 時(shí)間: 2025-3-26 15:06
Embedding Lax Logic into Intuitionistic Logiconal λ-calculus. We show that lax logic can be faithfully embedded into the underlying intuitionistic logic and discuss (computational) properties of the embedding. Using the proposed polynomial-time computable embedding, PSPACE-completeness of the provability problem of propositional lax logic is shown.作者: Headstrong 時(shí)間: 2025-3-26 20:37
Combining Proof-Search and Counter-Model Construction for Deciding G?del-Dummett Logicion. From an analysis of this construction, we deduce a new logical rule [?.] which provides shorter proofs than the rule [?.] of .. We also present a linear implementation of the counter-model generation algorithm for pseudo-atomic sequents.作者: CHECK 時(shí)間: 2025-3-26 23:14
DDDLIB: A Library for Solving Quantified Difference Inequalities provide efficient algorithms for constructing formulae with the standard Boolean operators (conjunction, disjunction, negation, etc.), eliminating quantifiers, and deciding functional properties (satisfiability, validity and equivalence). The library is written in C and has interfaces for C++, Standard ML and Objective Caml.作者: indemnify 時(shí)間: 2025-3-27 02:29
An LCF-Style Interface between HOL and First-Order Logiche ability to translate proofs to higher-order logic. This was integrated as a HOL tactic in 1996, and has since become a standard workhorse of interactive proof. Today, building all the theories in the most recent distribution of HOL relies on MESON to prove 1726 subgoals.作者: Ebct207 時(shí)間: 2025-3-27 06:33 作者: lethal 時(shí)間: 2025-3-27 10:01
A Note on Symmetry Heuristics in SEM especially through group actions. Both heuristics can be seen as computationally efficient ways of applying a general symmetry pruning theorem. Moreover, simple combinatorics provide some insight into the relative performances of these heuristics. We finally expose a fundamental difficulty in making SEM symmetry efficient by symmetry pruning.作者: Priapism 時(shí)間: 2025-3-27 16:31 作者: 打折 時(shí)間: 2025-3-27 18:25 作者: Prognosis 時(shí)間: 2025-3-28 00:41
BDD-Based Decision Procedures for ,ion. Our algorithms compute the fixpoint of a set of types, which are sets of formulas satisfying some consistency conditions. We use BDDs to represent and manipulate such sets. Experimental results show that our algorithms are competitive with contemporary methods using benchmarks from TANCS 98 and TANCS 2000.作者: sed-rate 時(shí)間: 2025-3-28 02:51 作者: BUOY 時(shí)間: 2025-3-28 08:32 作者: 營養(yǎng) 時(shí)間: 2025-3-28 12:27
https://doi.org/10.1007/978-3-540-68927-0The . proof development system [.] is the core of several related and well integrated research projects of the . research group.作者: 拱墻 時(shí)間: 2025-3-28 18:17 作者: 上下連貫 時(shí)間: 2025-3-28 22:02 作者: 索賠 時(shí)間: 2025-3-29 02:04
https://doi.org/10.1007/978-3-7643-8234-6ion. Our algorithms compute the fixpoint of a set of types, which are sets of formulas satisfying some consistency conditions. We use BDDs to represent and manipulate such sets. Experimental results show that our algorithms are competitive with contemporary methods using benchmarks from TANCS 98 and TANCS 2000.作者: 招致 時(shí)間: 2025-3-29 04:46 作者: Jingoism 時(shí)間: 2025-3-29 08:12 作者: 名字的誤用 時(shí)間: 2025-3-29 12:18 作者: resistant 時(shí)間: 2025-3-29 17:01 作者: Tartar 時(shí)間: 2025-3-29 22:06 作者: Obstruction 時(shí)間: 2025-3-30 03:54
https://doi.org/10.1007/978-3-7643-8234-6ion. Our algorithms compute the fixpoint of a set of types, which are sets of formulas satisfying some consistency conditions. We use BDDs to represent and manipulate such sets. Experimental results show that our algorithms are competitive with contemporary methods using benchmarks from TANCS 98 and作者: 堅(jiān)毅 時(shí)間: 2025-3-30 05:34 作者: Herbivorous 時(shí)間: 2025-3-30 09:19
https://doi.org/10.1007/978-3-7643-8234-6he safety policy includes proof rules which determine how various actions are to be proved safe. These proof rules have been considered part of the trusted code base (TCB) of the PCC system. We wish to remove the proof rules from the TCB by providing a formal proof of their soundness. This makes the作者: Aerate 時(shí)間: 2025-3-30 13:10 作者: FICE 時(shí)間: 2025-3-30 19:18 作者: Aprope 時(shí)間: 2025-3-31 00:43 作者: 高度表 時(shí)間: 2025-3-31 03:04
https://doi.org/10.1007/978-3-662-22652-0ives. This logic, with its sharing interpretation, has been recently used to reason about mutable data structures and needs proof search methods. Our connection-based characterization for . is based on standard notions but involves, in a specific way, labels and constraints in order to capture the i作者: ADORN 時(shí)間: 2025-3-31 08:11
https://doi.org/10.1007/978-3-662-22652-0l variables and . is an integer constant. Formulae are represented in a semi-canonical data structure called difference decision diagrams (DDDs) which provide efficient algorithms for constructing formulae with the standard Boolean operators (conjunction, disjunction, negation, etc.), eliminating qu作者: 眉毛 時(shí)間: 2025-3-31 12:27 作者: Scintigraphy 時(shí)間: 2025-3-31 17:12 作者: 墊子 時(shí)間: 2025-3-31 18:09 作者: Biomarker 時(shí)間: 2025-4-1 00:14
https://doi.org/10.1007/978-3-662-07499-2basic modal language with the addition of nominals (.) and satisfiability operators (@., @., @.,...), increases the expressive power: it can explicitly check whether the point of evaluation is a specific, named point in the model (. ? ., and whether a named point satisfies a given formula (. ? @.). 作者: 大洪水 時(shí)間: 2025-4-1 04:58
https://doi.org/10.1007/978-3-642-95654-6to .. So testing the satisfiability of a CNF formula reduces to looking for a stable set of points (SSP). We give some properties of SSPs and describe a simple algorithm for constructing an SSP for a CNF formula. Building an SSP can be viewed as a “natural” way of search space traversal. This natura作者: compose 時(shí)間: 2025-4-1 09:56
Glasfaser bis ins Haus / Fiber to the Homeese are SEM’s original LNH, and a recent extension XLNH. Our aim is to show how a simple group-theoretic framework brings much clarity in this matter, especially through group actions. Both heuristics can be seen as computationally efficient ways of applying a general symmetry pruning theorem. Moreo作者: 藥物 時(shí)間: 2025-4-1 12:42
https://doi.org/10.1007/978-3-642-95654-6rom real-world domains such as verification of timed systems and planning with resources. In this paper we present a general and efficient approach to the problem, based on two main ingredients. The first is a DPLL-based SAT procedure, for dealing efficiently with the propositional component of the 作者: Countermand 時(shí)間: 2025-4-1 18:08
https://doi.org/10.1007/978-3-642-95654-6ch for a model of an according .. The model search is tailor-made for the semantical setting of free data types, where the fixed domain allows to describe models just in terms of .. For sake of interpretation construction, a theory specific calculus is provided. The concrete rules are ‘executed’ by
