Converse-PDL with regular inclusion axioms: a framework for MAS logics

DOI10.3166/jancl.21.61-91zbMath1242.03030OpenAlexW1993086076MaRDI QIDQ2901207

Andrzej Szałas, Linh Anh Nguyen, Barbara Dunin-Kȩplicz

Publication date: 17 July 2012

Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3166/jancl.21.61-91

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Mechanization of proofs and logical operations (03B35) Agent technology and artificial intelligence (68T42)

Related Items (2)

ExpTime tableaux for \(\mathcal {ALC}\) using sound global caching ⋮ ExpTime tableaux with global caching for hybrid PDL

Uses Software

• SQEMA

Cites Work

• Modal tableau calculi and interpolation
• Prolegomena to dynamic logic for belief revision
• Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic
• A near-optimal method for reasoning about action
• Combining deduction and model checking into tableaux and algorithms for converse-PDL.
• Deciding regular grammar logics with converse through first-order logic
• Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA
• On the Correspondence Between Modal and Classical Logic: an Automated Approach
• Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
• An overview of tableau algorithms for description logics
• Unnamed Item
• Unnamed Item

This page was built for publication: Converse-PDL with regular inclusion axioms: a framework for MAS logics