Propositional defeasible logic has linear complexity

DOI10.1017/S1471068401001168zbMATH Open1066.68530OpenAlexW2109029617MaRDI QIDQ4452647FDOQ4452647

Michael J. Maher

Publication date: 1 March 2004

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1471068401001168

Recommendations

• scientific article; zbMATH DE number 1301973
• Propositional Clausal Defeasible Logic
• scientific article; zbMATH DE number 2084375
• Publication:4944873
• An inclusion theorem for defeasible logics

zbMATH Keywords

computational complexitynonmonotonic logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other nonclassical logic (03B60) Logic in artificial intelligence (68T27)

Cited In (15)

• Revision of defeasible preferences
• Rethinking Defeasible Reasoning: A Scalable Approach
• The rationale behind the concept of goal
• Changing Legal Systems: Abrogation and Annulment Part I: Revision of Defeasible Theories
• Defeasible reasoning: A discussion of some intuitions
• Inconsistency Management for Traffic Regulations: Formalization and Complexity Results
• Propositional Clausal Defeasible Logic
• Title not available (Why is that?)
• Time and defeasibility in FIPA ACL semantics
• Enabling reasoning with LegalRuleML
• Practical Normative Reasoning with Defeasible Deontic Logic
• Modal Rules: Extending Defeasible Logic with Modal Operators
• Annotated defeasible logic
• Inference to the stable explanations
• Computing strong and weak permissions in defeasible logic

Uses Software

• DELORES

This page was built for publication: Propositional defeasible logic has linear complexity

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