Author image not provided
 David Alan Plaisted

Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article7.11
Citation Count583
Publication count82
Publication years1972-2017
Available for download5
Average downloads per article292.00
Downloads (cumulative)1,460
Downloads (12 Months)24
Downloads (6 Weeks)5
Arrow RightAuthor only
· Advisor only
· All roles

See all colleagues of this author

See all subject areas


82 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 82
Result page: 1 2 3 4 5

Sort by:

August 2017 Journal of Automated Reasoning: Volume 59 Issue 2, August 2017
Publisher: Springer-Verlag New York, Inc.
Citation Count: 0

We present a new method for clausal theorem proving, named SGGS from semantically-guided goal-sensitive reasoning. SGGS generalizes to first-order logic the conflict-driven clause learning (CDCL) procedure for propositional satisfiability. Starting from an initial interpretation, used for semantic guidance, SGGS employs a sequence of constrained clauses to represent a candidate model, ...
Keywords: Refutational completeness, Conflict-driven clause learning, Goal sensitivity, Semantic guidance, Theorem proving

February 2016 Journal of Automated Reasoning: Volume 56 Issue 2, February 2016
Publisher: Springer-Verlag New York, Inc.
Citation Count: 2

SGGS (Semantically-Guided Goal-Sensitive reasoning) is a clausal theorem-proving method, which generalizes to first-order logic the Davis-Putnam-Loveland-Logemann procedure with conflict-driven clause learning (DPLL-CDCL). SGGS starts from an initial interpretation, and works towards modifying it into a model of a given set of clauses, reporting unsatisfiability if there is no model. The ...
Keywords: Model building, Semantic guidance, Theorem proving

September 2005 TABLEAUX'05: Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Publisher: Springer-Verlag
Citation Count: 0

Ordered semantic hyper-linking (OSHL) is a first-order theorem prover that tries to take advantage of the speed of propositional theorem proving techniques. It instantiates first-order clauses to ground clauses, and applies propositional techniques to these ground clauses. OSHL-U extends OSHL with rules for unit clauses to speed up the instantiation ...

August 2003 Discrete Applied Mathematics - The renesse issue on satisfiability: Volume 130 Issue 2, 15 August 2003
Publisher: Elsevier Science Publishers B. V.
Citation Count: 23

We present a satisfiability tester QSAT for quantified Boolean formulae and a restriction Q SAT CNF of QSAT to unquantified conjunctive normal form formulae. QSAT makes use of procedures which replace subformulae of a formula by equivalent formulae. By a sequence of such replacements, the original formula can be simplified ...
Keywords: BDDs, circuit verification, Davis and Putnam procedure, cut width, satisfiability, QBF, model checking

March 2003 Artificial Intelligence: Volume 144 Issue 1-2, March 2003
Publisher: Elsevier Science Publishers Ltd.
Citation Count: 7

Identifying relevant clauses before attempting a proof may lead to more efficient automated theorem proving. Relevance is here defined relative to a given set of clauses S and one or more distinguished sets of support T . The role of a set of support T can be played by the ...
Keywords: sorted inference, relevance metrics, theorem proving, relevance

September 2002 Journal of Automated Reasoning: Volume 29 Issue 1, 2002
Publisher: Springer-Verlag New York, Inc.
Citation Count: 2

A family of tableau methods, called i>ordered semantic hyper (i>OSH ) i>tableau methods for first-order theories with function symbols, is presented. These methods permit semantic information to guide the search for a proof. They also may make use of orderings on literals, clauses, and interpretations to guide the search. In ...
Keywords: literal ordering, semantics, tableaux, automated theorem proving

April 2001 Journal of Automated Reasoning: Volume 26 Issue 3, April 2001
Publisher: Springer-Verlag New York, Inc.
Citation Count: 3

Mechanized systems for equational inference often produce many terms that are permutations of one another. We propose to gain efficiency by dealing with such sets of terms in a uniform manner, by the use of efficient general algorithms on permutation groups. We show how permutation groups arise naturally in equational ...
Keywords: term rewriting, permutations, equational inference

October 2000 Journal of Automated Reasoning: Volume 25 Issue 3, October 2000
Publisher: Springer-Verlag New York, Inc.
Citation Count: 25

The ordered semantic hyper-linking strategy is complete for first-order logic and accepts a user-specified natural semantics that guides the search for a proof. Any semantics in which the meanings of the function and predicate symbols are computable on ground terms may be used. This instance-based strategy is efficient on near-propositional ...
Keywords: automated theorem proving, hyper-linking, semantics

January 2000 Selected Papers from Automated Deduction in Classical and Non-Classical Logics
Publisher: Springer-Verlag
Citation Count: 3

The way in which a theorem prover handles definitions can have a significant effect on its performance. Many first-order clause form theorem provers perform badly on theorems such as those from set theory that are proven largely by expanding definitions. The technique of using replacement rules permits automatic proofs of ...

July 1999 Science of Computer Programming: Volume 34 Issue 3, July 1999
Publisher: Elsevier North-Holland, Inc.
Citation Count: 6

Keywords: functional programming, model-theoretic semantics, stratification, functional query language, memo table, monotonicity, reduction semantics

June 1998 Journal of Automated Reasoning: Volume 20 Issue 3, June 1998
Publisher: Springer-Verlag New York, Inc.
Citation Count: 12

Mechanical theorem provers are becoming increasingly more powerful, and we believe that it is time to examine whether certain tasks that have formerly been accomplished by other means can now be performed efficiently by a theorem prover. One such task is classification in description logic-based knowledge representation systems. Description logic ...
Keywords: subsumption checking, theorem proving, description logic systems

August 1997 IJCAI'97: Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Publisher: Morgan Kaufmann Publishers Inc.
Citation Count: 1

Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generates a large number of rewrite rules. By comparing it with a ground completion procedure, we show that many of the rewrite rules generated are redundant. A set of ...

July 1997 AAAI'97/IAAI'97: Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Publisher: AAAI Press
Citation Count: 6

In this paper, we present a novel first order theorem proving strategy - ordered semantic hyper linking. Ordered semantic hyper linking (OSHL) is an instance-based refutational theorem proving strategy. It is sound and complete. OSHL has an efficient propositional decision procedure. It solves first order problems by reducing them to ...

April 1997 Journal of Automated Reasoning: Volume 18 Issue 2, April 1997
Publisher: Springer-Verlag New York, Inc.
Citation Count: 4

The Replacement Rule Theorem Prover (RRTP) is an instance-based, refutational, first-order clausal theorem prover. The prover is motivated by the idea of selectively replacing predicates by their definitions, and operates by selecting relevant instances of the input clauses. The relevant instances are grounded, if necessary, and tested for unsatisfiability by ...
Keywords: replacement, instance based theorem prover, propositional calculus decision procedure, automated theorem proving, RRTP, competition

April 1997 Journal of Automated Reasoning: Volume 18 Issue 2, April 1997
Publisher: Springer-Verlag New York, Inc.
Citation Count: 5

CLIN-S is an instance-based, clause-form first-order theorem prover. CLIN-S employs three inference procedures: semantic hyper-linking, which uses semantics to guide the proof search and performs well on non-Horn parts of the proofs involving small literals, rough resolution, which removes large literals in the proofs, and UR resolution, which proves the ...
Keywords: CLIN-S, automated theorem proving, semantics, competition, hyper-linking, resolution

March 1996 Information and Computation - special issue: symposium on theoretical aspects of computer software TACS '94: Volume 125 Issue 2, March 15, 1996
Publisher: Academic Press, Inc.
Citation Count: 14

We first show that ground term-rewriting systems can be completed in a polynomial number of rewriting steps, if the appropriate data structure for terms is used. We then apply this result to study the lengths of critical pair proofs in non-ground systems, and obtain bounds on the lengths of critical ...


June 1995 Future Generation Computer Systems: Volume 11 Issue 3, June 1995
Publisher: Elsevier Science Publishers B. V.
Citation Count: 0

Keywords: functional languages, parallel processing, subset-equation languages, term-rewriting, dataflow graphs, nondeterminism

April 1995 Fundamenta Informaticae: Volume 24 Issue 1-2, April 1995
Publisher: IOS Press
Citation Count: 0

September 1994 Artificial Intelligence: Volume 69 Issue 1-2, Sept. 1994
Publisher: Elsevier Science Publishers Ltd.
Citation Count: 3

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us