The following pages link to Elements of finite model theory. (Q703864):
Displaying 50 items.
- Existential second-order logic and modal logic with quantified accessibility relations (Q259071) (← links)
- Complexity of model checking for reaction systems (Q264544) (← links)
- Highly expressive query languages for unordered data trees (Q269323) (← links)
- Structural tractability of counting of solutions to conjunctive queries (Q269342) (← links)
- A formalization of programs in first-order logic with a discrete linear order (Q274400) (← links)
- Bounded situation calculus action theories (Q286407) (← links)
- A logical approach to locality in pictures languages (Q295631) (← links)
- Model checking Petri nets with names using data-centric dynamic systems (Q315291) (← links)
- Subshifts as models for MSO logic (Q384929) (← links)
- Super/rosy \(L^k\)-theories and classes of finite structures (Q385799) (← links)
- A representation theorem for (\(q\)-)holonomic sequences (Q386034) (← links)
- Solutions and query rewriting in data exchange (Q388220) (← links)
- The language of plain SO-tgds: composition, inversion and structural properties (Q389222) (← links)
- Expressiveness and static analysis of extended conjunctive regular path queries (Q389234) (← links)
- Partial algebras and complexity of satisfiability and universal theory for distributive lattices, Boolean algebras and Heyting algebras (Q391322) (← links)
- The complexity of weighted counting for acyclic conjunctive queries (Q395018) (← links)
- Model-checking hierarchical structures (Q414908) (← links)
- On the model-checking of monadic second-order formulas with edge set quantifications (Q415286) (← links)
- An optimal construction of Hanf sentences (Q420856) (← links)
- The implication problem for `closest node' functional dependencies in complete XML documents (Q439971) (← links)
- Book review of: E. Grädel, P. Kolaitis, L. Libkin, M. Marx, I. Spencer, M. Vardi, Y. Venema, S. Weinstein, Finite model theory and its applications (Q458460) (← links)
- Second-order propositional modal logic and monadic alternation hierarchies (Q466445) (← links)
- On the complexity of propositional and relational credal networks (Q518627) (← links)
- First-order under-approximations of consistent query answers (Q518631) (← links)
- Equivariant unification (Q616849) (← links)
- Compact labelings for efficient first-order model-checking (Q626458) (← links)
- Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA (Q631077) (← links)
- On complexity of Ehrenfeucht-Fraïssé games (Q636279) (← links)
- Query languages for data exchange: beyond unions of conjunctive queries (Q639842) (← links)
- Regular languages of nested words: fixed points, automata, and synchronization (Q649107) (← links)
- Recursive definitions and fixed-points on well-founded structures (Q654910) (← links)
- On first-order definitions of subgraph isomorphism properties (Q679970) (← links)
- Finite-model theory -- A personal perspective (Q688663) (← links)
- The navigational power of web browsers (Q692917) (← links)
- Finite model theory and its applications. (Q703863) (← links)
- On finding short resolution refutations and small unsatisfiable subsets (Q820148) (← links)
- Nonmaximal decidable structures (Q843596) (← links)
- The first order definability of graphs: Upper bounds for quantifier depth (Q860411) (← links)
- An Ehrenfeucht-Fraïssé game approach to collapse results in database theory (Q870360) (← links)
- First-order query rewriting for inconsistent databases (Q882438) (← links)
- The ins and outs of first-order runtime verification (Q888417) (← links)
- Structural characterizations of the navigational expressiveness of relation algebras on a tree (Q896017) (← links)
- Meta-kernelization with structural parameters (Q896025) (← links)
- The complexity of reasoning with FODD and GFODD (Q900300) (← links)
- Expressive power and abstraction in Essence (Q941820) (← links)
- Circle graphs and monadic second-order logic (Q946577) (← links)
- Muller message-passing automata and logics (Q948076) (← links)
- Ehrenfeucht-Fraïssé games in finite set theory (Q963464) (← links)
- Universal algebra and hardness results for constraint satisfaction problems (Q1014634) (← links)
- Affine systems of equations and counting infinitary logic (Q1014638) (← links)
