Add to ORKGWe have implemented a reasoning system, called BREAD, which includes truth maintenance, equality, and pattern-directed invocation. This paper reports on the solution of two technical problems arising out of the interaction between these mechanisms. The first result is an algorithm which ensures the completeness of pattern-directed invocation with respect to equality. The second result is an algorithm which reduces a class of redundant proofs.MIT Artificial Intelligence Laborator
A simple technique for reasoning about equalities that is fast and complete for ground formulas with...
Many procedurally-oriented problem solving systems can be viewed as performing a mixture of comput...
AbstractThis paper studies truth maintenance and belief revision tasks on singly-connected structure...
The interaction of pattern-directed invocation with equality in an automated reasoning system give...
International audienceThe kinds of inference rules and decision procedures that one writes for proof...
A truth maintenance system (TMS) is an AI system used to monitor consistency of information in a kno...
AbstractThe negation of equality is an important relation that arises naturally in the study of equa...
AbstractThe kinds of inference rules and decision procedures that one writes for proofs involving eq...
Several existing program verification and automated prooff systems make use of similar decision pro...
We present a framework for the integration of the Knuth-Bendix completion algorithm with narrowing m...
Expert systems are too slow. This work attacks that problem by speeding up a useful system compone...
Abstract. We give an approach for deciding satisfiability of equality logic formulas (E-SAT) in conj...
The thesis developed here is that reasoning programs which take care to record the logical justifi...
An obstacle to practical logic programming systems with equality is infinite computation. In the dis...
In this paper, we offer a set of problems for evaluating the power of automated theorem-proving prog...
A simple technique for reasoning about equalities that is fast and complete for ground formulas with...
Many procedurally-oriented problem solving systems can be viewed as performing a mixture of comput...
AbstractThis paper studies truth maintenance and belief revision tasks on singly-connected structure...
The interaction of pattern-directed invocation with equality in an automated reasoning system give...
International audienceThe kinds of inference rules and decision procedures that one writes for proof...
A truth maintenance system (TMS) is an AI system used to monitor consistency of information in a kno...
AbstractThe negation of equality is an important relation that arises naturally in the study of equa...
AbstractThe kinds of inference rules and decision procedures that one writes for proofs involving eq...
Several existing program verification and automated prooff systems make use of similar decision pro...
We present a framework for the integration of the Knuth-Bendix completion algorithm with narrowing m...
Expert systems are too slow. This work attacks that problem by speeding up a useful system compone...
Abstract. We give an approach for deciding satisfiability of equality logic formulas (E-SAT) in conj...
The thesis developed here is that reasoning programs which take care to record the logical justifi...
An obstacle to practical logic programming systems with equality is infinite computation. In the dis...
In this paper, we offer a set of problems for evaluating the power of automated theorem-proving prog...
A simple technique for reasoning about equalities that is fast and complete for ground formulas with...
Many procedurally-oriented problem solving systems can be viewed as performing a mixture of comput...
AbstractThis paper studies truth maintenance and belief revision tasks on singly-connected structure...