The following pages link to Elements of finite model theory. (Q703864):
Displaying 50 items.
- Building a Knowledge Base System for an Integration of Logic Programming and Classical Logic (Q5504646) (← links)
- (Q5856403) (← links)
- Axiomatization of betweenness in order-theoretic trees (Q5856415) (← links)
- First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries (Q5870513) (← links)
- Canonisation and Definability for Graphs of Bounded Rank Width (Q5875948) (← links)
- On Composing Finite Forests with Modal Logics (Q5886519) (← links)
- Enumeration for FO Queries over Nowhere Dense Graphs (Q5889796) (← links)
- Guarded Negation (Q5892612) (← links)
- Independence-friendly logic without Henkin quantification (Q5918342) (← links)
- An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning (Q5918962) (← links)
- First-order definable counting-only queries (Q5919275) (← links)
- A framework for comparing query languages in their ability to express Boolean queries (Q5919276) (← links)
- The descriptive complexity of subgraph isomorphism without numerics (Q5919541) (← links)
- An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning (Q5925549) (← links)
- Regular model checking revisited (Q6045028) (← links)
- Relativized adjacency (Q6053841) (← links)
- Seurat games on Stockmeyer graphs (Q6056811) (← links)
- Lifted inference with tree axioms (Q6088316) (← links)
- Nonstandard methods for finite structures (Q6096330) (← links)
- Representation and processing of instantaneous and durative temporal phenomena (Q6102256) (← links)
- Asymptotic elimination of partially continuous aggregation functions in directed graphical models (Q6116192) (← links)
- Feferman-vaught decompositions for prefix classes of first order logic (Q6117143) (← links)
- Inductive definitions in logic versus programs of real-time cellular automata (Q6122593) (← links)
- Arboreal categories and equi-resource homomorphism preservation theorems (Q6131200) (← links)
- Positive First-order Logic on Words and Graphs (Q6135776) (← links)
- Arboreal Categories: An Axiomatic Theory of Resources (Q6135784) (← links)
- Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic (Q6135954) (← links)
- Efficient Evaluation of Arbitrary Relational Calculus Queries (Q6137874) (← links)
- A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases (Q6163648) (← links)
- Mechanised DPO theory: uniqueness of derivations and Church-Rosser theorem (Q6535510) (← links)
- Verified first-order monitoring with recursive rules (Q6535617) (← links)
- Count-free Weisfeiler-Leman and group isomorphism (Q6545240) (← links)
- Generative Datalog with continuous distributions (Q6551262) (← links)
- A logical description of priority separable games (Q6562527) (← links)
- Inapproximability of unique games in fixed-point logic with counting (Q6563050) (← links)
- Executable first-order queries in the logic of information flows (Q6563053) (← links)
- The pebble-relation comonad in finite model theory (Q6563056) (← links)
- On the descriptive complexity of temporal constraint satisfaction problems (Q6567262) (← links)
- On the satisfiability of local first-order logics with data (Q6597951) (← links)
- Game comonads \& generalised quantifiers (Q6597958) (← links)
- Constraint satisfaction, graph isomorphism, and the pebbling comonad (Q6612794) (← links)
- Discrepancy and sparsity (Q6615750) (← links)
- Logical characterizations of algebraic circuit classes over integral domains (Q6620024) (← links)
- Decomposing analogy: a logic characterization (Q6630199) (← links)
- Preservation theorems for Tarski's relation algebra (Q6635502) (← links)
- Formalising the double-pushout approach to graph transformation (Q6635513) (← links)
- Cutting planes width and the complexity of graph isomorphism refutations (Q6636618) (← links)
- Extensions and limits of the Specker-Blatter theorem (Q6642890) (← links)
- The pebble-relation comonad in finite model theory (Q6649442) (← links)
- When locality meets preservation (Q6649481) (← links)
