#### Filter Results:

- Full text PDF available (41)

#### 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

Hobbs, J.R., M.E. Stickel, D.E. Appelt and P. Martin, Interpretation as abduction, Artificial Intelligence 63 (1993) 69-142. 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… (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)

- 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
- 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)

- 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)

- Mark E. Stickel
- Theor. Comput. Sci.
- 1990

A Prolog technology theorem prover (PTTP) is an extension of Prolog that is complete for the full rst-order predicate calculus. It di ers from Prolog in its use of uni cation with the occurs check for soundness, depthrst iterative-deepening search instead of unbounded depthrst search to make the search strategy complete, and the model elimination reduction… (More)

- Mark E. Stickel
- New Generation Computing
- 1984

An extension of Prolog, based on the model elimination theorem-proving procedure, would permit production of a logically complete Prolog technology theorem prover capable of performing inference operations at a rate approaching that of Prolog itself.

Automated deduction techniques are being used in a system called Amphion to derive, from graphical speci cations, 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)

- Tomás E. Uribe, Mark E. Stickel
- CCL
- 1994

We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the Davis-Putnam procedure. Experimental results indicate that the Davis-Putnam procedure outperforms obdds in hard constraint-satisfaction problems, while obdds are clearly superior for Boolean functional equivalence problems from the circuit… (More)