First-Order Indefinability of Answer Set Programs on Finite Structures

An answer set program with variables is first-order definable on finite structures if the set of its finite answer sets can be captured by a first-order sentence, otherwise this program is first-order indefinable on finite structures. In this paper, we study the problem of first-order indefinability of answer set programs. We provide an Ehrenfeucht-Fra

• Type: Conference
• Year: 2010
• Where: AAAI
• Authors: Yin Chen, Yan Zhang, Yi Zhou
• Keywords: AAAI 2010, Answer Set, Answer Set Programs, First-order Indefinability, Intelligent Agents