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

320

The DLV System for Knowledge Representation and Reasoning
– Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, Francesco Scarcello
 2002

850

The WellFounded Semantics for General Logic Programs
– Kenneth A. Ross
 1991

197

Elements of Finite Model Theory
– Leonid Libkin
 2004

271

Generalized firstorder spectra and polynomialtime recognizable sets
– R Fagin
 1974

27

Inductive Situation Calculus
– Marc Denecker, Eugenia Ternovska
 2004

330

Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm
– Ilkka NiemelĂ¤

503

Finite Model Theory
– HD Ebbinghaus, J Flum
 1995

20

Predicatecalculus based logics for modeling and solving search problems
– Deborah East
 2006

530

The complexity of relational query languages
– M Y Vardi
 1982

250

Stable models and an alternative logic programming paradigm
– Victor W. Marek
 1999

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

1430

A logic for default reasoning
– R Reiter
 1980

44

The Wellfounded 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 kguarded formulas with inductive definitions
– Murray Patterson, Yongmei Liu, Eugenia Ternovska, Arvind Gupta
 2007
