\input zb-basic
\input zb-ioport
\iteman{io-port 05909466}
\itemau{Chen, Yin; Lin, Fangzhen; Zhang, Yan; Zhou, Yi}
\itemti{Loop-separable programs and their first-order definability.}
\itemso{Artif. Intell. 175, No. 3-4, 890-913 (2011).}
\itemab
Summary: 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.
\itemrv{~}
\itemcc{}
\itemut{answer set programming; first-order definability; knowledge representation; nonmonotonic reasoning}
\itemli{doi:10.1016/j.artint.2010.12.001}
\end