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 ultra-products, 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.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the Twenty-third International Conference on Artificial Intelligence, 3-9 August 2013, Beijing, China |
| Publisher | AAAI Press |
| Pages | 1198-1204 |
| Number of pages | 7 |
| ISBN (Print) | 9781577356332 |
| Publication status | Published - 2013 |
| Event | International Joint Conference on Artiï¬�cial Intelligence - Duration: 3 Aug 2013 → … |
Conference
| Conference | International Joint Conference on Arti�cial Intelligence |
|---|---|
| Period | 3/08/13 → … |