First-Order Expressibility and Boundedness of Disjunctive Logic Programs
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 1198-1203.
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.
@inproceedings{ijcai2013p180,
title = {First-Order Expressibility and Boundedness of Disjunctive Logic Programs},
author = {Zhang, Heng and Zhang, Yan},
booktitle = {Proceedings of the Twenty-Third International Joint Conference on
Artificial Intelligence, {IJCAI-13}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Francesca Rossi},
pages = {1198--1203},
year = {2013},
month = {8},
url = {https://ijcai.org/proceedings/2013/180},
}
TY - CPAPER TI - First-Order Expressibility and Boundedness of Disjunctive Logic Programs AU - Zhang, Heng AU - Zhang, Yan T2 - Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2013 SP - 1198 EP - 1203 UR - https://ijcai.org/proceedings/2013/180 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
