Switch to: Citations

References in:

Semantic forgetting in answer set programming

Thomas Eiter & Kewen Wang

Artificial Intelligence 172 (14):1644-1672 (2008)

Add references

You must login to add references.

ASSAT: computing answer sets of a logic program by SAT solvers.Fangzhen Lin & Yuting Zhao - 2004 - Artificial Intelligence 157 (1-2):115-137.details Download Export citation Bookmark 19 citations
On strongest necessary and weakest sufficient conditions☆☆An earlier version of this paper was the co-winner of the Best Paper Award at KR2000.Fangzhen Lin - 2001 - Artificial Intelligence 128 (1-2):143-159.details Download Export citation Bookmark 7 citations
Answer set programming and plan generation.Vladimir Lifschitz - 2002 - Artificial Intelligence 138 (1-2):39-54.details Download Export citation Bookmark 20 citations
Circumscription — A Form of Non-Monotonic Reasoning.John McCarthy - 1980 - Artificial Intelligence 13 (1-2):27–39.details Download Export citation Bookmark 349 citations
Semantic Considerations on nonmonotonic Logic.Robert C. Moore - 1985 - Artificial Intelligence 25 (1):75-94.details Download Export citation Bookmark 175 citations
A logic for default reasoning.Ray Reiter - 1980 - Artificial Intelligence 13 (1-2):81-137.details Download Export citation Bookmark 634 citations
Semantical and computational aspects of Horn approximations.Marco Cadoli & Francesco Scarcello - 2000 - Artificial Intelligence 119 (1-2):1-17.details Download Export citation Bookmark 5 citations
Solving logic program conflict through strong and weak forgettings.Yan Zhang & Norman Y. Foo - 2006 - Artificial Intelligence 170 (8-9):739-778.details Download Export citation Bookmark 7 citations

1