Results 1  10
of
5,695
Computational LambdaCalculus and Monads
, 1988
"... The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise the ..."
Abstract

Cited by 505 (7 self)
 Add to MetaCart
The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise
Algebra and Sequent Calculus for Epistemic Actions
 ENTCS PROCEEDINGS OF LOGIC AND COMMUNICATION IN MULTIAGENT SYSTEMS (LCMAS) WORKSHOP, ESSLLI 2004
, 2005
"... We introduce an algebraic approach to Dynamic Epistemic Logic. This approach has the advantage that: (i) its semantics is a transparent algebraic object with a minimal set of primitives from which most ingredients of Dynamic Epistemic Logic arise, (ii) it goes with the introduction of nondeterminis ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
constitute a quantale. We also introduce a corresponding sequent calculus (which extends Lambek calculus), in which propositions, actions as well as agents appear as resources in a resourcesensitive dynamicepistemic logic.
Uniform proofs as a foundation for logic programming
 ANNALS OF PURE AND APPLIED LOGIC
, 1991
"... A prooftheoretic characterization of logical languages that form suitable bases for Prologlike programming languages is provided. This characterization is based on the principle that the declarative meaning of a logic program, provided by provability in a logical system, should coincide with its ..."
Abstract

Cited by 425 (124 self)
 Add to MetaCart
with its operational meaning, provided by interpreting logical connectives as simple and fixed search instructions. The operational semantics is formalized by the identification of a class of cutfree sequent proofs called uniform proofs. A uniform proof is one that can be found by a goaldirected search
Intuitionistic Epistemic Logic
, 2014
"... We outline an intuitionistic view of knowledge which maintains the original BrouwerHeytingKolmogorov semantics of intuitionism and is consistent with Williamson’s suggestion that intuitionistic knowledge be regarded as the result of verification. We argue that on this view coreflection A → KA is ..."
Abstract
 Add to MetaCart
is valid and reflection KA → A is not; the latter is a distinctly classical principle, too strong as the intuitionistic truth condition for knowledge which can be more adequately expressed by other modal means, e.g. ¬A → ¬KA “false is not known. ” We introduce a system of intuitionistic epistemic logic
The Foundation of a Generic Theorem Prover
 Journal of Automated Reasoning
, 1989
"... Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized. Isabell ..."
Abstract

Cited by 471 (49 self)
 Add to MetaCart
Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized
Logic Programming with Focusing Proofs in Linear Logic
 Journal of Logic and Computation
, 1992
"... The deep symmetry of Linear Logic [18] makes it suitable for providing abstract models of computation, free from implementation details which are, by nature, oriented and non symmetrical. I propose here one such model, in the area of Logic Programming, where the basic computational principle is C ..."
Abstract

Cited by 416 (8 self)
 Add to MetaCart
The deep symmetry of Linear Logic [18] makes it suitable for providing abstract models of computation, free from implementation details which are, by nature, oriented and non symmetrical. I propose here one such model, in the area of Logic Programming, where the basic computational principle
A Sequent Calculus for the Logic of Epistemic Inconsistency
, 1994
"... A sequent calculus for a paraconsistent logic of interest to Artificial Intelligence, the Logic of Epistemic Inconsistent, is presented. This logic has been designed to serve as a monotonic basis for nonmonotonically extended inference patterns. Its main feature is the ability to handle inconsistenc ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
A sequent calculus for a paraconsistent logic of interest to Artificial Intelligence, the Logic of Epistemic Inconsistent, is presented. This logic has been designed to serve as a monotonic basis for nonmonotonically extended inference patterns. Its main feature is the ability to handle
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
Results 1  10
of
5,695