Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

AAAI
2010

favoriteEmaildiscussreport

173views Intelligent Agents» more AAAI 2010»

First-Order Indefinability of Answer Set Programs on Finite Structures

13 years 4 months ago

First-Order Indefinability of Answer Set Programs on Finite Structures

Download www.scm.uws.edu.au

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

Yin Chen, Yan Zhang, Yi Zhou

Real-time Traffic

AAAI 2010 | Answer Set | Answer Set Programs | First-order Indefinability | Intelligent Agents |

claim paper

Related Content

» Ordered Completion for FirstOrder Logic Programs on Finite Structures

» Answer Set Programming with Constraints Using Lazy Grounding

» Extracting Output Formats from Executables

Post Info
More Details (n/a)

Added	06 Dec 2010
Updated	06 Dec 2010
Type	Conference
Year	2010
Where	AAAI
Authors	Yin Chen, Yan Zhang, Yi Zhou

Comments (0)