scientific article; zbMATH DE number 1515320
From MaRDI portal
Publication:4507858
zbMath0953.03036MaRDI QIDQ4507858
Publication date: 29 January 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityPSPACE-completemultimodal logicPSPACE-hardnessNIL satisfiabilitynondeterministic information logicreasoning about information systems
Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)
Related Items (2)
A polynomial space construction of tree-like models for logics with local chains of modal connectives ⋮ Deciding regular grammar logics with converse through first-order logic
This page was built for publication:
