Results 1  10
of
126
A Sequent Calculus for Skeptical Reasoning in Autoepistemic Logic
"... A sequent calculus for skeptical consequence in infinite autoepistemic theories is presented and proved sound and complete. While skeptical consequence is decidable in the finite case, the move to infinite theories increases the complexity of skeptical reasoning to being Π 1 1complete. This implies ..."
Abstract
 Add to MetaCart
A sequent calculus for skeptical consequence in infinite autoepistemic theories is presented and proved sound and complete. While skeptical consequence is decidable in the finite case, the move to infinite theories increases the complexity of skeptical reasoning to being Π 1 1complete
A Sequent Calculus for Skeptical Default Logic
 Proc. of the Int. Conf. on Automated Reasoning with Analytic Tableaux and Related Methods, SpringerVerlag LNCS 1227
, 1997
"... . In this paper, we contribute to the prooftheory of Reiter's Default Logic by introducing a sequent calculus for skeptical reasoning. The main features of this calculus are simplicity and regularity, and the fact that proofs can be surprisingly concise and, in many cases, involve only a s ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
. In this paper, we contribute to the prooftheory of Reiter's Default Logic by introducing a sequent calculus for skeptical reasoning. The main features of this calculus are simplicity and regularity, and the fact that proofs can be surprisingly concise and, in many cases, involve only a
Gentzen Sequent Calculus for Possibilistic Reasoning
 in: M. Masuch and L. P'olos, Eds., Knowledge Representation and Reasoning under Uncertainty, LNAI 808 (SpringerVerlag
, 1994
"... . Possibilistic logic is an important uncertainty reasoning mechanism based on Zadeh's possibility theory and classical logic. The deduction rules of possibilistic logic have been obtained from classical resolution rule by attaching possibility or necessity weight to ordinary clauses. However, ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
, since not all possibilityvalued formulae can be converted into equivalent possibilistic clauses, the resolution rules are somewhat restricted. In this paper, we develop Gentzen sequent calculus for possibilistic reasoning to lift this restriction. This is done by first formulating possibilistic
A Sequent Calculus for Circumscription
, 1997
"... . In this paper, we introduce a sequent calculus CIRC for propositional Circumscription. This work is part of a larger project, aiming at a uniform prooftheoretic reconstruction of the major families of nonmonotonic logics. Among the novelties of the calculus, we mention that CIRC is analytic ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. In this paper, we introduce a sequent calculus CIRC for propositional Circumscription. This work is part of a larger project, aiming at a uniform prooftheoretic reconstruction of the major families of nonmonotonic logics. Among the novelties of the calculus, we mention that CIRC is analytic
Encoding Transition Systems in Sequent Calculus
 Theoretical Computer Science
, 1996
"... Intuitionistic and linear logics can be used to specify the operational semantics of transition systems in various ways. We consider here two encodings: one uses linear logic and maps states of the transition system into formulas, and the other uses intuitionistic logic and maps states into terms. I ..."
Abstract

Cited by 38 (11 self)
 Add to MetaCart
both intuitionistic and linear logics with a proof theoretical treatment of definitions. In both cases, this addition allows proving various judgments concerning simulation and bisimulation (especially for noetherian transition systems). We also explore the use of infinite proofs to reason about
Chapter 3 Sequent Calculus
, 2001
"... In the previous chapter we developed linear logic in the form of natural deduction, which is appropriate for many applications of linear logic. It is also highly economical, in that we only needed one basic judgment (A true)andtwo judgment forms (linear and unrestricted hypothetical judgments) to ex ..."
Abstract
 Add to MetaCart
) to explain the meaning of all connectives we have encountered so far. However, it is not wellsuited directly proof search, because this involves mixing forward and backward reasoning even if we restrict ourselves to searching for normal deductions. In this chapter we develop a sequent calculus as a calculus
Chapter 3 Sequent Calculus
, 2001
"... In the previous chapter we developed linear logic in the form of natural deduction, which is appropriate for many applications of linear logic. It is also highly economical, in that we only needed one basic judgment (A true) and two judgment forms (linear and unrestricted hypothetical judgments) to ..."
Abstract
 Add to MetaCart
) to explain the meaning of all connectives we have encountered so far. However, it is not immediately wellsuited for proof search, because it involves mixing forward and backward reasoning even if we restrict ourselves to searching for normal deductions. In this chapter we develop a sequent calculus as a
A Sequent Calculus for Reasoning in Fourvalued Description Logics
 IN PROC. OF THE INT. CONF. ON ANALYTIC TABLEAUX AND RELATED METHODS (TABLEAUX97), NUMBER 1227 IN LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
, 1997
"... Description Logics (DLs, for short) provide a logical reconstruction of the socalled framebased knowledge representation languages. Originally, fourvalued DLs have been proposed in order to develop expressively powerful DLs with tractable subsumption algorithms. Recently, fourvalued DLs have bee ..."
Abstract

Cited by 28 (5 self)
 Add to MetaCart
Description Logics (DLs, for short) provide a logical reconstruction of the socalled framebased knowledge representation languages. Originally, fourvalued DLs have been proposed in order to develop expressively powerful DLs with tractable subsumption algorithms. Recently, fourvalued DLs have
Induction and coinduction in sequent calculus
 Postproceedings of TYPES 2003, number 3085 in LNCS
, 2003
"... Abstract. Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and coinduction. These proof principles are based on a proof theoretic (rather than sett ..."
Abstract

Cited by 28 (8 self)
 Add to MetaCart
Abstract. Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and coinduction. These proof principles are based on a proof theoretic (rather than set
A Sequent Calculus for a Paraconsistent Nonmonotonic Logic
"... . In spite of sequent calculus being an appealing tool for describing logical systems, its use along with nonmonotonic logics has been largely neglected. Reasons may be the hardness in implementing a context sensitive mechanism able to detect changes in the theory. This seems to brake the locality o ..."
Abstract
 Add to MetaCart
. In spite of sequent calculus being an appealing tool for describing logical systems, its use along with nonmonotonic logics has been largely neglected. Reasons may be the hardness in implementing a context sensitive mechanism able to detect changes in the theory. This seems to brake the locality
Results 1  10
of
126