4 search results - page 1 / 1 » First-Order Indefinability of Answer Set Programs on Finite ... |
AAAI
2010
14 years 6 months ago
2010
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 p...
AAAI
2010
14 years 7 months ago
2010
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 introd...
121
click to vote
ICLP
2009
Springer
15 years 6 months ago
2009
Springer
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...
WCRE
2006
IEEE
14 years 12 months ago
2006
IEEE
We describe the design and implementation of FFE/x86 (File-Format Extractor for x86), an analysis tool that works on stripped executables (i.e., neither source code nor debugging ...