The following pages link to (Q4850061):
Displaying 50 items.
- Local properties of query languages (Q1575140) (← links)
- Counting problems over the reals (Q1575534) (← links)
- Path constraints in semistructured databases (Q1591150) (← links)
- Querying spatial databases via topological invariants (Q1591156) (← links)
- On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology (Q1603641) (← links)
- Program schemes, arrays, Lindström quantifiers and zero-one laws (Q1606129) (← links)
- Monadic second-order logic on tree-like structures (Q1606130) (← links)
- Query automata over finite trees (Q1607226) (← links)
- Parameterized model checking of rendezvous systems (Q1635829) (← links)
- A progression semantics for first-order logic programs (Q1680677) (← links)
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width (Q1764811) (← links)
- Expressive power of existential first-order sentences of Büchi's sequential calculus (Q1772275) (← links)
- Lower bounds for invariant queries in logics with counting. (Q1853505) (← links)
- Counting modulo quantifiers on finite structures (Q1854352) (← links)
- Adding for-loops to first-order logic (Q1854443) (← links)
- An infinite hierarchy of temporal logics over branching time (Q1854487) (← links)
- Abstract state machines and computationally complete query languages (Q1854519) (← links)
- Representation-finite triangular algebras form an open scheme (Q1856358) (← links)
- The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions. (Q1874383) (← links)
- On the complexity of decision using destinies in \(H\)-bounded structures (Q1885032) (← links)
- Closure properties of locally finite \(\omega\)-languages (Q1885033) (← links)
- Arithmetical definability and computational complexity (Q1885035) (← links)
- Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus (Q1960425) (← links)
- On the expressive power of hybrid branching-time logics (Q1989342) (← links)
- Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT (Q2003999) (← links)
- A logic-based approach to incremental reasoning on multi-agent systems (Q2089459) (← links)
- Defining long words succinctly in FO and MSO (Q2104260) (← links)
- Computation on structures. Behavioural theory, logic, complexity (Q2117601) (← links)
- String theories involving regular membership predicates: from practice to theory and back (Q2140459) (← links)
- Expressive power and succinctness of the positive calculus of binary relations (Q2141281) (← links)
- Verification of agent navigation in partially-known environments (Q2144175) (← links)
- A parameterized view on the complexity of dependence logic (Q2151403) (← links)
- Second-order finite automata (Q2158302) (← links)
- Bisimulation invariant monadic-second order logic in the finite (Q2182315) (← links)
- The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference (Q2206456) (← links)
- Annotation theories over finite graphs (Q2269516) (← links)
- A logician's view of graph polynomials (Q2273013) (← links)
- The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws (Q2283277) (← links)
- Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games (Q2285664) (← links)
- On distinguishing sets of structures by first-order sentences of minimal quantifier rank (Q2333677) (← links)
- Toward a theory of play: a logical perspective on games and interaction (Q2344965) (← links)
- Controlled query evaluation with open queries for a decidable relational submodel (Q2385449) (← links)
- The complexity of model checking multi-stack systems (Q2398213) (← links)
- Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints (Q2411048) (← links)
- A combinatorial characterization of resolution width (Q2475405) (← links)
- The complexity of random ordered structures (Q2478557) (← links)
- Implicit complexity over an arbitrary structure: Quantifier alternations (Q2490113) (← links)
- Recognizability, hypergraph operations, and logical types (Q2496296) (← links)
- Elementary canonical formulae: extending Sahlqvist's theorem (Q2498906) (← links)
- An expressively complete linear time temporal logic for Mazurkiewicz traces (Q2506491) (← links)
