The following pages link to (Q4219045):
Displaying 50 items.
- Knowledge base exchange: the case of OWL 2 QL (Q309909) (← links)
- Solving parity games in big steps (Q340584) (← links)
- Logic programming approach to automata-based decision procedures (Q347398) (← links)
- Finite satisfiability for guarded fixpoint logic (Q436331) (← links)
- \textit{Once} and \textit{for all} (Q439961) (← links)
- Temporal logics for concurrent recursive programs: satisfiability and model checking (Q472794) (← links)
- Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition (Q606997) (← links)
- Regular languages of nested words: fixed points, automata, and synchronization (Q649107) (← links)
- Optimizing the region algebra is PSPACE-complete (Q765502) (← links)
- Temporal logic with accessibility temporal relations generated by time states themselves (Q779153) (← links)
- Conceptual logic programs (Q854977) (← links)
- On the complexity of the two-variable guarded fragment with transitive guards (Q859827) (← links)
- Open answer set programming for the semantic web (Q881833) (← links)
- 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 (Q929294) (← links)
- Linear temporal logic with until and next, logical consecutions (Q947268) (← links)
- Pushdown module checking (Q968362) (← links)
- Reasoning about XML with temporal logics and automata (Q975873) (← links)
- Mu-calculus path checking (Q1045942) (← links)
- Branching-time logics repeatedly referring to states (Q1047801) (← links)
- A polynomial space construction of tree-like models for logics with local chains of modal connectives (Q1399966) (← links)
- From bidirectionality to alternation. (Q1401248) (← links)
- Multiagent temporal logics with multivaluations (Q1617988) (← links)
- Nontransitive temporal multiagent logic, information and knowledge, deciding algorithms (Q1694714) (← links)
- Conjunctive query containment over trees using schema information (Q1702301) (← links)
- An automata-theoretic approach to the verification of distributed algorithms (Q1706162) (← links)
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics (Q1749477) (← links)
- Cycle detection in computation tree logic (Q1784962) (← links)
- Guarded fixed point logics and the monadic theory of countable trees. (Q1853504) (← links)
- The finite graph problem for two-way alternating automata. (Q1874281) (← links)
- Alternating-time temporal logics with linear past (Q1989330) (← links)
- Automata on infinite trees (Q2074210) (← links)
- A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) (Q2144172) (← links)
- Multi-agent logics with multi-valuations and intensional logical operations (Q2207025) (← links)
- Multi-agent temporal nontransitive linear logics and the admissibility problem (Q2213922) (← links)
- Answering regular path queries in expressive description logics via alternating tree-automata (Q2252521) (← links)
- Query inseparability for \(\mathcal{ALC}\) ontologies (Q2321290) (← links)
- Uniform strategies, rational relations and jumping automata (Q2346407) (← links)
- Complexity results on branching-time pushdown model checking (Q2373715) (← links)
- The complexity of finite model reasoning in description logics (Q2486582) (← links)
- Mu-depth 3 is more than 2: A game-theoretic proof (Q2719798) (← links)
- Uniform solution of parity games on prefix-recognizable graphs (Q2842876) (← links)
- Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus (Q2946334) (← links)
- Efficiently Deciding μ-Calculus with Converse over Finite Trees (Q2957698) (← links)
- Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games (Q2961570) (← links)
- Partially Ordered Two-Way Büchi Automata (Q3073637) (← links)
- Temporal Logic and Fair Discrete Systems (Q3176360) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- From Parity and Payoff Games to Linear Programming (Q3182965) (← links)
- Querying the Unary Negation Fragment with Regular Path Expressions. (Q3305361) (← links)
- (Q3384177) (← links)
