Bottom-up computation of perfect models for disjunctive theories
From MaRDI portal
Publication:3128528
DOI10.1016/0743-1066(94)00106-GzbMath0871.68045MaRDI QIDQ3128528
Jack Minker, José Alberto Fernández
Publication date: 16 April 1997
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Related Items
Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation ⋮ Complexity results for answer set programming with bounded predicate arities and implications ⋮ Computing only minimal answers in disjunctive deductive databases ⋮ Enhancing disjunctive logic programming systems by SAT checkers