There has recently been considerable progress in the area of using computers as a tool for theorem proving. In this paper we focus on one facet of human-computer interaction in such systems: generating natural language explanations from proofs. We first discuss the X proof system- a tactic style theorem proving system for first-order logic with a collection of inference rules corresponding to human-oriented proof techniques. In X, proofs are stored as they are discovered using a structured term representation. We describe a method for producing natural language explanations of proofs via a simple mapping algorithm from proof structures to text. Nonclassical or specialized logics are often used in specialized applications. For example, modal...
Logic programming languages have many characteristics that indicate that they should serve as good i...
In this work, the problem of performing abduction in modal logics is addressed, along the lines of [...
The authors consider some computational properties of intuitionistic 2-sequent calculus [see A. Masi...
There has recently been considerable progress in the area of using computers as a tool for theorem p...
Various modal logics seem well suited for developing models of knowledge, belief, time, change, caus...
Proof structures in traditional automatic theorem proving systems are generally designed for efficie...
Modal logic is a widely applicable method of reasoning for many areas of computer science. These are...
We present and discuss various formalizations of Modal Logics in Logical Frameworks based on Type Th...
This is the first book-length treatment of hybrid logic and its proof-theory. Hybrid logic is an ext...
In this thesis we develop a comprehensive human-oriented theorem proving system that integrates seve...
Modal logics offer natural, declarative representations for describing both the modular structure of...
Modal logics offer natural, declarative representations for describing both the modular structure of...
The talk introduces Modal Logic as an extension of classical propositional and First Order Logics. W...
In this work, we present the design and implementation of a system for proof explanation in the Sema...
One of the main issues in proof certification is that different theorem provers, even when designed ...
Logic programming languages have many characteristics that indicate that they should serve as good i...
In this work, the problem of performing abduction in modal logics is addressed, along the lines of [...
The authors consider some computational properties of intuitionistic 2-sequent calculus [see A. Masi...
There has recently been considerable progress in the area of using computers as a tool for theorem p...
Various modal logics seem well suited for developing models of knowledge, belief, time, change, caus...
Proof structures in traditional automatic theorem proving systems are generally designed for efficie...
Modal logic is a widely applicable method of reasoning for many areas of computer science. These are...
We present and discuss various formalizations of Modal Logics in Logical Frameworks based on Type Th...
This is the first book-length treatment of hybrid logic and its proof-theory. Hybrid logic is an ext...
In this thesis we develop a comprehensive human-oriented theorem proving system that integrates seve...
Modal logics offer natural, declarative representations for describing both the modular structure of...
Modal logics offer natural, declarative representations for describing both the modular structure of...
The talk introduces Modal Logic as an extension of classical propositional and First Order Logics. W...
In this work, we present the design and implementation of a system for proof explanation in the Sema...
One of the main issues in proof certification is that different theorem provers, even when designed ...
Logic programming languages have many characteristics that indicate that they should serve as good i...
In this work, the problem of performing abduction in modal logics is addressed, along the lines of [...
The authors consider some computational properties of intuitionistic 2-sequent calculus [see A. Masi...