(Enter summary)
Abstract: The goal of this paper is to extend classical logic with a generalized notion of inductive definition supporting positive and negative induction, to investigate the properties of this logic, its relationships to other logics in the area of non-monotonic reasoning, logic programming and deductive databases, and to show its application for knowledge representation by giving a typology of definitional knowledge. (Update)
Context of citations to this paper: More
...at http: www.cs.kuleuven.ac.be dtai kt. A high level description of the integration problem under consideration is given in ID logic [15], which is a framework for declarative knowledge representation that extends classical logic with inductive de nitions. This logic...
.... [12] for logic programs with preferences for stable model semantics [6] This paper presents an embedding of preference rules in ID Logic [3, 4]. It distinguishes itself from other logic formalisms like Answer Set Programming because it stresses the importance of (inductive) de...
Cited by: More
Splitting an Operator: Algebraic modularity results for .. - Vennekens, Gilis.. (2005)
(Correct)
A Logic of Non-Monotone Inductive Definitions and its.. - Denecker, Ternovska (2004)
(Correct)
Compositionality Results for Stratified Nonmonotone Operators - Gilis, Denecker (2002)
(Correct)
Similar documents (at the sentence level):
32.5%: Extending Classical Logic with Inductive Definitions - Denecker (2000)
(Correct)
Active bibliography (related documents): More All
0.3: Truth in Applicative Theories - Kahle (2001)
(Correct)
0.3: Semantic Interpretation of Temporal Information By .. - Verdoolaege..
(Correct)
0.2: Problem solving in ID-logic with aggregates: some experiments - Van Nuffelen, Denecker (2000)
(Correct)
Similar documents based on text: More All
0.3: Reasoning with preferences in ID-Logic - Van Nuffelen
(Correct)
0.2: Approximations, Stable Operators, Well-Founded.. - Denecker, Marek.. (2000)
(Correct)
0.2: SLDNFA-system - Van Nuffelen
(Correct)
Related documents from co-citation: More All
5: The Well-Founded Semantics for General Logic Programs
- Van Gelder, Ross et al. - 1991
3: System: Problem solving through abduction
- Kakas, Van Nu et al. - 2001
3: Bilattices and the semantics of logic programming
- Fitting - 1991
BibTeX entry: (Update)
M.Denecker. Extending classical logic with inductive de nitions. Proc. CL'2000 , J. Lloyd et al., editors, LNAI 1861, Springer, 703-717, 2000. http://citeseer.ist.psu.edu/denecker00extending.html More
@article{ denecker00extending,
author = "Marc Denecker",
title = "Extending Classical Logic with Inductive Definitions",
journal = "Lecture Notes in Computer Science",
volume = "1861",
pages = "703+",
year = "2000",
url = "citeseer.ist.psu.edu/denecker00extending.html" }
Citations (may not include all citations):
858
The stable model semantics for logic programming
- Gelfond, Lifschitz - 1988 DBLP
759
Negation as failure (context) - Clark - 1978 ACM DBLP
451
Circumscription - a form of nonmonotonic reasoning (context) - McCarthy - 1980
388
The Frame Problem in the Situation Calculus: A simple Soluti.. (context) - Reiter - 1991
374
Classical negation in logic programs and disjunctive databas..
- Gelfond, Lifschitz - 1991 DBLP
234
The Well-Founded Semantics for General Logic Programs
- Van Gelder, Ross et al. - 1991 ACM DBLP
212
Abductive Logic Programming
- Kakas, Kowalski et al. - 1993 DBLP
174
A Kripke-Kleene Semantics for Logic Programs (context) - Fitting - 1985 DBLP
162
The semantics of Predicate Logic as a Programming Language (context) - van Emden, Kowalski - 1976 ACM DBLP
125
Well founded semantics coincides with three valued Stable Mo..
- Przymusinski - 1990
120
Elementary Induction on Abstract Structures (context) - Moschovakis - 1974
98
Extended Stable Semantics for Normal and Disjunctive Program.. (context) - Przymusinski - 1990 ACM DBLP
89
Nonmonotonic Logic Context-Dependent Reasoning (context) - Marek, Truszczy - 1993
78
Acyclic programs (context) - Apt, Bezem - 1990 ACM DBLP
58
The Alternating Fixpoint of Logic Programs with Negation (context) - Van Gelder - 1993 ACM DBLP
26
A Terminological Interpretation (context) - Denecker - 1995
24
Elaboration tolerance
- McCarthy - 1998
18
The well-founded semantics is the principle of inductive den..
- Denecker - 1998
18
An Introduction to Inductive Denitions (context) - Aczel - 1977
17
Competence in Knowledge Representation (context) - Brachman, Levesque - 1982 DBLP
13
Compositionality of normal open logic programs
- Verbaeten, Denecker et al. - 2000 ACM DBLP
9
Lattice-theoretic xpoint theorem and its applications (context) - Tarski - 1955
7
Equality and domain closure in rst-order databases (context) - Reiter - 1980
6
Experiments for integration CLP and abduction
- Denecker, Van Nu - 1999
4
An inductive denition approach to ramications (context) - Denecker, Dupr et al. - 1998
3
Iterated Inductive Denitions and Subsystems of Analysis: Rec.. (context) - Buchholz, Feferman et al. - 1981
3
Nonmonotonic Reasoning: Compiled vs Interpreted Theories (context) - Reiter - 1996
3
Knowledge Representation: an AI Perspecitive (context) - Reichgelt - 1991
2
Formal theories for transnite iterations of generalised indu.. (context) - Feferman - 1970
2
the semantics of Stratied Databases (context) - Przymusinski - 1988
2
Abstract of this paper appeared also in Third Symposium on L.. (context) - Amati, Aiello et al. - 1997
2
Inductive Denability and the Situation Calculus (context) - Ternovskaia - 1998
Documents on the same site (http://www.cs.kuleuven.ac.be/~dtai/publications/2000-E.shtml): More
An Algorithmic Approach to Recover Inconsistent Knowledge-bases - Arieli (1919)
(Correct)
Reasoning with Modularly Pointwise Preferential Relations - Arieli
(Correct)
Algorithms for Rewriting Aggregate Queries Using Views - Cohen, Nutt, Serebrenik (2000)
(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