.png){kind=icon}
Return
Loop-separable programs and their first-order definability
.png){kind=icon}
PRE
AI
DOI：10.1016/j.artint.2010.12.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. Characterizing classes of programs that are first-order definable on finite structures is theoretically challenging and of practical relevance to answer set programming. In this paper, we identify a non-trivial class of answer set programs called loop-separable programs and show that they are first-order definable on finite structures. (C) 2010 Elsevier B.V. All rights reserved.
Keywords:
Answer set programming
First-order definability
Knowledge representation
Nonmonotonic reasoning
Journal
IF:
13.9
Papers:
6.1K
Citations:
1.9W
Organization
Cited Papers
ShareSaveShareSaveShareSaveShareSaveCardiac fibrosis in mouse expressing DsRed tetramers involves chronic autophagy and proteasome degradation insufficiency.png)
Oncotarget
OAAI
OncotargetIF0
OAAIShareSaveShareSave
View more