Decidable fragments of first-order language under stable model semantics and circumscription

Publication Type:
Conference Proceeding
Citation:
Proceedings of the National Conference on Artificial Intelligence, 2010, 1 pp. 375 - 380
Issue Date:
2010-11-01
Metrics:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2010003123OK.pdf823.84 kB
Adobe PDF
The stable model semantics was recently generalized by Ferraris, Lee and Lifschitz to the full first-order language with a syntax translation approach that is very similar to McCarthy's circumscription. In this paper, we investigate the decidability and undecidability of various fragments of first-order language under both semantics of stable models and circumscription. Some maximally decidable classes and undecidable classes are identified. The results obtained in the paper show that the boundaries between decidability and undecidability for these two semantics are very different in spite of the similarity of definition. Moreover, for all fragments considered in the paper, decidability under the semantics of circumscription coincides with that in classical first-order logic. This seems rather counterintuitive due to the second-order definition of circumscription and the high undecidability of first-order circumscription. Copyright © 2010, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
Please use this identifier to cite or link to this item: