Results 1  10
of
32,141
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 (48 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
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract

Cited by 1388 (62 self)
 Add to MetaCart
system. We also show how this approach can be adapted to handle fairness. We argue that our technique can provide a practical alternative to manual proof construction or use of a mechanical theorem prover for verifying many finitestate concurrent systems. Experimental results show that state machines
A Resolution Theorem Prover for Intuitionistic Logic
 Proceedings of CADE13
, 1996
"... We use the general scheme of building resolution calculi (also called the inverse method) originating from S.Maslov and G.Mints to design and implement a resolution theorem prover for intuitionistic logic. A number of search strategies is introduced and proved complete. The resolution method is show ..."
Abstract

Cited by 44 (4 self)
 Add to MetaCart
We use the general scheme of building resolution calculi (also called the inverse method) originating from S.Maslov and G.Mints to design and implement a resolution theorem prover for intuitionistic logic. A number of search strategies is introduced and proved complete. The resolution method
Theorem provers
, 2010
"... Termrewriting is a syntactic approach from the algebraic perspective: Normal form, ChurchRosser property (confluence), termination, critical pairs, KnuthBendix completion... Applies to (free) monoids, groups, boolean algebras, (some) finitely presented monoids, groups,... Used in algebraic specif ..."
Abstract
 Add to MetaCart
specification languages, in optimization of functional programs, in equational theorem provers,...
Prover  Automated Theorem Prover for the Classical Logic
"... In this paper we extend our clausal resolution method for linear temporal logics to a simple branchingtime framework. The branching time temporal logics considered are Computation Tree Logic (CTL), often regarded as the simplest useful logic of this class, and Extended CTL (ECTL), which is CTL e ..."
Abstract
 Add to MetaCart
In this paper we extend our clausal resolution method for linear temporal logics to a simple branchingtime framework. The branching time temporal logics considered are Computation Tree Logic (CTL), often regarded as the simplest useful logic of this class, and Extended CTL (ECTL), which is CTL
A Resolution Prover for Coalition Logic
"... We present a prototype tool for automated reasoning for Coalition Logic, a nonnormal modal logic that can be used for reasoning about cooperative agency. The theorem prover CLProver is based on recent work on a resolutionbased calculus for Coalition Logic that operates on coalition problems, a nor ..."
Abstract
 Add to MetaCart
We present a prototype tool for automated reasoning for Coalition Logic, a nonnormal modal logic that can be used for reasoning about cooperative agency. The theorem prover CLProver is based on recent work on a resolutionbased calculus for Coalition Logic that operates on coalition problems, a
Application of theorem proving to problem solving
, 1969
"... This paper shows how an extension of the resolution proof procedure can be used to construct problem solutions. The extended proof procedure can solve problems involving state transformations. The paper explores several alternate problem representations and provides a discussion of solutions to samp ..."
Abstract

Cited by 264 (1 self)
 Add to MetaCart
computer programs and can solve practical problems for a simple robot. Key Words: Theorem proving, resolution, problem solving, automatic programming, program writing, robots, state transformations, question answering. Automatic theorem proving by the resolution proof procedure ยง represents perhaps
Constructing Conditional Plans by a TheoremProver
 Journal of Artificial Intelligence Research
, 1999
"... The research on conditional planning rejects the assumptions that there is no uncertainty or incompleteness of knowledge with respect to the state and changes of the system the plans operate on. Without these assumptions the sequences of operations that achieve the goals depend on the initial sta ..."
Abstract

Cited by 155 (6 self)
 Add to MetaCart
state and the outcomes of nondeterministic changes in the system. This setting raises the questions of how to represent the plans and how to perform plan search. The answers are quite different from those in the simpler classical framework. In this paper, we approach conditional planning from a new
A Theorem Prover for a Computational Logic
, 1990
"... We briefly review a mechanical theoremprover for a logic of recursive functions over finitely generated objects including the integers, ordered pairs, and symbols. The prover, known both as NQTHM and as the BoyerMoore prover, contains a mechanized principle of induction and implementations of line ..."
Abstract

Cited by 28 (0 self)
 Add to MetaCart
We briefly review a mechanical theoremprover for a logic of recursive functions over finitely generated objects including the integers, ordered pairs, and symbols. The prover, known both as NQTHM and as the BoyerMoore prover, contains a mechanized principle of induction and implementations
Results 1  10
of
32,141