Revision of defeasible preferences

DOI10.1016/J.IJAR.2018.10.020zbMATH Open1452.68186OpenAlexW2901062838MaRDI QIDQ1726329FDOQ1726329

Authors: Guido Governatori, F. Oliveri, Matteo Cristani, Simone Scannapieco 

Publication date: 20 February 2019

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10072/385283

Recommendations

• scientific article; zbMATH DE number 1487805
• scientific article; zbMATH DE number 1269578
• Preference logics: Towards a unified approach to nonmonotonicity in deductive reasoning
• Explanations, belief revision and defeasible reasoning.
• Nonmonotonic reasoning, preferential models and cumulative logics

zbMATH Keywords

belief revisionnonmonotonic reasoningknowledge representationsceptical logics

Mathematics Subject Classification ID

Knowledge representation (68T30) Logics of knowledge and belief (including belief change) (03B42) Logic in artificial intelligence (68T27)

Cites Work

• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• On the logic of theory change: Partial meet contraction and revision functions
• Knowledge in flux. Modeling the dynamics of epistemic states
• Argument-based extended logic programming with defeasible priorities
• Argumentation Semantics for Defeasible Logic
• Reasoning about preferences in argumentation frameworks
• Computational models of argument (COMMA 2010). Proceedings of 3rd conference, Desanzano del Garda, Italy, September 2010.
• Representation results for defeasible logic
• Embedding defeasible logic into logic programming
• Changing legal systems: legal abrogations and annulments in Defeasible Logic
• Propositional defeasible logic has linear complexity
• Subjunctives, dispositions and chances
• Title not available (Why is that?)
• Hierarchical Argumentation
• An inclusion theorem for defeasible logics
• Title not available (Why is that?)
• The complexity of constraint satisfaction problems for small relation algebras
• A program-level approach to revising logic programs under the answer set semantics
• A microcomputer based system for small relation algebras
• Defeasible logic with dynamic priorities
• A defeasible logic for modelling policy-based intentions and motivational attitudes
• Reconsidering AGM-style belief revision in the context of logic programs
• Defeasible logic versus Logic Programming without Negation as Failure
• Title not available (Why is that?)
• Dynamics of knowledge in \textsc{DeLP} through argument theory change

Cited In (6)

• Title not available (Why is that?)
• Overriding subsuming rules
• Preferential theory revision
• Overriding subsuming rules
• Inference to the stable explanations
• Incremental computation for structured argumentation over dynamic DeLP knowledge bases

Uses Software

• DELORES
• DR-Prolog

This page was built for publication: Revision of defeasible preferences

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