Loops: Relevant or Redundant?
Authors:
- 1 January 2005
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 53-65
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Why are there so many loop formulas?ACM Transactions on Computational Logic, 2006
- ASSAT: computing answer sets of a logic program by SAT solversArtificial Intelligence, 2004
- Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs2003
- Loop Formulas for Disjunctive Logic ProgramsLecture Notes in Computer Science, 2003
- Extending and implementing the stable model semanticsArtificial Intelligence, 2002
- Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations2001
- Default theories that always have extensionsArtificial Intelligence, 1994
- The well-founded semantics for general logic programsJournal of the ACM, 1991
- On the Declarative Semantics of Deductive Databases and Logic Programs1988
- Negation as Failure1978