| Alternate document: Details Logic Programs: default logic theories or inductive definitions? (01) Marc Denecker |
(Enter summary)
Abstract: This paper investigates the problem and proposes an alternative epistemological
foundation for the canonical model approach, which is not based on common sense but
on a solid mathematical information principle. The thesis is developed that logic programming
can be understood as a natural and general logic of inductive denitions. In particular, logic programs
with negation represent non-monotone inductive denitions. It is argued that this thesis
results in an alternative justication of the... (Update)
Cited by: More
Epistemic Foundation of Stable Model Semantics - Loyer, Straccia (2006)
(Correct)
Minimum Model Semantics for Logic Programs with.. - Rondogiannis, Wadge
(Correct)
Towards a Unified Theory of Logic Programming Semantics.. - Hitzler, Knorr (2005)
(Correct)
Active bibliography (related documents): More All
0.5: Efficient Top-Down Computation of Queries under the.. - Chen, Swift, Warren (1994)
(Correct)
0.5: Relevance Sensitive Belief Structures - Chopra, Parikh (2000)
(Correct)
0.0: A Survey of Paraconsistent Semantics for Logic Programs - Damásio, Pereira (1998)
(Correct)
Similar documents based on text: More All
0.3: On the Transformation of Object-Oriented.. - Bekaert, Van..
(Correct)
0.2: A Logic of Non-Monotone Inductive Definitions and its.. - Denecker, Ternovska (2004)
(Correct)
0.1: Approximations, Stable Operators, Well-Founded.. - Denecker, Marek.. (2000)
(Correct)
Related documents from co-citation: More All
12: The Well-Founded Semantics for General Logic Programs
- Van Gelder, Ross et al. - 1991
9: The Stable Model Semantics for Logic Programming
- Gelfond - 1988
8: Fixpoint semantics for logic programming -- a survey
- Fitting - 1999
BibTeX entry: (Update)
M. Denecker, M. Bruynooghe, and V. W. Marek. Logic programming revisited: logic programs as inductive denitions. ACM Transactions on Computational Logic, 2001. accepted. http://citeseer.ist.psu.edu/denecker01logic.html More
@article{ denecker01logic,
author = "Marc Denecker and Maurice Bruynooghe and V. Wiktor Marek",
title = "Logic programming revisited: Logic programs as inductive definitions",
journal = "Computational Logic",
volume = "2",
number = "4",
pages = "623-654",
year = "2001",
url = "citeseer.ist.psu.edu/denecker01logic.html" }
Citations (may not include all citations):
858
The stable model semantics for logic programming
- Gelfond, Lifschitz - 1988
180
Logic programming and negation: a survey
- Apt, Bol - 1994
120
Bilattices and the semantics of logic programming
- Fitting - 1991
2
and Warren (context) - Chen
2
A theory of truth that prefers falsehood
- Fitting - 1997
1
and Emden (context) - Apt
1
and Shelah (context) - Gurevich
1
and De Schreye (context) - Denecker
1
and Truszczy nski (context) - Marek
1
OLD resolution with tabulation (context) - Foundation, in et al. - 1959
1
al Logic, Vol. TBD, No. TBD, TBD TBD. Logic Programs as Indu.. (context) - ACM, Computation
1
The family of stable models (context) - Denecker - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.kuleuven.ac.be/~marcd/papers/publications.html):
Abduction in Logic Programming - Kakas, Denecker (2001)
(Correct)
What is in a model? Epistemological ambiguity of Logic Programming - Denecker
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC