Relating defeasible and default logic

DOI10.1007/3-540-45656-2_2MaRDI QIDQ4475122zbMATH OpenFDO

Authors Grigoris Antoniou, David Billington

Publication date 9 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2256/22560013.htm

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• Embedding defeasible logic into logic programs
• Embedding defeasible logic into logic programming
• Relating defeasible logic to extended logic programs
• On the relationship between defeasible logic and well-founded semantics
• Argumentation Semantics for Defeasible Logic

Cited in

(15)

• An inclusion theorem for defeasible logics
• Embedding defeasible logic into logic programming
• Ambiguity Propagating Defeasible Logic and the Well-Founded Semantics
• Towards Context Sensitive Defeasible Rules
• scientific article; zbMATH DE number 1269578 (Why is no real title available?)
• Propositional defeasible logic has linear complexity
• Relating concrete defeasible reasoning formalisms and abstract argumentation
• Argumentation Semantics for Defeasible Logic
• Relating defeasible logic to extended logic programs
• On the relationship between defeasible logic and well-founded semantics
• Embedding defeasible logic into logic programs
• Defeasible conditionalization
• Comparing defeasible logics
• Relative expressiveness of defeasible logics. II
• A logic programming framework for possibilistic argumentation: Formalization and logical properties

This page was built for publication: Relating defeasible and default logic

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