Relating defeasible and normal logic programming through transformation properties.

DOI10.1016/S0304-3975(02)00033-6zbMath1051.68043OpenAlexW2170232725MaRDI QIDQ1853599

Carlos Iván Chesñevar, Frieder Stolzenburg, Jürgen Dix, G. R. Guillermo Ricardo Simari

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00033-6

zbMATH Keywords

Logic programmingKnowledge representationNon-monotonic reasoningDefeasible argumentation

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items

A logic programming framework for possibilistic argumentation: Formalization and logical properties ⋮ DEFEASIBLE REASONING IN WEB-BASED FORMS THROUGH ARGUMENTATION ⋮ t-DeLP: an argumentation-based temporal defeasible logic programming framework ⋮ A series of revisions of David Poole's specificity ⋮ The foundations of DeLP: Defeating relations, games and truth values ⋮ Computing Generalized Specificity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A mathematical treatment of defeasible reasoning and its implementation.
• A logic for default reasoning
• Characterizations of the disjunctive well-founded semantics: Confluent calculi and iterated GCWA
• A logic programming system for nonmonotonic reasoning
• Argument-based extended logic programming with defeasible priorities
• A framework to incorporate non-monotonic reasoning into constraint logic programming
• Defeasible Dialectics: A Controversy-Oriented Approach towards Defeasible Argumentation
• The well-founded semantics for general logic programs
• Characterizations of the disjunctive stable semantics by partial evaluation
• Transformation-based bottom-up computation of the well-founded model
• Computing argumentation in logic programming
• A general theory of confluent rewriting systems for logic programming and its applications