An Abductive Framework for General Logic Programs and other Nonmonotonic Systems
Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 9-16.
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.
@inproceedings{ijcai1993p2,
title = {An Abductive Framework for General Logic Programs and other Nonmonotonic Systems},
author = {Brewka, Gerhard and Konolige, Kurt},
booktitle = {Proceedings of the Thirteenth International Joint Conference on
Artificial Intelligence, {IJCAI-93}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ruzena Bajcsy},
pages = {9--16},
year = {1993},
note = {Automated Reasoning},
url = {https://ijcai.org/proceedings/1993/2},
}
TY - CPAPER TI - An Abductive Framework for General Logic Programs and other Nonmonotonic Systems AU - Brewka, Gerhard AU - Konolige, Kurt T2 - Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, IJCAI-93 PB - International Joint Conferences on Artificial Intelligence PY - 1993 SP - 9 EP - 16 UR - https://ijcai.org/proceedings/1993/2 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
