Relating defeasible and normal logic programming through transformation properties.
From MaRDI portal
Publication:1853599
DOI10.1016/S0304-3975(02)00033-6zbMath1051.68043MaRDI QIDQ1853599
Jürgen Dix, Frieder Stolzenburg, Carlos Iván Chesñevar, G. R. Guillermo Ricardo Simari
Publication date: 21 January 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
68N17: Logic programming
Related Items
A logic programming framework for possibilistic argumentation: Formalization and logical properties, The foundations of DeLP: Defeating relations, games and truth values, DEFEASIBLE REASONING IN WEB-BASED FORMS THROUGH ARGUMENTATION, 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