Propositional Clausal Defeasible Logic

DOI10.1007/978-3-540-87803-2_5MaRDI QIDQ3532456zbMATH OpenOpenAlexFDO

Authors David Billington

Publication date 27 October 2008

Published in Logics in Artificial Intelligence (Search for Journal in Brave)

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

zbMATH Keywords

artificial intelligencenonmonotonic reasoningknowledge representation and reasoningdefeasible logic

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic in artificial intelligence (68T27)

Recommendations

• scientific article; zbMATH DE number 1301973
• Propositional defeasible logic has linear complexity
• scientific article; zbMATH DE number 1696797
• Proving quantified literals in defeasible logic
• Defeasible logic with dynamic priorities

Cites work

• scientific article; zbMATH DE number 2088364 (Why is no real title available?)
• A logic for default reasoning
• AI 2003: Advances in Artificial Intelligence
• AI 2005: Advances in Artificial Intelligence
• Ambiguity Propagating Defeasible Logic and the Well-Founded Semantics
• Defeasible Logic is Stable
• Deontic Logic in Computer Science
• Propositional plausible logic: Introduction and implementation

Cited in

(6)

• Propositional lax logic
• An inclusion theorem for defeasible logics
• Propositional defeasible logic has linear complexity
• On the logical properties of the nonmonotonic description logic \(\mathcal{DL}^{\operatorname{N}}\)
• Interdefinability of defeasible logic and logic programming under the well-founded semantics
• Principles of logics for plausible reasoning

This page was built for publication: Propositional Clausal Defeasible Logic

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