Support Set Selection for Abductive and Default Reasoning

[1]  Johan de Kleer.  An Improved Incremental Algorithm for Generating Prime Implicates , 1992, AAAI.

[2]  James A. Reggia,et al.  Diagnostic Expert Systems Based on a Set Covering Model , 1983, Int. J. Man Mach. Stud..

[3]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.

[4]  Johan de Kleer,et al.  Exploiting Locality in a TMS , 1990, AAAI.

[5]  David Poole,et al.  A methodology for using a default and abductive reasoning system , 1989, Int. J. Intell. Syst..

[6]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[7]  Dan Roth,et al.  Reasoning with Models , 1994, Artif. Intell..

[8]  Hector J. Levesque,et al.  A Knowledge-Level Account of Abduction , 1989, IJCAI.

[9]  Johan de Kleer,et al.  Problem Solving with the ATMS , 1986, Artif. Intell..

[10]  Bart Selman,et al.  Knowledge Compilation using Horn Approximations , 1991, AAAI.

[11]  Bart Selman,et al.  Hard Problems for Simple Default Logics , 1989, Artif. Intell..

[12]  Sheila A. McIlraith.  Generating Tests Using Abduction , 1994, KR.

[13]  Bart Selman,et al.  Domain-Independent Extensions to GSAT : Solving Large StructuredSatis ability , 1993 .

[14]  Reasoning With Incomplete Information , 1988 .

[15]  Leon J. Osterweil,et al.  On Two Problems in the Generation of Program Test Paths , 1976, IEEE Transactions on Software Engineering.

[16]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[17]  Brian C. Williams,et al.  Diagnosis with Behavioral Modes , 1989, IJCAI.

[18]  Georg Gottlob,et al.  Identifying the Minimal Transversals of a Hypergraph and Related Problems , 1995, SIAM J. Comput..

[19]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[20]  Kenneth D. Forbus,et al.  Building Problem Solvers , 1993 .

[21]  Alvaro del Val.  Tractable Databases: How to Make Propositional Unit Resolution Complete Through Compilation , 1994, KR.

[22]  Alex Kean,et al.  An Incremental Method for Generating Prime Implicants/Impicates , 1990, J. Symb. Comput..

[23]  Bart Selman,et al.  Reasoning With Characteristic Models , 1993, AAAI.

[24]  Gregory M. Provan.  Efficiency Analysis of Multiple-Context TMSs in Scene Representation , 1987, AAAI.

[25]  Jonathan Stillman,et al.  It's Not My Default: The Complexity of Membership Problems in Restricted Propositional Default Logics , 1990, AAAI.

[26]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[27]  Raymond Reiter,et al.  Foundations of Assumption-based Truth Maintenance Systems: Preliminary Report , 1987, AAAI.

[28]  Kenneth D. Forbus,et al.  Focusing the ATMS , 1988, AAAI.

[29]  Raymond Reiter,et al.  A Theory of Diagnosis from First Principles , 1986, Artif. Intell..

[30]  Kave Eshghi,et al.  A Tractable Class of Abduction Problems , 1993, IJCAI.

[31]  Johan de Kleer,et al.  An Assumption-Based TMS , 1987, Artif. Intell..