Fundamenta Informaticae · 1996 · 41 citations · 12 references
ComputingComputer ScienceAlgorithmsLogicSemanticsLogic ProgrammingModel TheoryMinimal Models
It is wellknown that Minker's semantics GCWA for positive disjunctive programs P, i.e. to decide if a literal is true in all minimal models of P is ΠP2 -complete. This is in contrast to the same entailment problem for semantics of non-disjunctive pro
12
Circumscription—A form of non-monotonic reasoning
John McCarthy · Artificial Intelligence · 1980 · 2K citations
The well-founded semantics for general logic programs
Allen Van Gelder, Kenneth A. Ross, John S. Schlipf · Journal of the ACM · 1991 · 1.7K citations