First-Order Expressibility and Boundedness of Disjunctive Logic Programs
Abstract
In this paper, the fixed point semantics developed in [Lobo et al., 1992] is generalized to disjunctive logic programs with default negation and over arbitrary structures, and proved to coincide with the stable model semantics. By using the tool of ultraproducts, a preservation theorem, which asserts that a disjunctive logic program without default negation is bounded with respect to the proposed semantics if and only if it has a first-order equivalent, is then obtained. For the disjunctive logic programs with default negation, a sufficient condition assuring the first-order expressibility is also proposed.
Cite
Text
Zhang and Zhang. "First-Order Expressibility and Boundedness of Disjunctive Logic Programs." International Joint Conference on Artificial Intelligence, 2013.Markdown
[Zhang and Zhang. "First-Order Expressibility and Boundedness of Disjunctive Logic Programs." International Joint Conference on Artificial Intelligence, 2013.](https://mlanthology.org/ijcai/2013/zhang2013ijcai-first/)BibTeX
@inproceedings{zhang2013ijcai-first,
title = {{First-Order Expressibility and Boundedness of Disjunctive Logic Programs}},
author = {Zhang, Heng and Zhang, Yan},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2013},
pages = {1198-1204},
url = {https://mlanthology.org/ijcai/2013/zhang2013ijcai-first/}
}