Abductive Logic Programming by Nonground Rewrite Systems
Abstract
Logic programming with negation offers a compelling ap-proach to abductive reasoning. This paper shows a simple view of abduction in this context for the completion seman-tics, under which the problem of abduction becomes one of solving quantified equations and disequations. By this way of treating abduction, the problems with nonground negative queries in the previous approaches no longer exist. We show the soundness and completeness results for our approach.
Cite
Text
Lin and You. "Abductive Logic Programming by Nonground Rewrite Systems." AAAI Conference on Artificial Intelligence, 2008.Markdown
[Lin and You. "Abductive Logic Programming by Nonground Rewrite Systems." AAAI Conference on Artificial Intelligence, 2008.](https://mlanthology.org/aaai/2008/lin2008aaai-abductive/)BibTeX
@inproceedings{lin2008aaai-abductive,
title = {{Abductive Logic Programming by Nonground Rewrite Systems}},
author = {Lin, Fangzhen and You, Jia-Huai},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2008},
pages = {480-485},
url = {https://mlanthology.org/aaai/2008/lin2008aaai-abductive/}
}