Switch to: Citations

References in:

Some (in)translatability results for normal logic programs and propositional theories

Journal of Applied Non-Classical Logics 16 (1-2):35-86 (2006)

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
Results on translating defaults to circumscription.Tomasz Imielinski - 1987 - Artificial Intelligence 32 (1):131-146.details Download Export citation Bookmark 6 citations
Extending and implementing the stable model semantics.Patrik Simons, Ilkka Niemelä & Timo Soininen - 2002 - Artificial Intelligence 138 (1-2):181-234.details Download Export citation Bookmark 37 citations
(1 other version)Logic programming and knowledge representation—The A-Prolog perspective.Michael Gelfond & Nicola Leone - 2002 - Artificial Intelligence 138 (1-2):3-38.details Download Export citation Bookmark 11 citations
(2 other versions)The Stable Model Semantics for Logic Programming.Melvin Fitting - 1992 - Journal of Symbolic Logic 57 (1):274-277.details Download Export citation Bookmark 57 citations
Foundations of Logic Programming.J. W. Lloyd - 1987 - Journal of Symbolic Logic 52 (1):288-289.details Download Export citation Bookmark 77 citations
Evaluating the effect of semi-normality on the expressiveness of defaults.Tomi Janhunen - 2003 - Artificial Intelligence 144 (1-2):233-250.details Download Export citation Bookmark 2 citations

1