Pages that link to "Item:Q3753525"
From MaRDI portal
The following pages link to Relational queries computable in polynomial time (Q3753525):
Displaying 50 items.
- How to define a linear order on finite models (Q1371431) (← links)
- Finitely representable databases (Q1376408) (← links)
- A query language for NC (Q1376409) (← links)
- Using automata theory for characterizing the semantics of terminological cycles (Q1380409) (← links)
- Polynomial-time computable stable models (Q1380428) (← links)
- Metafinite model theory (Q1383163) (← links)
- A probabilistic view of Datalog parallelization (Q1389447) (← links)
- \(\Delta\)-languages for sets and LOGSPACE computable graph transformers (Q1392148) (← links)
- Bounded fixpoints for complex objects (Q1392283) (← links)
- On the complexity of single-rule datalog queries. (Q1401945) (← links)
- A second-order system for polytime reasoning based on Grädel's theorem. (Q1412837) (← links)
- Games and total Datalog\(^{\lnot}\) queries (Q1575136) (← links)
- Local properties of query languages (Q1575140) (← links)
- Querying spatial databases via topological invariants (Q1591156) (← links)
- Quantified computation tree logic (Q1603537) (← links)
- Expressiveness of concept expressions in first-order description logics (Q1606296) (← links)
- Structure and complexity of relational queries (Q1838840) (← links)
- Lower bounds for invariant queries in logics with counting. (Q1853505) (← links)
- An algebra for pomsets. (Q1854275) (← links)
- Counting modulo quantifiers on finite structures (Q1854352) (← links)
- Equivalence and normal forms for the restricted and bounded fixpoint in the nested algebra (Q1854400) (← links)
- Adding for-loops to first-order logic (Q1854443) (← links)
- Linear time and the power of one first-order universal quantifier (Q1854556) (← links)
- An algorithm for handling many relational calculus queries efficiently. (Q1872707) (← links)
- Describing parameterized complexity classes (Q1877556) (← links)
- Expressive equivalence of least and inflationary fixed-point logic (Q1886320) (← links)
- A linear time algorithm for monadic querying of indefinite data over linearly ordered domains (Q1887153) (← links)
- Computing with first-order logic (Q1892224) (← links)
- Generalized quantifiers and pebble games on finite structures (Q1892941) (← links)
- Directions in generalized quantifier theory (Q1908858) (← links)
- Hierarchies in transitive closure logic, stratified Datalog and infinitary logic (Q1919531) (← links)
- Complexity and undecidability results for logic programming (Q1924779) (← links)
- Linear ordering on graphs, anti-founded sets and polynomial time computability (Q1960423) (← links)
- Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus (Q1960425) (← links)
- Clocked population protocols (Q2040025) (← links)
- Some thoughts on computational models: from massive human computing to abstract state machines, and beyond (Q2117588) (← links)
- Computing possible and certain answers over order-incomplete data (Q2334598) (← links)
- On symmetric circuits and fixed-point logics (Q2363965) (← links)
- Fixpoint logics over hierarchical structures (Q2429724) (← links)
- Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs (Q2478545) (← links)
- Comparison of expressive power of some query languages for databases (Q2510772) (← links)
- Symbioses between mathematical logic and computer science (Q2630825) (← links)
- An algebra and a logic for \(NC^ 1\) (Q2638772) (← links)
- Inductive definitions over finite structures (Q2639057) (← links)
- On uniformity within \(NC^ 1\) (Q2640342) (← links)
- Descriptive complexity of deterministic polylogarithmic time and space (Q2662676) (← links)
- On the relative expressiveness of description logics and predicate logics (Q2674209) (← links)
- On the unusual effectiveness of logic in computer science (Q2736585) (← links)
- Number of variables is equivalent to space (Q2758055) (← links)
- A Parameterized Halting Problem (Q2908544) (← links)
