Converse-PDL with regular inclusion axioms: a framework for MAS logics
DOI10.3166/JANCL.21.61-91zbMATH Open1242.03030OpenAlexW1993086076MaRDI QIDQ2901207FDOQ2901207
Authors: Barbara Dunin-Kȩplicz, Linh Anh Nguyen, Andrzej Szałas
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
Recommendations
Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Agent technology and artificial intelligence (68T42) Mechanization of proofs and logical operations (03B35)
Cites Work
- Combining deduction and model checking into tableaux and algorithms for converse-PDL.
- Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
- A near-optimal method for reasoning about action
- An overview of tableau algorithms for description logics
- Modal tableau calculi and interpolation
- Second-order quantifier elimination. Foundations, computational aspects and applications
- On the Correspondence Between Modal and Classical Logic: an Automated Approach
- Prolegomena to dynamic logic for belief revision
- 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
- Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic
- Title not available (Why is that?)
Cited In (3)
Uses Software
This page was built for publication: Converse-PDL with regular inclusion axioms: a framework for MAS logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2901207)