A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Answer sets and nonmonotonic S4
[chapter]
1994
Lecture Notes in Computer Science
The semantics of answer sets ([10]) provides a flexible tool for interpreting various forms of extended logic programs and deductive databases. In particular, it is applicable to extended disjunctive databases whose rules may contain two kinds of negation as well as disjunctive conclusions. Extending our earlier work, [19, 20] , we provide here a complete logical characterisation of answer set inference as a subsystem of nonmonotonic $4. The method consists in interpreting the rules of
doi:10.1007/3-540-58025-5_60
fatcat:cdguvxxwrfarrprfk7d5ymlmqa