Results 1  10
of
456
Full FirstOrder Sequent and Tableau Calculi With Preservation of Solutions and the Liberalized deltaRule but Without Skolemization
, 1998
"... . We present a combination of raising, explicit variable dependency representation, the liberalized ffirule, and preservation of solutions for firstorder deductive theorem proving. Our main motivation is to provide the foundation for our work on inductive theorem proving. 1 Introduction 1.1 W ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
. We present a combination of raising, explicit variable dependency representation, the liberalized ffirule, and preservation of solutions for firstorder deductive theorem proving. Our main motivation is to provide the foundation for our work on inductive theorem proving. 1 Introduction 1
First Order Abduction Via Tableau and Sequent Calculi
 Bulletin of the IGPL
, 1993
"... The formalization of abductive reasoning is still an open question: there is no general agreement on the boundary of some basic concepts, such as preference criteria for explanations, and the extension to first order logic has not been settled. Investigating the nature of abduction outside the conte ..."
Abstract

Cited by 23 (6 self)
 Add to MetaCart
are sound and complete and work for full first order logic, without requiring any preliminary reductio...
First order abduction via tableau and sequent calculi
"... The formalization of abductive reasoning is still an open question: there is no general agreement on the boundary of some basic concepts, such as preference criteria for explanations, and the extension to first order logic has not been settled. Investigating the nature of abduction outside the conte ..."
Abstract
 Add to MetaCart
are sound and complete and work for full first order logic, without requiring any preliminary reduction of formulae into normal forms. In the prepositional case, two Hiff ̂ ^nt. rhjrrjfcit ̂ rj'rjit.jffm * are given for abductive ^^rhniti""*! ~T^h of tr»»ra being the declarative counterpart
Full FirstOrder Free Variable Sequents and Tableaux in Implicit Induction
 IN IMPLICIT INDUCTION. 8 TH TABLEAU 1999, LNAI 1617
, 1999
"... We show how to integrate implicit inductive theorem proving into free variable sequent and tableau calculi and compare the appropriateness of tableau calculi for this integration with that of sequent calculi. When firstorder validity is introduced to students it comes with some complete calculus ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We show how to integrate implicit inductive theorem proving into free variable sequent and tableau calculi and compare the appropriateness of tableau calculi for this integration with that of sequent calculi. When firstorder validity is introduced to students it comes with some complete
2.2 Why Sequent and Tableau Calculi....................... 5
, 2000
"... (in honor of Jörg H. Siekmann’s 60 th birthday) Polarity of choiceconditions swapped (Definition 9.2) and quasiexistentiality added ..."
Abstract
 Add to MetaCart
(in honor of Jörg H. Siekmann’s 60 th birthday) Polarity of choiceconditions swapped (Definition 9.2) and quasiexistentiality added
Controlled Integrations of the Cut Rule into Connection Tableau Calculi
"... In this paper techniques are developed and compared which increase the inferential power of tableau systems for classical firstorder logic. The mechanisms are formulated in the framework of connection tableaux, which is an amalgamation of the connection method and the tableau calculus, and a genera ..."
Abstract

Cited by 65 (3 self)
 Add to MetaCart
In this paper techniques are developed and compared which increase the inferential power of tableau systems for classical firstorder logic. The mechanisms are formulated in the framework of connection tableaux, which is an amalgamation of the connection method and the tableau calculus, and a
A Constraint Sequent Calculus for FirstOrder Logic with Linear Integer Arithmetic
"... Abstract. Firstorder 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 th ..."
Abstract
 Add to MetaCart
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 freevariable constraint tableaux with the Omega quantifier elimination procedure. The calculus is complete for theorems of firstorder
Proof Search in the Intuitionistic Sequent Calculus
 11th International Conference on Automated Deduction
, 1991
"... The use of Herbrand functions (more popularly known as Skolemization) plays an important role in classical theorem proving and logic programming. We define a notion of Herbrand functions for the full intuitionistic predicate calculus. The definition is based on the view that the prooftheoretic role ..."
Abstract

Cited by 46 (1 self)
 Add to MetaCart
The use of Herbrand functions (more popularly known as Skolemization) plays an important role in classical theorem proving and logic programming. We define a notion of Herbrand functions for the full intuitionistic predicate calculus. The definition is based on the view that the proof
On the relationship between hypersequent calculi and labelled sequent calculi for intermediate logics with geometric Kripke semantics
, 2010
"... Full metadata for this item is available in ..."
Modal Languages And Bounded Fragments Of Predicate Logic
, 1996
"... Model Theory. These are nonempty families I of partial isomorphisms between models M and N , closed under taking restrictions to smaller domains, and satisfying the usual BackandForth properties for extension with objects on either side  restricted to apply only to partial isomorphisms of size ..."
Abstract

Cited by 271 (12 self)
 Add to MetaCart
are preserved under partial isomorphism, by a simple induction. More precisely, one proves, for any assignment A and any partial isomorphism IÎI which is defined on the Avalues for all variables x 1 , ..., x k , that M, A = f iff N , IoA = f . The crucial step in the induction is the quantifier case
Results 1  10
of
456