Tableau systems for deontic action logics based on finite Boolean algebras, and their complexity

DOI10.1007/s11225-016-9688-6zbMath1364.03028OpenAlexW2528006531MaRDI QIDQ526730

Pablo F. Castro

Publication date: 15 May 2017

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-016-9688-6

zbMATH Keywords

tableau systemsSATcomputation complexitydeontic action logics

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Mechanization of proofs and logical operations (03B35) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A deontic logic of action
• Deontic action logic, atomic Boolean algebras and fault-tolerance
• On deontic action logics based on Boolean algebra
• A Tableaux System for Deontic Action Logic
• Computational Complexity
• A practical decision method for propositional dynamic logic (Preliminary Report)

This page was built for publication: Tableau systems for deontic action logics based on finite Boolean algebras, and their complexity