Completed logic programs and their consistency
Journal of Logic Programming
Extended stable semantics for normal and disjunctive programs
Logic programming
Handbook of theoretical computer science (vol. B)
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Abduction in logic programming: a new definition and an abductive procedure based on rewriting
Artificial Intelligence
ASSAT: computing answer sets of a logic program by SAT solvers
Artificial Intelligence - Special issue on nonmonotonic reasoning
Unfolding partiality and disjunctions in stable model semantics
ACM Transactions on Computational Logic (TOCL)
Compiling causal theories to successor state axioms and STRIPS-like systems
Journal of Artificial Intelligence Research
A-system: problem solving through abduction
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Hi-index | 0.00 |
In rule-based systems, goal-oriented computations correspond naturally to the possible ways that an observation may be explained. In some applications, we need to compute explanations for a series of observations with the same domain. The question arises as to whether previously computed answers can be recycled. A “yes” answer could result in substantial savings of repeated computations. For systems based on classical logic, the answer is yes. For nonmonotonic systems, however, one tends to believe that the answer should be no, since recycling is a form of adding information. In this article, we show that computed answers can always be recycled, in a nontrivial way, for the class of rewrite procedures proposed earlier by the authors for logic programs with negation. We present some experimental results on an encoding of the logistics domain.