Recycling Computed Answers in Rewrite Systems for Abduction
Title: Recycling Computed Answers in Rewrite Systems for Abduction
Abstract: This research investigates the possibility of recycling previously computed answers in non-monotonic systems, specifically focusing on rewrite procedures for abduction in logic programming under partial stable model semantics. The main result is a theorem that shows that recycling preserves the soundness and completeness of the procedure. This work contributes to the field by providing a non-trivial solution to the problem of recycling in non-monotonic proof systems and demonstrating its application in logic programming.
Main Research Question: Can previously computed answers be recycled in non-monotonic systems, specifically in rewrite procedures for abduction in logic programming under partial stable model semantics?
Methodology: The study uses a rewrite procedure based on the idea of abduction as a confluent and terminating rewriting process. This method is applied to compute explanations using a non-ground program, with the condition that a variable appearing in the body must also appear in the head. If this condition is not met, the variables are instantiated only on domain predicates.
Results: The main result is a theorem (Theorem 4.7) that shows that recycling preserves the soundness and completeness of the rewrite procedure. This means that previous proofs can be used without compromising the accuracy and comprehensiveness of the system.
Implications: This work has significant implications for the field of logic programming and non-monotonic systems. It provides a non-trivial solution to the problem of recycling in non-monotonic proof systems and demonstrates the application of this method in computing explanations for a series of observations with the same domain. This could lead to substantial savings in repeated computations and contribute to the development of more efficient and effective systems in the field.
Link to Article: https://arxiv.org/abs/0402033v1 Authors: arXiv ID: 0402033v1