Making believers out of computers
Artificial Intelligence
Introduction to mathematical logic (3rd ed.)
Introduction to mathematical logic (3rd ed.)
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Polynomially solvable satisfiability problems
Information Processing Letters
Towards a theory of access-limited logic for knowledge representation
Proceedings of the first international conference on Principles of knowledge representation and reasoning
On generalized Horn formulas and k-resolution
Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Solving Time-Dependent Planning Problems
Solving Time-Dependent Planning Problems
An analysis of approximate knowledge compilation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Knowledge compilation using theory prime implicates
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
A Logic for Approximate First-Order Reasoning
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
A logical toolbox for knowledge approximation
TARK '01 Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge
What Is Approximate Reasoning?
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
Resolution-Based approximate reasoning for OWL DL
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Semantics and proof-theory of depth bounded Boolean logics
Theoretical Computer Science
| Hi-index | 0.00 |
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.