The following pages link to (Q5691140):
Displaying 50 items.
- On the data complexity of consistent query answering (Q269317) (← links)
- Static analysis of navigational XPath over graph databases (Q269725) (← links)
- Decision procedures for flat array properties (Q287272) (← links)
- On the almighty wand (Q418137) (← links)
- Verification of multi-linked heaps (Q439948) (← links)
- Testable and untestable classes of first-order formulae (Q440006) (← links)
- Spatial reasoning with \(\mathcal{RCC} 8\) and connectedness constraints in Euclidean spaces (Q464617) (← links)
- A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions (Q477206) (← links)
- Aperiodic tilings and entropy (Q511008) (← links)
- On the complexity of propositional and relational credal networks (Q518627) (← links)
- Infinite games with finite knowledge gaps (Q528188) (← links)
- Relational completeness of query languages for annotated databases (Q532367) (← links)
- A description logic based situation calculus (Q604908) (← links)
- FO(ID) as an extension of DL with rules (Q604911) (← links)
- Complexity of hybrid logics over transitive frames (Q631089) (← links)
- Propositional interval neighborhood logics: expressiveness, decidability, and undecidable extensions (Q636267) (← links)
- Inclusion dependencies and their interaction with functional dependencies in SQL (Q730506) (← links)
- Optimizing the region algebra is PSPACE-complete (Q765502) (← links)
- Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
- A decidable and expressive fragment of Many-Sorted first-order linear temporal logic (Q821564) (← links)
- On decidability properties of local sentences (Q860837) (← links)
- Deciding Boolean algebra with Presburger arithmetic (Q861705) (← links)
- An automata-theoretic approach to constraint LTL (Q870361) (← links)
- Specification and verification of data-driven Web applications (Q878758) (← links)
- Topological complexity of locally finite \(\omega\)-languages (Q944222) (← links)
- From Hilbert's program to a logic tool box (Q1028646) (← links)
- Exploiting functional dependencies in declarative problem specifications (Q1028967) (← links)
- Decidable fragments of many-sorted logic (Q1041587) (← links)
- Hybrid logic meets IF modal logic (Q1047800) (← links)
- Infinite games on finitely coloured graphs with applications to automata on infinite trees (Q1276252) (← links)
- Metafinite model theory (Q1383163) (← links)
- Integrity constraints for XML (Q1394804) (← links)
- Undecidability of domino games and hhp-bisimilarity. (Q1401953) (← links)
- Path constraints in semistructured databases (Q1591150) (← links)
- Relational transducers for electronic commerce (Q1591155) (← links)
- Decidable fragments of first-order temporal logics (Q1591203) (← links)
- Rewriting queries using views over monadic database schemas (Q1603453) (← links)
- The \(\exists\forall^2\) fragment of the first-order theory of atomic set constraints is \(\Pi_1^0\)-hard (Q1607043) (← links)
- Logical foundations of information disclosure in ontology-based data integration (Q1711879) (← links)
- Local rules and global order, or aperiodic tilings (Q1777517) (← links)
- Axiomatizing the monodic fragment of first-order temporal logic (Q1849866) (← links)
- Logic with equality: Partisan corroboration and shifted pairing (Q1854299) (← links)
- Thue trees (Q1861534) (← links)
- On the complexity of decision using destinies in \(H\)-bounded structures (Q1885032) (← links)
- Arithmetical definability and computational complexity (Q1885035) (← links)
- On logics with two variables (Q1960419) (← links)
- Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus (Q1960425) (← links)
- Simultaneous rigid E-unification and other decision problems related to the Herbrand theorem (Q1960430) (← links)
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
- On the relationship between the complexity of decidability and decomposability of first-order theories (Q2062094) (← links)
