First-order expressibility and boundedness of disjunctive logic programs

  • Authors:

  • Heng Zhang;Yan Zhang

  • Affiliations:

  • Artificial Intelligence Research Group, School of Computing, Engineering and Mathematics, University of Western Sydney, Australia;Artificial Intelligence Research Group, School of Computing, Engineering and Mathematics, University of Western Sydney, Australia

  • Venue:
  • IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

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.