David A. Plaisted

发表

A Structure-Preserving Clause Form Translation

David A. Plaisted, Steven Greenbaum, Steven Greenbaum, 1986, J. Symb. Comput..

Equational programming

Nachum Dershowitz, David A. Plaisted, N. Dershowitz, 1988 .

Sparse Complex Polynomials and Polynomial Reducibility

David A. Plaisted, 1977, J. Comput. Syst. Sci..

Comparison of Natural Deduction and Locking Resolution Implementations

David A. Plaisted, Steven Greenbaum, Paul O'Rorke, 1982, CADE.

An algorithm for finding canonical sets of ground rewrite rules in polynomial time

Paliath Narendran, Wayne Snyder, David A. Plaisted, 1993, JACM.

Heuristic Matching for Graphs Satisfying the Triangle Inequality

David A. Plaisted, 1984, J. Algorithms.

SGGS Theorem Proving: an Exposition

Maria Paola Bonacina, David A. Plaisted, 2014, PAAR@IJCAR.

Abstraction Using Generalization Functions

David A. Plaisted, 1986, CADE.

On the distribution of independent formulae of number theory

David A. Plaisted, 1980, STOC '80.

Rigid E-Unification: NP-Completeness and Applications to Equational Matings

Paliath Narendran, Wayne Snyder, David A. Plaisted, 1990, Inf. Comput..

Abstraction Mappings in Mechanical Theorem Proving

David A. Plaisted, D. Plaisted, 1980, CADE.

Semantically Guided First-Order Theorem Proving using Hyper-Linking

David A. Plaisted, Heng Chu, D. Plaisted, 1994, CADE.

General Algorithms for Permutations in Equational Inference

David A. Plaisted, Jürgen Avenhaus, 2004, Journal of Automated Reasoning.

Experimental Results on Subgoal Reordering

David A. Plaisted, Xumin Nie, 1990, IEEE Trans. Computers.

An Efficient Bug Location Algorithm

David A. Plaisted, 1984, ICLP.

Flowchart schemata with counters

David A. Plaisted, 1972, STOC '72.

A Complete Semantic Back Chaining Proof System

David A. Plaisted, Xumin Nie, 1990, CADE.

Complete Problems in the First-Order Predicate Calculus

David A. Plaisted, 1984, J. Comput. Syst. Sci..

Handbook of Knowledge Representation Edited Knowledge Representation and Classical Logic

Vladimir Lifschitz, David A. Plaisted, Leora Morgenstern, 2022 .

An Architecture for fast Data Movement in the FFP Machine

David A. Plaisted, D. Plaisted, 1985, FPCA.

A Semantic Backward Chaining Proof System

David A. Plaisted, Xumin Nie, 1992, Artif. Intell..

A Simplified Problem Reduction Format

David A. Plaisted, D. Plaisted, 1982, Artif. Intell..

The Efficiency of Theorem Proving Strategies

David A. Plaisted, Yunshan Zhu, 1997 .

Infinite Normal Forms (Preliminary Version)

Nachum Dershowitz, David A. Plaisted, Stéphane Kaplan, 1989, ICALP.

Non-Horn clause logic programming without contrapositives

David A. Plaisted, D. Plaisted, 1988, Journal of Automated Reasoning.

A Multiprocessor Architecture for Medium-Grain Parallelism

David A. Plaisted, J. Dean Brock, Amos R. Omondi, 1986, ICDCS.

The Application of Multivariate Polynomials to Inference Rules and Partial Tests for Unsatisfiability

David A. Plaisted, 1980, SIAM J. Comput..

Heuristics for weighted perfect matching

Edward M. Reingold, David A. Plaisted, Kenneth J. Supowit, 1980, STOC '80.

The Illinois Prover: A General Purpose Resolution Theorem Prover

David A. Plaisted, Steven Greenbaum, 1986, CADE.

Logic Programming cum Applicative Programming

Nachum Dershowitz, David A. Plaisted, D. Plaisted, 1985, SLP.

Equational Reasoning using AC Constraints

David A. Plaisted, Yunshan Zhu, 1997, IJCAI.

A Low Level Language for Obtaining Decision Procedure for Classes of temporal Logics

David A. Plaisted, D. Plaisted, 1983, Logic of Programs.

CLIN-S - A Semantically Guided First-Order Theorem Prover

David A. Plaisted, Heng Chu, D. Plaisted, 1997, Journal of Automated Reasoning.

Model Finding Strategies in Semantically Guided Instance-based Theorem Proving

David A. Plaisted, Heng Chu, D. Plaisted, 1993, ISMIS.

Using Examples, Case Analysis, and Dependency Graphs in Theorem Proving

David A. Plaisted, D. Plaisted, 1984, CADE.

A model for the parallel execution of subset-equational languages

David A. Plaisted, Amos R. Omondi, A. Omondi, 1995, Future Gener. Comput. Syst..

Term Rewriting: Some Experimental Results

David A. Plaisted, Richard C. Potter, 1991, J. Symb. Comput..

The efficiency of theorem proving strategies - a comparative and asymptotic analysis

David A. Plaisted, Yunshan Zhu, Yunshan Zhu, 1999, Computational intelligence.

Replacement Rules with Definition Detection

David A. Plaisted, Yunshan Zhu, 1998, FTP.

In the next section we consider functional programming using simplification and rewrit ing, and in the section that follows we consider logic programming using unification and nar

Nachum Dershowitz, David A. Plaisted, D. Plaisted, 1985 .

Propositional search efficiency and first-order theorem proving

David A. Plaisted, Geoffrey D. Alexander, 1996, Satisfiability Problem: Theory and Applications.

Rough Resolution: A Refinement of Resolution to Remove Large Literals

David A. Plaisted, Heng Chu, 1993, AAAI.

New NP-hard and NP-complete polynomial and integer divisibility problems

David A. Plaisted, D. Plaisted, 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

Semantically-guided goal-sensitive theorem proving (Abstract)

Maria Paola Bonacina, David A. Plaisted, 2014 .

A Heuristic Triangulation Algorithm

David A. Plaisted, Jiarong Hong, J. Hong, 1987, J. Algorithms.

Finding Logical Consequences Using Unskolemization

Ritu Chadha, David A. Plaisted, 1993, ISMIS.

A Heuristic Algorithm for Small Separators in Arbitrary Graphs

David A. Plaisted, D. Plaisted, 1990, SIAM J. Comput..

The Space Efficiency of OSHL

David A. Plaisted, Swaha Miller, 2005, TABLEAUX.

An Efficient Relevance Criterion for Mechanical Theorem Proving

David A. Plaisted, 1980, AAAI.

Some polynomial and integer divisibility problems are NP-HARD

David A. Plaisted, D. Plaisted, 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

Problem Solving by Searching for Models with a Theorem Prover

David A. Plaisted, Shie-Jue Lee, 1994, Artif. Intell..

In handbook of automated reasoning

Nachum Dershowitz, David A. Plaisted, D. Plaisted, 2001 .

Use of replace rules in theorem proving

David A. Plaisted, Shie-Jue Lee, D. Plaisted, 1994, Methods Log. Comput. Sci..

Semantically-Guided Goal-Sensitive Reasoning: Inference System and Completeness

Maria Paola Bonacina, David A. Plaisted, D. Plaisted, 2017, Journal of Automated Reasoning.

Situation Calculus with Aspect

David A. Plaisted, Yunshan Zhu, Yunshan Zhu, 1997 .

Situation Calculus by Term Rewriting pdf

David A. Plaisted, D. Plaisted, 2020, ArXiv.

The Search Efficiency of Theorem Proving Strategies

David A. Plaisted, 1994, CADE.

Some Polynomial and Integer Divisibility problems are NP-Hard

David A. Plaisted, 1978, SIAM J. Comput..

A decision procedure for combinations of propositional temporal logic and other specialized theories

David A. Plaisted, D. Plaisted, 1986, Journal of Automated Reasoning.

Source-to-Source Translation and Software Engineering

David A. Plaisted, D. Plaisted, 2013 .

Automated Deduction Techniques for Classification in Description Logic Systems

David A. Plaisted, M. Paramasivam, D. Plaisted, 1998, Journal of Automated Reasoning.

Reasoning with predicate replacement

David A. Plaisted, Shie-Jue Lee, 1991 .

Model Finding in Semantically Guided Instance-Based Theorem Proving

David A. Plaisted, Heng Chu, D. Plaisted, 1994, Fundam. Informaticae.

A sequent-style model elimination strategy and a positive refinement

David A. Plaisted, D. Plaisted, 1990, Journal of Automated Reasoning.

The Complexity of Some Complementation Problems

David A. Plaisted, Gregory Kucherov, 1999, Inf. Process. Lett..

Associative-Commutative Rewriting

Nachum Dershowitz, David A. Plaisted, Jieh Hsiang, 1983, IJCAI.

The Relative Power of Semantics and Unification

David A. Plaisted, Swaha Miller, 2013, Programming Logics.

The occur-check problem in Prolog

David A. Plaisted, 2009, New Generation Computing.

History and Prospects for First-Order Automated Deduction

David A. Plaisted, D. Plaisted, 2015, CADE.

Use of unit clauses and clause splitting in automatic deduction

David A. Plaisted, Shie-Jue Lee, 1992, Proceedings ICCI `92: Fourth International Conference on Computing and Information.

The Aspect Calculus

David A. Plaisted, D. Plaisted, 2019, CADE.

Term Rewriting: Some Experimental Results

David A. Plaisted, Richard C. Potter, 1988, CADE.

Clin: an automated reasoning system using clause linking

David A. Plaisted, Shie-Jue Lee, D. Plaisted, 1990 .

Ordered Semantic Hyper-Linking

David A. Plaisted, Yunshan Zhu, Yunshan Zhu, 1997, Journal of Automated Reasoning.

Theorem Proving with Abstraction

David A. Plaisted, D. Plaisted, 1981, Artif. Intell..

A satisfiability procedure for quantified Boolean formulae

Armin Biere, David A. Plaisted, Yunshan Zhu, 2003, Discret. Appl. Math..

Special Cases and Substitutes for Rigid E-Unification

David A. Plaisted, D. Plaisted, 2000, Applicable Algebra in Engineering, Communication and Computing.

A relevance restriction strategy for automated deduction

David A. Plaisted, Adnan H. Yahya, D. Plaisted, 2003, Artif. Intell..

The Travelling Salesman Problem and Minimum Matching in the Unit Square

Edward M. Reingold, David A. Plaisted, Kenneth J. Supowit, 1983, SIAM J. Comput..

A Goal Directed Theorem Prover

David A. Plaisted, 1988, CADE.

Ordered Semantic Hyper Tableaux

David A. Plaisted, Adnan H. Yahya, 2004, Journal of Automated Reasoning.

Refinements to Depth-First Iterative-Deepening Search in Automatic Theorem Proving

David A. Plaisted, Xumin Nie, 1989, Artif. Intell..

Theory of Partial-Order Programming

David A. Plaisted, Mauricio Osorio, Bharat Jayaraman, 1999, Sci. Comput. Program..

Properties and Extensions of Alternating Path Relevance - I pdf

David A. Plaisted, D. Plaisted, 2019, ArXiv.

Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, . .

Nachum Dershowitz, David A. Plaisted, Stéphane Kaplan, 1991, Theor. Comput. Sci..

Completion Without Failure11This research was supported in part by the National Science Foundation under grants DCR 85–13417 and DCR 85–16243.

Nachum Dershowitz, David A. Plaisted, Leo Bachmair, 1989 .

A Hierarchical Situation Calculus

David A. Plaisted, D. Plaisted, 2003, ArXiv.

Rigid E-unification is NP-complete

Paliath Narendran, Wayne Snyder, David A. Plaisted, 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

Functional programming with sets

David A. Plaisted, Bharat Jayaraman, 1987, FPCA.

Conditional Term Rewriting and First-Order Theorem Proving

David A. Plaisted, Shie-Jue Lee, Heng Chu, 1992, CTRS.

On the Mechanical Derivation of Loop Invariants

Ritu Chadha, David A. Plaisted, D. Plaisted, 1993, J. Symb. Comput..

An abstract program generation logic

David A. Plaisted, 1994 .

Eliminating duplication with the hyper-linking strategy

David A. Plaisted, Shie-Jue Lee, D. Plaisted, 1992, Journal of Automated Reasoning.

PROGRAMMING WITH PARAMETERIZED ABSTRACT OBJECTS IN OBJ.

José Meseguer, Joseph A. Goguen, David A. Plaisted, 1983 .

A Logic for Conditional Term Rewriting Systems

David A. Plaisted, 1987, CTRS.

An NP-complete matching problem

David A. Plaisted, Samuel Zaks, 1980, Discret. Appl. Math..

Programming with Equations, Subsets, and Relations

David A. Plaisted, Bharat Jayaraman, 1989, NACLP.

Correctness of Unification Without Occur Check in Prolog

Ritu Chadha, David A. Plaisted, 1994, J. Log. Program..

Semantic Confluence Tests and Completion Methods

David A. Plaisted, D. Plaisted, 1985, Inf. Control..

Proof Lengths for Equational Completion

David A. Plaisted, Andrea Sattler-Klein, 1996, Inf. Comput..

Polynomial Time Termination and Constraint Satisfaction Tests

David A. Plaisted, D. Plaisted, 1993, RTA.

Normal Form Transformations

Jean Goubault-Larrecq, Alexander Leitsch, David A. Plaisted, 2001, Handbook of Automated Reasoning.

Controlling the Consumption of Storage with Sliding Priority Search in a Hyper-Linking Based Theorem Prover

David A. Plaisted, Shie-Jue Lee, 1995, Comput. Artif. Intell..

The Undecidability of Self-Embedding for Term Rewriting Systems

David A. Plaisted, D. Plaisted, 1985, Inf. Process. Lett..

New NP-hard and NP-complete polynomial and integer divisibility problems

David A. Plaisted, D. Plaisted, 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

An Abstract Programming System

David A. Plaisted, D. Plaisted, 2003, ArXiv.

Proving Equality Theorems with Hyper-Linking

David A. Plaisted, Geoffrey D. Alexander, D. Plaisted, 1992, CADE.

Conditional rewriting

Nachum Dershowitz, David A. Plaisted, D. Plaisted, 1985, SOEN.

RRTP - A Replacement Rule Theorem Prover

David A. Plaisted, M. Paramasivam, 2004, Journal of Automated Reasoning.

The Denotional Semantics of Nondeterministic Recursive Programs using Coherent Relations

David A. Plaisted, D. Plaisted, 1986, LICS.

Fast Verification, Testing, and Generation of Large Primes

David A. Plaisted, 1979, Theor. Comput. Sci..

Interactive Online Configurator via Boolean Satisfiability Modeling

David A. Plaisted, Tao Tao, D. Plaisted, 2021, IAIT.

Semantically-guided goal-sensitive theorem proving

Maria Paola Bonacina, David A. Plaisted, D. Plaisted, 2014 .

Constraint manipulation in SGGS

Maria Paola Bonacina, David A. Plaisted, 2014 .

Proving First-Order Equality Theorems with Hyper-Linking

David A. Plaisted, D. Plaisted, Geoffrey D. Alexander, 1995 .

The Efficiency of Theorem Proving Strategies

David A. Plaisted, Yunshan Zhu, 1999, Computational Intelligence.

The search efficiency of theorem proving strategies: an analytical comparison

David A. Plaisted, 1994 .

Efficient first-order semantic deduction techniques

David A. Plaisted, Yunshan Zhu, D. Plaisted, 1998 .

IMPLEMENTATION OF AN IMPROVED RELEVANCE CRITERION.

David A. Plaisted, Stanley Jefferson, 1984 .

New applications of a fast propositional calculus decision procedure

David A. Plaisted, Shie-Jue Lee, D. Plaisted, 1990 .