Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Anytime clausal reasoning

Anytime clausal reasoning 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Annals of Mathematics and Artificial Intelligence Springer Journals

Loading next page...
 
/lp/springer-journals/anytime-clausal-reasoning-8com6YxWxP
Publisher
Springer Journals
Copyright
Copyright © 1998 by Kluwer Academic Publishers
Subject
Computer Science; Computer Science, general; Artificial Intelligence (incl. Robotics); Mathematics, general; Complexity
ISSN
1012-2443
eISSN
1573-7470
DOI
10.1023/A:1018947704302
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Annals of Mathematics and Artificial IntelligenceSpringer Journals

Published: Oct 4, 2004

References