Propositional defeasible logic has linear complexity

DOI10.1017/S1471068401001168MaRDI QIDQ4452647zbMATH OpenOpenAlexFDO

Authors 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

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)

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

Cited in

(15)

• The rationale behind the concept of goal
• Changing Legal Systems: Abrogation and Annulment Part I: Revision of Defeasible Theories
• Modal Rules: Extending Defeasible Logic with Modal Operators
• Revision of defeasible preferences
• Practical Normative Reasoning with Defeasible Deontic Logic
• Propositional Clausal Defeasible Logic
• scientific article; zbMATH DE number 733394 (Why is no real title available?)
• Enabling reasoning with LegalRuleML
• Inconsistency management for traffic regulations: formalization and complexity results
• Computing strong and weak permissions in defeasible logic
• Defeasible reasoning: A discussion of some intuitions
• Rethinking defeasible reasoning: a scalable approach
• Annotated defeasible logic
• Inference to the stable explanations
• Time and defeasibility in FIPA ACL semantics

Describes a project that uses

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)