Results 11  20
of
10,923
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
Chapter 3 Sequent Calculus
"... hesis for the moment, the main judgment w 1 :A 1 res; : : : ; wn :An res =) C goal expresses Under the linear hypothesis that we have resources A 1 ; : : : ; An we can achieve goal C. In order to model validity, we add inexhaustible resources or resource factories, written A fact. We obtain (v ..."
Abstract
 Add to MetaCart
therefore have the following rule. init u ;u:A res =) A goal We call such as sequent initia
Complexity of the Intuitionistic Sequent Calculus
, 1998
"... We initiate the study of proof complexity for intuitionistic propositional proof systems: It is known that the set of intuitionistic tautologies is PSPACEcomplete (as opposed to coNPcomplete in the classical case). We show that formulas derived from the "clique tautologies " used in clas ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
in classical proof complexity have only exponentialsize proofs in intuitionistic sequent calculi or Frege systems (without substitution). This is in contrast to the classical case where the complexity of Frege systems is still open.
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 and the Specification of Computation
, 2001
"... These notes are being used with lectures for CSE 597 at Penn State in Fall 2001. These notes had been prepared to accompany lectures given at the Marktoberdorf Summer School, 29 July – 10 August 1997 for a course titled “Proof Theoretic Specification of Computation”. An earlier draft ..."
Abstract
 Add to MetaCart
These notes are being used with lectures for CSE 597 at Penn State in Fall 2001. These notes had been prepared to accompany lectures given at the Marktoberdorf Summer School, 29 July – 10 August 1997 for a course titled “Proof Theoretic Specification of Computation”. An earlier draft
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
. In both cases, it is possible to relate transition paths to proofs in sequent calculus. In neither encoding, however, does it seem possible to capture properties, such as simulation and bisimulation, that need to consider all possible transitions or all possible computation paths. We consider augmenting
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
but not the classical sequent calculus motivate a generalization of the classical notion of Herbrand functions. Proof search using generalized Herbrand functions also provides a framework for generalizing logic programming to subsets of intuitionistic logic that are larger than Horn clauses. The search procedure
Monadic translation of intuitionistic sequent calculus
, 2009
"... This paper proposes and analyses a monadic translation of an intuitionistic sequent calculus. The source of the translation is a typed λcalculus previously introduced by the authors, corresponding to the intuitionistic fragment of the callbyname variant of λµ˜µ of Curien and Herbelin, and the tar ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
This paper proposes and analyses a monadic translation of an intuitionistic sequent calculus. The source of the translation is a typed λcalculus previously introduced by the authors, corresponding to the intuitionistic fragment of the callbyname variant of λµ˜µ of Curien and Herbelin
Results 11  20
of
10,923