A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP
[chapter]
2008
Lecture Notes in Computer Science
Using a characterization of stable models of logic programs P as satisfying valuations of a suitably chosen propositional theory, called the set of reduced defining equations rΦP , we show that the finitary character of that theory rΦP is equivalent to a certain continuity property of the Gelfond-Lifschitz operator GLP associated with the program P . The introduction of the formula rΦP leads to a double-backtracking algorithm for computation of stable models by reduction to satisfiability of
doi:10.1007/978-3-540-89982-2_25
fatcat:wjpyvtauo5hlflwqwy5cdm45bq