#### Filter Results:

- Full text PDF available (38)

#### Publication Year

1973

2013

- This year (0)
- Last 5 years (1)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Abduction is inference to the best explanation. In the TACITUS project at SRI we have developed an approach to abductive inference, called "weighted abduction", that has resulted in a significant simplification of how the problem of interpreting texts is conceptualized. The interpretation of a text is the minimal explanation of why the text would be true.… (More)

- Gerald E. Peterson, Mark E. Stickel
- J. ACM
- 1981

An extenston of the Knuth-Bendix algorithm for finding complete sets of reductions is described. The extension is intended to handle equational theories which can be split into two parts, R and T, such that each equation m R can be construed as a reduction and T represents an equational theory for which a finite, complete umficat~on algorithm ~s known. The… (More)

- Mark E. Stickel
- Journal of Automated Reasoning
- 1985

Theory resolution constitutes a set of complete procedures for incorporating theories into a resolution theorem-proving program, thereby making it unnecessary to resolve directly upon axioms of the theory. This can reduce the length of proofs and the size of the search space. Theory resolution effects a beneficial division of labor, improving the… (More)

- Jerry R. Hobbs, Douglas E. Appelt, +4 authors Mabry Tyson
- ArXiv
- 1996

FASTUS is a system for extracting information from natural language text for entry into a database and for other applications. It works essentially as a cascaded, nondeterministic nite-state automaton. There are ve stages in the operation of FASTUS. In Stage 1, names and other xed form expressions are recognized. In Stage 2, basic noun groups, verb groups,… (More)

- Mark E. Stickel
- Journal of Automated Reasoning
- 1986

A Prolog technology theorem prover (PTTP) is an extension of Prolog that is complete for the full first-order predicate calculus. It differs from Prolog in its use of unification with the occurs check for soundness, the model-elimination reduction rule that is added to Prolog inferences to make the inference system complete, and depth-first… (More)

- Mark E. Stickel
- J. ACM
- 1981

An important component of automated theorem-proving systems are unification algorithms which fred most general substitutions which, when apphed to two expressions, make them equivalent Functions which are associative and commutative (such as the arithmetic addition and multiphcatton functions) are often the subject of automated theorem proving An algorithm… (More)

Automated deduction techniques are being used in a system called Amphion to derive, from graphical speciications, programs composed from a subroutine library. The system has been applied to construct software for the planning and analysis of interplanetary missions. The library for that application is a collection of subroutines written in FORTRAN-77 at JPL… (More)

- Mark E. Stickel
- Annals of Mathematics and Artificial Intelligence
- 1991

By determining what added assumptions would suffice to make the logical form of a sentence in natural language provable, abductive inference can be used in the interpretation of sentences to determine what information should be added to the listener's knowledge, i.e., what he should learn from the sentence. This is a comparatively new application of… (More)

- Hantao Zhang, Mark E. Stickel
- Journal of Automated Reasoning
- 2000

The method proposed by Davis, Putnam, Logemann, and Loveland for propositional reasoning, often referred to as the Davis–Putnam method, is one of the major practical methods for the satisfiability (SAT) problem of propositional logic. We show how to implement the Davis–Putnam method efficiently using the trie data structure for propositional clauses. A new… (More)

- Robert S. Boyer, Ewing L. Lusk, William McCune, Ross A. Overbeek, Mark E. Stickel, Larry Wos
- Journal of Automated Reasoning
- 1986

In this paper we present a set of clauses for set theory, thus developing a foundation for the expression of most theorems of mathematics in a form acceptable to a resolution-based automated theoren prover. Because Gödel's formulation of set theory permits presentation in a finite number of first-orde formulas, we employ it rather than that of… (More)