scientific article; zbMATH DE number 1223729
From MaRDI portal
Publication:4219045
zbMath0909.03019MaRDI QIDQ4219045
Publication date: 25 March 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
\(\mu\)-calculusinfinite gamessatisfiabilityalternating automataemptinesstree-model propertyone-way nondeterministic tree automata
Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05)
Related Items (75)
The finite graph problem for two-way alternating automata. ⋮ Multiagent temporal logics with multivaluations ⋮ Intransitive Temporal Multi-agent’s Logic, Knowledge and Uncertainty, Plausibility ⋮ Symmetric Strategy Improvement ⋮ Containment of Monadic Datalog Programs via Bounded Clique-Width ⋮ Complexity results on branching-time pushdown model checking ⋮ Temporal Logic and Fair Discrete Systems ⋮ The mu-calculus and Model Checking ⋮ Knowledge base exchange: the case of OWL 2 QL ⋮ A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) ⋮ From Parity and Payoff Games to Linear Programming ⋮ Conceptual logic programs ⋮ Satisfiability in a Temporal Multi-valueted Logic Based on Z ⋮ Multi-Agents’ Temporal Logic using Operations of Static Agents’ Knowledge ⋮ Solving parity games in big steps ⋮ On the complexity of the two-variable guarded fragment with transitive guards ⋮ Logic programming approach to automata-based decision procedures ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition ⋮ Open answer set programming for the semantic web ⋮ Querying the Unary Negation Fragment with Regular Path Expressions. ⋮ Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus ⋮ Enriched μ–Calculus Pushdown Module Checking ⋮ From linear temporal logics to Büchi automata: the early and simple principle ⋮ Taming strategy logic: non-recurrent fragments ⋮ A polynomial space construction of tree-like models for logics with local chains of modal connectives ⋮ Satisfiability problem in interval FP-logic ⋮ Formulas expressing totally nonstable truth values of formulas ⋮ Efficiently Deciding μ-Calculus with Converse over Finite Trees ⋮ Focus-style proofs for the two-way alternation-free \(\mu \)-calculus ⋮ From bidirectionality to alternation. ⋮ Nontransitive temporal multiagent logic, information and knowledge, deciding algorithms ⋮ Admissibility and unification in the modal logics related to S4.2 ⋮ Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games ⋮ Conjunctive query containment over trees using schema information ⋮ Finite satisfiability for guarded fixpoint logic ⋮ An automata-theoretic approach to the verification of distributed algorithms ⋮ \textit{Once} and \textit{for all} ⋮ Multi-agent logics with multi-valuations and intensional logical operations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Multi-agent temporal nontransitive linear logics and the admissibility problem ⋮ Regular languages of nested words: fixed points, automata, and synchronization ⋮ An Infinite Automaton Characterization of Double Exponential Time ⋮ Branching time logics \(\mathcal {BTL}^{\text{U,S}}_{\text{N},\text{N}^{-1}}(\mathcal {Z})_{\alpha }\) with operations \textit{Until} and \textit{Since} based on bundles of integer numbers, logical consecutions, deciding algorithms ⋮ Temporal logics for concurrent recursive programs: satisfiability and model checking ⋮ Linear temporal logic with until and next, logical consecutions ⋮ Alternating-time temporal logics with linear past ⋮ Reasoning and Query Answering in Description Logics ⋮ Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics ⋮ Unnamed Item ⋮ Answering regular path queries in expressive description logics via alternating tree-automata ⋮ Comparing the succinctness of monadic query languages over finite trees ⋮ Pushdown module checking ⋮ The complexity of finite model reasoning in description logics ⋮ An Automata-Theoretic Approach to Infinite-State Systems ⋮ Reasoning about XML with temporal logics and automata ⋮ Unnamed Item ⋮ Cycle detection in computation tree logic ⋮ The Complexity of CTL* + Linear Past ⋮ Partially Ordered Two-Way Büchi Automata ⋮ Solving Parity Games in Big Steps ⋮ Linear Temporal Logic with Non-transitive Time, Algorithms for Decidability and Verification of Admissibility ⋮ Ontologies and Databases: The DL-Lite Approach ⋮ Optimizing the region algebra is PSPACE-complete ⋮ Automata on infinite trees ⋮ Query inseparability for \(\mathcal{ALC}\) ontologies ⋮ The Complexity of Flat Freeze LTL ⋮ Temporal logic with accessibility temporal relations generated by time states themselves ⋮ Mu-calculus path checking ⋮ Branching-time logics repeatedly referring to states ⋮ Unification and Inference Rules in the Multi-modal Logic of Knowledge and Linear Time LTK ⋮ Guarded fixed point logics and the monadic theory of countable trees. ⋮ Uniform strategies, rational relations and jumping automata
This page was built for publication:
