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

29 A framework for representing and solving np search problems – David G Mitchell, Eugenia Ternovska - 2005
58 Extending Classical Logic with Inductive Definitions – Marc Denecker - 2000
327 Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm – Ilkka Niemelä
322 The DLV System for Knowledge Representation and Reasoning – Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, Francesco Scarcello - 2002
248 Stable models and an alternative logic programming paradigm – Victor W. Marek - 1999
56 Introducing ESRA, a relational language for modelling combinatorial problems – Pierre Flener, Justin Pearson - 2004
27 Inductive Situation Calculus – Marc Denecker, Eugenia Ternovska - 2004
276 Descriptive Complexity – N IMMERMAN - 1999
497 Finite Model Theory – H D Ebbinghaus, J Flum - 1999
20 Predicate-calculus based logics for modeling and solving search problems – Deborah East - 2006
852 Classical Negation in Logic Programs and Disjunctive Databases – Michael Gelfond, Vladimir Lifschitz - 1991
527 The complexity of relational query languages – M Y Vardi - 1982
43 Capturing complexity classes by fragments of second-order logic – E Grädel - 1992
271 Generalized first-order spectra and polynomial-time recognizable sets, in: Complexity of Computation, Proc – R Fagin - 1973
198 Elements of Finite Model Theory – L Libkin - 2004
9 Relational queries computable in polytime – N Immerman - 1982
959 Negation as failure – K L Clark - 1978
1424 A logic for default reasoning – R Reiter - 1980
845 The Well-Founded Semantics for General Logic Programs – Kenneth A. Ross - 1991