The following pages link to (Q5691140):
Displaying 50 items.
- Logical separability of labeled data examples under ontologies (Q2093388) (← links)
- Algebraic model checking for discrete linear dynamical systems (Q2112097) (← links)
- Communities and ancestors associated with Egon Börger and ASM (Q2117583) (← links)
- Some thoughts on computational models: from massive human computing to abstract state machines, and beyond (Q2117588) (← links)
- Computation on structures. Behavioural theory, logic, complexity (Q2117601) (← links)
- Complexity of finite-variable fragments of propositional temporal and modal logics of computation (Q2148903) (← links)
- Small model property reflects in games and automata (Q2151424) (← links)
- Semiring programming: a semantic framework for generalized sum product problems (Q2206471) (← links)
- Stratified guarded first-order transition systems (Q2233528) (← links)
- The fluted fragment with transitive relations (Q2238133) (← links)
- First-order rewritability of ontology-mediated queries in linear temporal logic (Q2238711) (← links)
- The dark side of interval temporal logic: marking the undecidability border (Q2251125) (← links)
- Axiomatizing the logical core of XPath 2.0 (Q2272223) (← links)
- On coarser interval temporal logics (Q2321249) (← links)
- Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter (Q2323638) (← links)
- Succinct definitions in the first order theory of graphs (Q2368907) (← links)
- Controlled query evaluation with open queries for a decidable relational submodel (Q2385449) (← links)
- Data-complexity of the two-variable fragment with counting quantifiers (Q2389348) (← links)
- A survey on temporal logics for specifying and verifying real-time systems (Q2418645) (← links)
- Decidable cases of first-order temporal logic with functions (Q2426731) (← links)
- Modal definability of first-order formulas with free variables and query answering (Q2446543) (← links)
- Automated reformulation of specifications by safe delay of constraints (Q2457622) (← links)
- Temporal prepositions and their logic (Q2457655) (← links)
- A SAT-based parser and completer for pictures specified by tiling (Q2459547) (← links)
- Herbrand's theorem and term induction (Q2491080) (← links)
- Definability and decidability of binary predicates for time granularity (Q2495389) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- Guarded fragments with constants (Q2567342) (← links)
- The undecidability of iterated modal relativization (Q2574887) (← links)
- Symbioses between mathematical logic and computer science (Q2630825) (← links)
- Computational complexity of theories of a binary predicate with a small number of variables (Q2696689) (← links)
- A Logical Approach to Data-Aware Automated Sequence Generation (Q2889859) (← links)
- On Satisfiability in ATL with Strategy Contexts (Q2915087) (← links)
- The Bernays-Schönfinkel-Ramsey class for set theory: decidability (Q2915897) (← links)
- Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey (Q2970301) (← links)
- Set-syllogistics meet combinatorics (Q2971068) (← links)
- Optimal Tableau Systems for Propositional Neighborhood Logic over All, Dense, and Discrete Linear Orders (Q3010361) (← links)
- Combining Theories: The Ackerman and Guarded Fragments (Q3172881) (← links)
- Combining Model Checking and Deduction (Q3176378) (← links)
- Extended First-Order Logic (Q3183527) (← links)
- Undecidability of the Logic of Overlap Relation over Discrete Linear Orderings (Q3185763) (← links)
- Bounded Quantifier Instantiation for Checking Inductive Invariants (Q3303891) (← links)
- Second-Order Quantifier Elimination on Relational Monadic Formulas – A Basic Method and Some Less Expected Applications (Q3455775) (← links)
- Decidable Fragments of Many-Sorted Logic (Q3498453) (← links)
- Monadic Fragments of Gödel Logics: Decidability and Undecidability Results (Q3498458) (← links)
- How Many Legs Do I Have? Non-Simple Roles in Number Restrictions Revisited (Q3498475) (← links)
- Expressive Power and Decidability for Memory Logics (Q3511448) (← links)
- On the Almighty Wand (Q3540188) (← links)
- The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey (Q3586006) (← links)
- Decidability and Undecidability in Probability Logic (Q3605546) (← links)
