Propositional defeasible logic has linear complexity

DOI10.1017/S1471068401001168zbMath1066.68530OpenAlexW2109029617MaRDI QIDQ4452647

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)

Related Items (13)

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

Uses Software

• DELORES

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