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

Defeasible argumentationKnowledge representationLogic programmingNon-monotonic reasoning

Mathematics Subject Classification ID

Logic programming (68N17)

Review text

This paper relates the Defeasible Logic Programming (DeLP) framework and its semantics SEM\(_{\text{DeLP}}\) to classical logic programming frameworks. In DeLP, we distinguish between two different sorts of rules: strict and defeasible rules. Negative literals (\(\sim A)\) in these rules are considered to represent classical negation. In contrast to this, in Normal Logic Programming (NLP), there is only one kind of rules, but the meaning of negative literals (not \(A)\) is different: they represent a kind of negation as failure, and thereby introduce defeasibility. Various semantics have been defined for NLP, notably the well-founded semantics (WFS) and the stable semantics Stable. In this paper we consider the transformation properties for NLP introduced by \textit{S. Brass} and \textit{J. Dix} [J. Log. Program. 40, 1--46 (1999; Zbl 0946.68088)] and suitably adjusted for the DeLP framework. We show which transformation properties are satisfied, thereby identifying aspects in which NLP and DeLP differ. We contend that the transformation rules presented in this paper can help to gain a better understanding of the relationship of DeLP semantics with respect to more traditional logic programming approaches. As a byproduct, we obtain the result that DeLP is a proper extension of NLP.

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

• 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
• 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?)
• 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)

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

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)