Logic programming revisited: logic programs as inductive definitions (2001)

by Marc Denecker , Maurice Bruynooghe , Victor Marek
Venue:ACM Transactions on Computational Logic
Citations:35 - 21 self

Documents Related by Co-Citation

850 The Well-Founded Semantics for General Logic Programs – Kenneth A. Ross - 1991
44 The Well-founded Semantics Is the Principle of Inductive Definition – Marc Denecker - 1998
58 Extending Classical Logic with Inductive Definitions – Marc Denecker - 2000
1430 A logic for default reasoning – R Reiter - 1980
1499 The Stable Model Semantics For Logic Programming – Michael Gelfond, Vladimir Lifschitz - 1988
27 Inductive Situation Calculus – Marc Denecker, Eugenia Ternovska - 2004
106 Fixpoint semantics for logic programming -- a survey – Melvin Fitting - 2000
208 The Alternating Fixpoint of Logic Programs with Negation – Allen Van Gelder - 1995
853 Classical Negation in Logic Programs and Disjunctive Databases – Michael Gelfond, Vladimir Lifschitz - 1991
966 Negation as failure – K Clark - 1978
41 Uniform Semantic Treatment of Default and Autoepistemic Logics – Marc Denecker, Victor W. Marek, Miroslaw Truszczynski - 2000
708 The Semantics of Predicate Logic as a Programming Language – M. H. Van Emden, R. A. Kowalski - 1976
380 Bilattices and the Semantics of Logic Programming – Melvin Fitting - 1989
250 Stable models and an alternative logic programming paradigm – Victor W. Marek - 1999
439 Semantical Considerations on Nonmonotonic Logics – R Moore - 1985
23 Approximating operators, stable operators, well-founded fixpoints and applications in non-monotonic reasoning – M Denecker, V Marek, M TruszczyƄski - 2000
29 A framework for representing and solving np search problems – David G Mitchell, Eugenia Ternovska - 2005
615 Towards a theory of declarative knowledge – Krzysztof Apt, Howard Blair, Adrian Walker - 1988
1858 Foundation of Logic Programming – J W Lloyd - 1987