Results 1  10
of
34,464
A circumscriptive theorem prover: Preliminary report
 In Proc. Seventh National Conference on Artificial Intelligence
, 1988
"... We discuss the application of an assumptionbased truth maintenance system to the construction of a circumscriptive theorem prover, showing that the connection discovered by Reiter and de Kleer between assumptionbased truth maintenance and prime implicants relates to the notions of minimality a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We discuss the application of an assumptionbased truth maintenance system to the construction of a circumscriptive theorem prover, showing that the connection discovered by Reiter and de Kleer between assumptionbased truth maintenance and prime implicants relates to the notions of minimality
Circumscription
, 1996
"... The idea of circumscription can be explained on a simple example. We would like to represent information about the locations of blocks in a blocks world, using the "default": ..."
Abstract

Cited by 342 (10 self)
 Add to MetaCart
The idea of circumscription can be explained on a simple example. We would like to represent information about the locations of blocks in a blocks world, using the "default":
Applications Of Circumscription To Formalizing Common Sense Knowledge
 Artificial Intelligence
, 1986
"... We present a new and more symmetric version of the circumscription method of nonmonotonic reasoning first described in (McCarthy 1980) and some applications to formalizing common sense knowledge. The applications in this paper are mostly based on minimizing the abnormality of different aspects o ..."
Abstract

Cited by 536 (12 self)
 Add to MetaCart
We present a new and more symmetric version of the circumscription method of nonmonotonic reasoning first described in (McCarthy 1980) and some applications to formalizing common sense knowledge. The applications in this paper are mostly based on minimizing the abnormality of different aspects
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
Simplify: A theorem prover for program checking
 J. ACM
, 2003
"... This paper provides a detailed description of the automatic theorem prover Simplify, which is the proof engine of the Extended Static Checkers ESC/Java and ESC/Modula3. Simplify uses the NelsonOppen method to combine decision procedures for several important theories, and also employs a matcher to ..."
Abstract

Cited by 432 (2 self)
 Add to MetaCart
This paper provides a detailed description of the automatic theorem prover Simplify, which is the proof engine of the Extended Static Checkers ESC/Java and ESC/Modula3. Simplify uses the NelsonOppen method to combine decision procedures for several important theories, and also employs a matcher
A Theorem Prover for Prioritized Circumscription
 In Proc. 11th International Joint Conf. on Artificial Intelligence (IJCAI
, 1989
"... In a recent paper, Ginsberg shows how a backwardchaining atms can be used to construct a theorem prover for circumscription. Here, this work is extended to handle prioritized circumscription. The ideas to be described have been implemented, and examples are given of the system in use. 1 Introduct ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
In a recent paper, Ginsberg shows how a backwardchaining atms can be used to construct a theorem prover for circumscription. Here, this work is extended to handle prioritized circumscription. The ideas to be described have been implemented, and examples are given of the system in use. 1
A Theorem Prover for Prioritized Circumscription
"... In a recent paper, Ginsberg shows how a backwardchaining ATMS can be used to con struct a theorem prover for circumscription. Here, this work is extended to handle prior itized circumscription. The ideas to be described have been implemented, and examples are given of the system in use. ..."
Abstract
 Add to MetaCart
In a recent paper, Ginsberg shows how a backwardchaining ATMS can be used to con struct a theorem prover for circumscription. Here, this work is extended to handle prior itized circumscription. The ideas to be described have been implemented, and examples are given of the system in use.
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 1384 (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
The knowledge complexity of interactive proof systems
 in Proc. 27th Annual Symposium on Foundations of Computer Science
, 1985
"... Abstract. Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a graph is Hamiltonian it suffices to exhibit a Hamiltonian tour in it; however, this seems to contain more knowledge than the single bit Hamiltonian/nonHamiltoni ..."
Abstract

Cited by 1267 (42 self)
 Add to MetaCart
Abstract. Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a graph is Hamiltonian it suffices to exhibit a Hamiltonian tour in it; however, this seems to contain more knowledge than the single bit Hamiltonian
Construction of abstract state graphs with PVS
, 1997
"... We describe in this paper a method based on abstract interpretation which, from a theoretical point of view, is similar to the splitting methods proposed in [DGG93, Dam96] but the weaker abstract transition relation we use, allows us to construct automatically abstract state graphs paying a reasonab ..."
Abstract

Cited by 748 (10 self)
 Add to MetaCart
. This successor m 0 can be determined exactly if for each predicate ' i it can be determined if ' i or :' i is a postcondition of m for ΓΈ . In order to do this, we use the Pvs theorem prover [SOR93] and our Pvsinterface defined in [GS96]. If the tactic used for the proof of the verification
Results 1  10
of
34,464