First-order expressibility and boundedness of disjunctive logic programs

Heng Zhang; Yan Zhang

First-order expressibility and boundedness of disjunctive logic programs

Research output: Chapter in Book / Conference Paper › Conference Paper › peer-review

4 Citations (Scopus)

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 → …

Cite this

@inproceedings{e0f9b9e3c750465282609e97aafeff58,

title = "First-order expressibility and boundedness of disjunctive logic programs",

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.",

author = "Heng Zhang and Yan Zhang",

year = "2013",

language = "English",

isbn = "9781577356332",

pages = "1198--1204",

booktitle = "Proceedings of the Twenty-third International Conference on Artificial Intelligence, 3-9 August 2013, Beijing, China",

publisher = "AAAI Press",

note = "International Joint Conference on Arti{\"i}¬�cial Intelligence ; Conference date: 03-08-2013",

}

TY - GEN

T1 - First-order expressibility and boundedness of disjunctive logic programs

AU - Zhang, Heng

AU - Zhang, Yan

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

UR - http://handle.uws.edu.au:8081/1959.7/535956

UR - http://ijcai13.org/

M3 - Conference Paper

SN - 9781577356332

SP - 1198

EP - 1204

BT - Proceedings of the Twenty-third International Conference on Artificial Intelligence, 3-9 August 2013, Beijing, China

PB - AAAI Press

T2 - International Joint Conference on Artiï¬�cial Intelligence

Y2 - 3 August 2013

ER -

First-order expressibility and boundedness of disjunctive logic programs

Abstract

Conference

Other files and links

Fingerprint

Cite this