the tool cc Τ is an implementation for testing various parameterised notions of program correspondence between logic programs under the answer-set semantics, based on reductions to quantified propositional logic. One...
详细信息
the proceedings contain 27 papers. the topics discussed include: decidable fragments of many-sorted logic;one-pass tableaux for computation tree logic;extending a resolution power for inequalities on elimentary functi...
详细信息
ISBN:
(纸本)9783540755586
the proceedings contain 27 papers. the topics discussed include: decidable fragments of many-sorted logic;one-pass tableaux for computation tree logic;extending a resolution power for inequalities on elimentary functions;model checking the first-order fragment of higher-order fixpoint logic;least and greatest fixed points in linear logic;the semantics of consistency and trust in peer data exchange systems;completeness and decidability in sequence logic;matching in hybrid terminologies;verifying cryptographic protocols with subterms constraints;deciding knowledge in security protocols for monoidal equational theories;mechanized verification of CPS transformations;preferential description logics;on two extensions of abstract categorial grammars;on finite satisfiability of the guarded fragment with equivalence or transitive guards;and retractile proof nets of the purely multiplicative and additive fragment of linear logic.
A general version of the fundamental theorem for System F is presented which can be instantiated to obtain proofs of weak beta- and beta eta-normalization and normalization by evaluation.
ISBN:
(纸本)9783540894384
A general version of the fundamental theorem for System F is presented which can be instantiated to obtain proofs of weak beta- and beta eta-normalization and normalization by evaluation.
Efficient, automated climination of cuts is a prerequisite for proof analysis. the method CERES, based on Skolemization and resolution has been successfully developed for classical logic for this purpose. We generaliz...
详细信息
ISBN:
(纸本)9783540894384
Efficient, automated climination of cuts is a prerequisite for proof analysis. the method CERES, based on Skolemization and resolution has been successfully developed for classical logic for this purpose. We generalize this method to Godel logic, an important intermediate logic, which is also one of the main formalizations of fuzzy logic.
First-order logic modulo the theory of integer arithmetic is the basis for reasoning in many areas, including deductive software verification and software model checking. While satisfiability checking for ground formu...
详细信息
ISBN:
(纸本)9783540894384
First-order logic modulo the theory of integer arithmetic is the basis for reasoning in many areas, including deductive software verification and software model checking. While satisfiability checking for ground formulae in this logic is well understood, it is still an open question how the general case of quantified formulae can be handled in an efficient and systematic way. As a possible answer, we introduce a sequent calculus that combines ideas from free-variable constraint tableaux withthe Omega quantifier elimination procedure. the calculus is complete for theorems of first-order logic (without functions, but with arbitrary uninterpreted predicates), can decide Presburger arithmetic, and is complete for a substantial fragment of the combination of both.
Many applications of automated deduction require reasoning modulo some form of integer arithmetic. Unfortunately, theory reasoning support for the integers in current theorem provers is sometimes too weak for practica...
详细信息
ISBN:
(纸本)9783540894384
Many applications of automated deduction require reasoning modulo some form of integer arithmetic. Unfortunately, theory reasoning support for the integers in current theorem provers is sometimes too weak for practical purposes. In this paper we propose a novel calculus for a large fragment of first-order logic modulo Linear Integer Arithmetic (LIA) that overcomes several limitations of existing theory reasoning approaches. the new calculus - based on the Model Evolution calculus, a first-order logic version of the propositional DPLL procedure - supports restricted quantifiers, requires only a decision procedure for LIA-validity instead of a complete LIA-unification procedure, and is amenable to strong redundancy criteria. We present a basic version of the calculus and prove it sound and (refutationally) complete.
the deployment of Description logics (DLs) and Answer Set programming (ASP), which are well-known knowledge representation and reasoning formalisms. to a growing range of applications has created the need for novel re...
详细信息
ISBN:
(纸本)9783540894384
the deployment of Description logics (DLs) and Answer Set programming (ASP), which are well-known knowledge representation and reasoning formalisms. to a growing range of applications has created the need for novel reasoning, algorithms and methods. Recently, knots have been introduced as a tool to facilitate reasoning tasks in extensions of ASP with functions symbols. they were then also fruitfully applied for query answering in Description logics, hinging on the forest-shaped model property of knowledge bases. this paper briefly reviews the knot idea at a generic level and recalls some of the results obtained withthen). It also discusses features of knots and relations to other reasoning techniques, and presents issues for further research.
We address the problem of computing and representing answers of constraint abduction problems over the Herbrand domain. this problem is of interest when performing type inference involving generalized algebraic data t...
详细信息
ISBN:
(纸本)9783540894384
We address the problem of computing and representing answers of constraint abduction problems over the Herbrand domain. this problem is of interest when performing type inference involving generalized algebraic data types. We show that simply recognizing a maximally general answer or fully maximal answer is co-NP complete. However we present an algorithm that computes the (finite) set of fully maximal answers of an abduction problem. the maximally general answers are generally infinite in number but we show how to generate a finite representation of them when only, unary function symbols are present.
In this paper we describe Imogen. a theorem prover for intuitionistic propositional logic Using the focused inverse method. We represent fine-grained control of the search behavior by polarizing the input formula. In ...
详细信息
ISBN:
(纸本)9783540894384
In this paper we describe Imogen. a theorem prover for intuitionistic propositional logic Using the focused inverse method. We represent fine-grained control of the search behavior by polarizing the input formula. In manipulating the polarity of atoms and subformulas, we call often improve the search time by several orders of magnitude. We tested Our method against seven other systems on the propositional fragment of the ILTP library. We found that Our prover Outperforms all other provers on a Substantial subset Of the library.
暂无评论