Results 1  10
of
209,294
On transforming intuitionistic matrix proofs into standardsequent proofs
 TABLEAUX–95, LNAI 918
, 1995
"... We present a procedure transforming intuitionistic matrix proofs into proofs within the intuitionistic standard sequent calculus. The transformation is based on L. Wallen’s proof justifying his matrix characterization for the validity of intuitionistic formulae. Since this proof makes use of Fitting ..."
Abstract

Cited by 25 (14 self)
 Add to MetaCart
We present a procedure transforming intuitionistic matrix proofs into proofs within the intuitionistic standard sequent calculus. The transformation is based on L. Wallen’s proof justifying his matrix characterization for the validity of intuitionistic formulae. Since this proof makes use
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 572 (50 self)
 Add to MetaCart
, many standard program properties, such as response for all nonzeno execution sequences (during which time diverges), cannot be characterized by fixpoints: we show that the expressiveness of the timed calculus is incomparable to the expressiveness of timed CTL. Fortunately, this result does
A translation approach to portable ontology specifications
 KNOWLEDGE ACQUISITION
, 1993
"... To support the sharing and reuse of formally represented knowledge among AI systems, it is useful to define the common vocabulary in which shared knowledge is represented. A specification of a representational vocabulary for a shared domain of discourse — definitions of classes, relations, functions ..."
Abstract

Cited by 3305 (9 self)
 Add to MetaCart
, functions, and other objects — is called an ontology. This paper describes a mechanism for defining ontologies that are portable over representation systems. Definitions written in a standard format for predicate calculus are translated by a system called Ontolingua into specialized representations
On a localstep cutelimination procedure for the intuitionistic sequent calculus
 Proc. of the 13th Int. Conf. on Logic for Programming Artificial Intelligence and Reasoning (LPAR’06), volume 4246 of LNCS
, 2006
"... Abstract. In this paper we investigate, for intuitionistic implicational logic, the relationship between normalization in natural deduction and cutelimination in a standard sequent calculus. First we identify a subset of proofs in the sequent calculus that correspond to proofs in natural deduction. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. In this paper we investigate, for intuitionistic implicational logic, the relationship between normalization in natural deduction and cutelimination in a standard sequent calculus. First we identify a subset of proofs in the sequent calculus that correspond to proofs in natural deduction
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
An Automatic Prover for Sequent Calculus in
"... Using the templates given in the Isabelle release [2], it is a relatively simple matter to encode rules for various sequent calculi. The only problems arise with the representation of sequents as lists, which require extra structural rules to be encoded to emulate multisets, most notably exchange. T ..."
Abstract
 Add to MetaCart
Using the templates given in the Isabelle release [2], it is a relatively simple matter to encode rules for various sequent calculi. The only problems arise with the representation of sequents as lists, which require extra structural rules to be encoded to emulate multisets, most notably exchange
Sequent Calculus for Justifications
"... We present a cutfree sequent calculus that can internalize its own proofs, providing a new justification system for modal logic. ..."
Abstract
 Add to MetaCart
We present a cutfree sequent calculus that can internalize its own proofs, providing a new justification system for modal logic.
Sequent Calculus and Data Fusion
, 2001
"... We present a formal method for data fusion, based on possibilistic logic. The method has been applied to a realworld problem of noisy sensordata fusion: the position estimation of an autonomous mobile robot navigating in an approximately and partially known office environment using a topological m ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
map. Each place in the map is characterized by a set of logical formulae axiomatizing both symbolic knowledge and uncertain information from the sensors. At each time instant during navigation, the necessity for each place is calculated using a function generated by a proof system based on sequent
Sequent Calculus and Abstract Machines
, 2004
"... The sequent calculus proof system, as an alternative to natural deduction and Hilbertstyle systems, has been wellappreciated for its structural symmetry and its applicability to automated proof search. Over the past decade, it has additionally been shown to have a computational significance, perha ..."
Abstract
 Add to MetaCart
The sequent calculus proof system, as an alternative to natural deduction and Hilbertstyle systems, has been wellappreciated for its structural symmetry and its applicability to automated proof search. Over the past decade, it has additionally been shown to have a computational significance
Results 1  10
of
209,294