{"type":"ScholarlyArticle","title":"First-Order Expressibility and Boundedness of Disjunctive Logic Programs","authors":[{"name":"Heng Zhang","slug":"heng-zhang","given":"Heng","family":"Zhang","affiliation":""},{"name":"Yan Zhang","slug":"yan-zhang","given":"Yan","family":"Zhang","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2013/180","pdf":"https://ijcai.org/proceedings/2013/0180.pdf","markdown":"https://ijcai.org/proceedings/2013/180.md","bibtex":"https://ijcai.org/proceedings/2013/bibtex/180","volume":{"slug":"2013","title":"Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2013","url":"https://ijcai.org/proceedings/2013/","year":2013,"location":"Beijing, China","dates":"3–9 August 2013","editors":"Francesca Rossi","isbn":"978-1-57735-633-2","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":180,"pages":{"first":1198,"last":1203},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}