An Abductive Framework for General Logic Programs and Other Nonmonotonic Systems
Abstract
We present an abductive semantics for general propositional logic programs which defines the meaning of a logic program in terms of its extensions. This approach extends the stable model semantics for normal logic programs in a natural way. The new semantics is equivalent to stable semantics for a logic program P whenever P is normal and has a stable model. The abductive semantics can also be applied to generalize default logic and autoepistemic logic in a like manner. Our approach is based on an idea recently proposed by Konolige for causal reasoning. Instead of maximizing the set of hypotheses alone we maximize the union of the hypotheses, along with possible hypotheses that are excused or refuted by the theory. 1
Cite
Text
Brewka and Konolige. "An Abductive Framework for General Logic Programs and Other Nonmonotonic Systems." International Joint Conference on Artificial Intelligence, 1993.Markdown
[Brewka and Konolige. "An Abductive Framework for General Logic Programs and Other Nonmonotonic Systems." International Joint Conference on Artificial Intelligence, 1993.](https://mlanthology.org/ijcai/1993/brewka1993ijcai-abductive/)BibTeX
@inproceedings{brewka1993ijcai-abductive,
title = {{An Abductive Framework for General Logic Programs and Other Nonmonotonic Systems}},
author = {Brewka, Gerhard and Konolige, Kurt},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1993},
pages = {9-17},
url = {https://mlanthology.org/ijcai/1993/brewka1993ijcai-abductive/}
}