On the computational cost of disjunctive logic programming: Propositional case

This publication has 40 references indexed in Scilit:

• On indefinite databases and the closed world assumption
  Published by Springer Nature ,2005
• A survey of complexity results for non-monotonic logics
  The Journal of Logic Programming, 1993
• A possible world semantics for disjunctive databases
  IEEE Transactions on Knowledge and Data Engineering, 1993
• Autoepistemic logic
  Journal of the ACM, 1991
• Three-valued nonmonotonic formalisms and semantics of logic programs
  Artificial Intelligence, 1991
• Hard problems for simple default logics
  Artificial Intelligence, 1991
• Negation by default and unstratifiable logic programs
  Theoretical Computer Science, 1991
• Generalized Closed World Assumption is II02-Complete
  Information Processing Letters, 1990
• Horn clause queries and generalizations
  The Journal of Logic Programming, 1985
• Circumscription—A form of non-monotonic reasoning
  Artificial Intelligence, 1980