Compiling Circumscriptive Theories into Logic Programs
Abstract
We study the possibility of reducing some special cases of circumscription to logic programming. The description of a given circumscriptive theory T can be sometimes transformed into a logic program II, so that, by running II, we can determine whether a given ground literal is provable in T. The method is applicable, in particular, to some formalizations of tree-structured inheritance systems with exceptions.
Cite
Text
Gelfond and Lifschitz. "Compiling Circumscriptive Theories into Logic Programs." AAAI Conference on Artificial Intelligence, 1988.Markdown
[Gelfond and Lifschitz. "Compiling Circumscriptive Theories into Logic Programs." AAAI Conference on Artificial Intelligence, 1988.](https://mlanthology.org/aaai/1988/gelfond1988aaai-compiling/)BibTeX
@inproceedings{gelfond1988aaai-compiling,
title = {{Compiling Circumscriptive Theories into Logic Programs}},
author = {Gelfond, Michael and Lifschitz, Vladimir},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1988},
pages = {455-449},
url = {https://mlanthology.org/aaai/1988/gelfond1988aaai-compiling/}
}