Ordered Completion for First-Order Logic Programs on Finite Structures

Vernon Asuncion; Fangzhen Lin; Yan Zhang; Yi Zhou

Ordered Completion for First-Order Logic Programs on Finite Structures

Vernon Asuncion, Fangzhen Lin, Yan Zhang, Yi Zhou

Department of Computer Science and Engineering

Research output: Chapter in Book/Conference Proceeding/Report › Conference Paper published in a book › peer-review

2 Citations (Scopus)

Abstract

In this paper, we propose a translation from normal first-order logic programs under the answer set semantics to first-order theories on finite structures. Specifically, we introduce ordered completions which are modifications of Clark's completions with some extra predicates added to keep track of the derivation order, and show that on finite structures, classical models of the ordered-completion of a normal logic program correspond exactly to the answer sets (stable models) of the logic program.

Original language	English
Title of host publication	Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010
Publisher	AAAI Press
Pages	249-254
Number of pages	6
ISBN (Electronic)	9781577354642
Publication status	Published - 15 Jul 2010
Event	24th AAAI Conference on Artificial Intelligence, AAAI 2010 - Atlanta, United States Duration: 11 Jul 2010 → 15 Jul 2010

Publication series

Name	Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010

Conference

Conference	24th AAAI Conference on Artificial Intelligence, AAAI 2010
Country/Territory	United States
City	Atlanta
Period	11/07/10 → 15/07/10

Bibliographical note

Publisher Copyright:
© 2010, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

Cite this

@inproceedings{ff2b7fac2cd34b45b7d09f75dbab4bac,

title = "Ordered Completion for First-Order Logic Programs on Finite Structures",

abstract = "In this paper, we propose a translation from normal first-order logic programs under the answer set semantics to first-order theories on finite structures. Specifically, we introduce ordered completions which are modifications of Clark's completions with some extra predicates added to keep track of the derivation order, and show that on finite structures, classical models of the ordered-completion of a normal logic program correspond exactly to the answer sets (stable models) of the logic program.",

author = "Vernon Asuncion and Fangzhen Lin and Yan Zhang and Yi Zhou",

note = "Publisher Copyright: {\textcopyright} 2010, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 24th AAAI Conference on Artificial Intelligence, AAAI 2010 ; Conference date: 11-07-2010 Through 15-07-2010",

year = "2010",

month = jul,

day = "15",

language = "English",

series = "Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010",

publisher = "AAAI Press",

pages = "249--254",

booktitle = "Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010",

}

Asuncion, V, Lin, F, Zhang, Y & Zhou, Y 2010, Ordered Completion for First-Order Logic Programs on Finite Structures. in Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010. Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010, AAAI Press, pp. 249-254, 24th AAAI Conference on Artificial Intelligence, AAAI 2010, Atlanta, United States, 11/07/10.

Ordered Completion for First-Order Logic Programs on Finite Structures. / Asuncion, Vernon; Lin, Fangzhen; Zhang, Yan et al.
Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010. AAAI Press, 2010. p. 249-254 (Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010).

Research output: Chapter in Book/Conference Proceeding/Report › Conference Paper published in a book › peer-review

TY - GEN

T1 - Ordered Completion for First-Order Logic Programs on Finite Structures

AU - Asuncion, Vernon

AU - Lin, Fangzhen

AU - Zhang, Yan

AU - Zhou, Yi

PY - 2010/7/15

Y1 - 2010/7/15

N2 - In this paper, we propose a translation from normal first-order logic programs under the answer set semantics to first-order theories on finite structures. Specifically, we introduce ordered completions which are modifications of Clark's completions with some extra predicates added to keep track of the derivation order, and show that on finite structures, classical models of the ordered-completion of a normal logic program correspond exactly to the answer sets (stable models) of the logic program.

AB - In this paper, we propose a translation from normal first-order logic programs under the answer set semantics to first-order theories on finite structures. Specifically, we introduce ordered completions which are modifications of Clark's completions with some extra predicates added to keep track of the derivation order, and show that on finite structures, classical models of the ordered-completion of a normal logic program correspond exactly to the answer sets (stable models) of the logic program.

UR - https://www.scopus.com/pages/publications/85167400052

M3 - Conference Paper published in a book

AN - SCOPUS:85167400052

T3 - Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010

SP - 249

EP - 254

BT - Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010

PB - AAAI Press

T2 - 24th AAAI Conference on Artificial Intelligence, AAAI 2010

Y2 - 11 July 2010 through 15 July 2010

ER -

Ordered Completion for First-Order Logic Programs on Finite Structures

Abstract

Publication series

Conference

Bibliographical note

Other files and links

Fingerprint

Cite this