A tableau decision algorithm for modalized \(\mathcal A\mathcal L\mathcal C\) with constant domains

DOI10.1023/A:1021308527417zbMath1010.03012OpenAlexW1579165893MaRDI QIDQ1863829

Carsten Lutz, Holger Sturm, Frank Wolter, Michael Zakharyashchev

Publication date: 12 March 2003

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

Full work available at URL: https://doi.org/10.1023/a:1021308527417

zbMATH Keywords

complexitytableauxdecidabilitymodal logicsdescription logicscombining systems

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35)

Related Items (6)

Coalition Description Logic with Individuals ⋮ PS\textsc{pace} tableau algorithms for acyclic modalized \({\mathcal{ALC}}\) ⋮ A Cookbook for Temporal Conceptual Data Modelling with Description Logics ⋮ A survey on temporal logics for specifying and verifying real-time systems ⋮ A Tableau Decision Procedure for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi mathvariant="script">ALC</mml:mi></mml:math> With Monotonic Modal Operators and Constant Domains ⋮ A PSpace algorithm for acyclic epistemic DL \(\mathcal{ALCS}5_m\)

This page was built for publication: A tableau decision algorithm for modalized \(\mathcal A\mathcal L\mathcal C\) with constant domains