A practical decision method for propositional dynamic logic (Preliminary Report)
From MaRDI portal
Publication:5402573
DOI10.1145/800133.804362zbMath1283.03066OpenAlexW1997703312MaRDI QIDQ5402573
Publication date: 14 March 2014
Published in: Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/800133.804362
Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Finite sequent calculi for PLTL ⋮ The saturated tableaux for linear miniscope Horn-like temporal logic ⋮ Tableaux for Single-Agent Epistemic PDL with Perfect Recall and No Miracles ⋮ A family of dynamic description logics for representing and reasoning about actions ⋮ A description logic based situation calculus ⋮ Modelling phenomena and dynamic logic of phenomena ⋮ Generalized satisfiability for the description logic \(\mathcal{ALC}\) ⋮ A near-optimal method for reasoning about action ⋮ Temporal stream logic modulo theories ⋮ An elementary proof of the completeness of PDL ⋮ Application of modal logic to programming ⋮ A Tableaux System for Deontic Action Logic ⋮ A complete logic for reasoning about programs via nonstandard model theory. I ⋮ Specifications, models, and implementations of data abstractions ⋮ Process logic: Expressiveness, decidability, completeness ⋮ Modal logic for modelling actions and agents ⋮ Generalized Satisfiability for the Description Logic $\mathcal{ALC}$ ⋮ Tableaux and algorithms for Propositional Dynamic Logic with Converse ⋮ Tableau systems for deontic action logics based on finite Boolean algebras, and their complexity ⋮ A Formal Language for Electronic Contracts ⋮ Decision procedures and expressiveness in the temporal logic of branching time ⋮ From Philosophical to Industrial Logics ⋮ From Monadic Logic to PSL ⋮ Propositional dynamic logic of regular programs ⋮ Before and after vacuity ⋮ Propositional dynamic logic for concurrent programs ⋮ The theory of functional and subset dependencies over relational expressions ⋮ A theory of data dependencies over relational expressions ⋮ EXPtime tableaux for ALC ⋮ Combining deduction and model checking into tableaux and algorithms for converse-PDL. ⋮ Decidability of finite probabilistic propositional dynamic logics
