Defeasible logic versus Logic Programming without Negation as Failure

DOI10.1016/S0743-1066(99)00060-6MaRDI QIDQ4934232zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Grigoris Antoniou, Michael J. Maher, David Billington

Publication date 6 May 2001

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0743-1066(99)00060-6

zbMATH Keywords

defeasible logic

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• Embedding defeasible logic into logic programming
• Defeasible logic programming: an argumentative approach
• Negation by default and unstratifiable logic programs
• scientific article; zbMATH DE number 1269578
• scientific article; zbMATH DE number 2090541
• Negation as failure for disjunctive logic programming
• scientific article; zbMATH DE number 4199654
• Negation as failure using tight derivations for general logic programs
• Logic programming with default, weak and strict negations
• Publication:5750390

Cited in

(5)

• Revision of defeasible preferences
• t-DeLP: an argumentation-based temporal defeasible logic programming framework
• DEFEASIBLE REASONING IN WEB-BASED FORMS THROUGH ARGUMENTATION
• Computing generalized specificity
• Annotated defeasible logic

This page was built for publication: Defeasible logic versus Logic Programming without Negation as Failure

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