Converse-PDL with regular inclusion axioms: a framework for MAS logics
From MaRDI portal
Publication:2901207
Recommendations
Cites work
- scientific article; zbMATH DE number 4070871 (Why is no real title available?)
- A near-optimal method for reasoning about action
- Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA
- Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
- An overview of tableau algorithms for description logics
- Combining deduction and model checking into tableaux and algorithms for converse-PDL.
- Deciding regular grammar logics with converse through first-order logic
- Modal tableau calculi and interpolation
- On the Correspondence Between Modal and Classical Logic: an Automated Approach
- Prolegomena to dynamic logic for belief revision
- Second-order quantifier elimination. Foundations, computational aspects and applications
- Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic
Cited in
(3)
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)