Suche mittels Attribut
Aus International Center for Computational Logic
Diese Seite stellt eine einfache Suchoberfläche zum Finden von Objekten bereit, die ein Attribut mit einem bestimmten Datenwert enthalten. Andere verfügbare Suchoberflächen sind die Attributsuche sowie der Abfragengenerator.
Liste der Ergebnisse
- "Most of" leads to undecidability: Failure of adding frequencies to LTL +
- A Framework for Reasoning about Dynamic Axioms in Description Logics +
- A note on C2 interpreted over finite data-words +
- About the Expressive Power and Complexity of Order-Invariance with Two Variables +
- All-Instances Oblivious Chase Termination is Undecidable for Single-Head Binary TGDs +
- Beyond ALCreg: Exploring Non-Regular Extensions of PDL with Description Logics Features +
- Comonadic Semantics for Description Logics Games +
- Completing the Picture: Complexity of Graded Modal Logics with Converse +
- Data Complexity in Expressive Description Logics With Path Expressions +
- Database-Inspired Reasoning Problems in Description Logics With Path Expressions +
- Exploiting forwardness: Satisfiability and Query-Entailment in Forward Guarded Fragment +
- Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features. +
- Extending Two-Variable Logic on Trees +
- Finite Entailment of Local Queries in the Z family of Description Logics +
- Finite-Controllability of Conjunctive Queries in the Z family of Description Logics (Extended Abstract) +
- How to Tell Easy from Hard: Complexities of Conjunctive Query Entailment in Extensions of ALC +
- Lutz's Spoiler Technique Revisited: A Unified Approach to Worst-Case Optimal Entailment of Unions of Conjunctive Queries in Locally-Forward Description Logics +
- Modal Logics with Composition on Finite Forests: Expressivity and Complexity +
- Modulo Counting on Words and Trees. +
- On Classical Decidable Logics extended with Percentage Quantifiers and Arithmetics +
- On Composing Finite Forests with Modal Logics +
- On the Complexity of Graded Modal Logics with Converse. +
- On the Limits of Decision: the Adjacent Fragment of First-Order Logic +
- One-Variable Logic Meets Presburger Arithmetic +
- Presburger Büchi Tree Automata with Applications to Logics with Expressive Counting +
- Statistical EL is ExpTime-complete +
- The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2EXPTIME-hard +
- The Price of Selfishness: Conjunctive Query Entailment for ALCSelf is 2ExpTime-hard (Extended Abstract) +
- Towards Model Theory of Ordered Logics: Expressivity and Interpolation +
- Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard? +
- Why propositional quantification makes modal logics on trees robustly hard ? +
- Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting +
- Worst-Case Optimal Querying of Very Expressive Description Logics with Path Expressions and Succinct Counting +
