A logic of non-monotone inductive definitions (2007)

by Marc Denecker , Eugenia Ternovska
Venue:ACM transactions on computational logic
Citations:28 - 16 self

Documents Related by Co-Citation

58 Extending Classical Logic with Inductive Definitions – Marc Denecker - 2000
274 Descriptive Complexity – Neil Immerman - 1998
29 A framework for representing and solving np search problems – David G Mitchell, Eugenia Ternovska - 2005
850 The Well-Founded Semantics for General Logic Programs – Kenneth A. Ross - 1991
320 The DLV System for Knowledge Representation and Reasoning – Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, Francesco Scarcello - 2002
271 Generalized first-order spectra and polynomial-time recognizable sets – R Fagin - 1974
197 Elements of Finite Model Theory – Leonid Libkin - 2004
27 Inductive Situation Calculus – Marc Denecker, Eugenia Ternovska - 2004
503 Finite Model Theory – H-D Ebbinghaus, J Flum - 1995
250 Stable models and an alternative logic programming paradigm – Victor W. Marek - 1999
853 Classical Negation in Logic Programs and Disjunctive Databases – Michael Gelfond, Vladimir Lifschitz - 1991
330 Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm – Ilkka Niemelä
20 Predicate-calculus based logics for modeling and solving search problems – Deborah East - 2006
530 The complexity of relational query languages – M Y Vardi - 1982
9 Relational queries computable in polytime – N Immerman - 1982
41 Capturing Complexity Classes by Fragments of Second Order Logic, Theoretical Computer Science 101 – E Gradel - 1992
44 The Well-founded Semantics Is the Principle of Inductive Definition – Marc Denecker - 1998
36 Compiling Problem Specifications into SAT – Marco Cadoli, Andrea Schaerf - 2001
7 Grounding for model expansion in k-guarded formulas with inductive definitions – Murray Patterson, Yongmei Liu, Eugenia Ternovska, Arvind Gupta - 2007