Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Boddy, T. Dean (1989)
Solving Time-Dependent Planning Problems
P. Marquis (1995)
Knowledge Compilation Using Theory Prime Implicates
Departamento de Ingenieria Informatica
N. Belnap (1977)
A Useful Four-Valued Logic
Marco Cadoli, M. Schaerf (1992)
Approximation in Concept Description Languages
J. Lloyd (1987)
Foundations of logic programming; (2nd extended ed.)
Bernhard Nebel, C. Rich, W. Swartout (1992)
Principles of knowledge representation and reasoning: proceedings of the Third International Conference (KR'92)
E. Mendelson (1979)
Introduction to Mathematical Logic
H. Levesque (1984)
A Logic of Implicit and Explicit Belief
J. Doyle, R. Patil (1991)
Two Theses of Knowledge Representation: Language Restrictions, Taxonomic Classification, and the Utility of Representation ServicesArtif. Intell., 48
M. Dalal (1992)
Tractable Deduction in Knowledge Representation Systems
H. Levesque (1986)
Making Believers out of ComputersArtif. Intell., 30
W. Dowling, J. Gallier (1984)
Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn FormulaeJ. Log. Program., 1
A. Tarski (1955)
A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONSPacific Journal of Mathematics, 5
M. Dalal, Alexander Borgida (1995)
Tractable reasoning in knowledge representation systems
J. Crawford, B. Kuipers (1991)
Negation and Proof by Contradiction in Access-Limited Logic
David McAllester (1990)
Truth Maintenance
G. Gallo, M. Scutellá (1988)
Polynomially Solvable Satisfiability ProblemsInf. Process. Lett., 29
R. Reiter, J. Kleer (1987)
Foundations of Assumption-based Truth Maintenance Systems: Preliminary Report
A. Anderson, N. Belnap, J. Dunn (1975)
Entailment : the logic of relevance and necessity
H. Büning (1993)
On generalized Horn formulas and k-resolutionTheor. Comput. Sci., 116
M. Dalal (1992)
Efficient Propositional Constraint Propagation
B. Selman, Henry Kautz (1991)
Knowledge Compilation using Horn Approximations
Alan Frisch (1987)
Inference without Chaining
J. Crawford, B. Kuipers (1989)
Towards a Theory of Access-Limited Logic for Knowledge Representation
E. Mendelson (1987)
Introduction to mathematical logic (3. ed.)
S. Cook (1971)
The complexity of theorem-proving proceduresProceedings of the third annual ACM symposium on Theory of computing
J. Lloyd (1984)
Foundations of Logic Programming
R. Dionne, E. Mays, Frank Oles (1993)
The Equivalence of Model-Theoretic and Structural Subsumption in Description Logics
David McAllester (1980)
An Outlook on Truth Maintenance.
M. Garey (1979)
Johnson: computers and intractability: a guide to the theory of np- completeness (freeman
Given any incomplete clausal propositional reasoner satisfying certain properties, we extend it to a family of increasingly‐complete, sound, and tractable reasoners. Our technique for generating these reasoners is based on restricting the length of the clauses used in chaining (Modus Ponens). Such a family of reasoners constitutes an anytime reasoner, since each propositional theory has a complete reasoner in the family. We provide an alternative characterization, based on a fixed‐point construction, of the reasoners in our anytime families. This fixed‐point characterization is then used to define a transformation of propositional theories into logically equivalent theories for which the base reasoner is complete; such theories are called “vivid”. Developing appropriate notions of vividness and techniques for compiling theories into vivid theories has already generated considerable interest in the KR community. We illustrate our approach by developing an anytime family based on Boolean constraint propagation.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Oct 4, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.