Relating defeasible and normal logic programming through transformation properties.

DOI10.1016/S0304-3975(02)00033-6MaRDI QIDQ1853599zbMATH OpenOpenAlexFDO

Authors Carlos Iván Chesñevar, J. Dix, Frieder Stolzenburg, 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

Knowledge representationLogic programmingNon-monotonic reasoningDefeasible argumentation

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Interdefinability of defeasible logic and logic programming under the well-founded semantics
• scientific article; zbMATH DE number 2087247
• scientific article; zbMATH DE number 2090541
• Embedding defeasible logic into logic programming
• scientific article; zbMATH DE number 1884386

Cites work

• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 1852916 (Why is no real title available?)
• A framework to incorporate non-monotonic reasoning into constraint logic programming
• A general theory of confluent rewriting systems for logic programming and its applications
• A logic for default reasoning
• A logic programming system for nonmonotonic reasoning
• A mathematical treatment of defeasible reasoning and its implementation.
• Argument-based extended logic programming with defeasible priorities
• Characterizations of the disjunctive stable semantics by partial evaluation
• Characterizations of the disjunctive well-founded semantics: Confluent calculi and iterated GCWA
• Computing argumentation in logic programming
• Defeasible Dialectics: A Controversy-Oriented Approach towards Defeasible Argumentation
• Nonmonotonic reasoning: Towards efficient calculi and implementations
• The well-founded semantics for general logic programs
• Transformation-based bottom-up computation of the well-founded model

Cited in

(7)

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

This page was built for publication: Relating defeasible and normal logic programming through transformation properties.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853599)