Elements of finite model theory.

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Model theory of finite structures (03C13) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01)

Cited In (only showing first 100 items - show all)

A NORMAL FORM FOR FIRST-ORDER LOGIC OVER DOUBLY-LINKED DATA STRUCTURES
CompoSAT: specification-guided coverage for model finding
On the expressive power of linear algebra on graphs
Recognizability, hypergraph operations, and logical types
Existential second-order logic and modal logic with quantified accessibility relations
Complexity of model checking for reaction systems
On distinguishing sets of structures by first-order sentences of minimal quantifier rank
Highly expressive query languages for unordered data trees
Structural tractability of counting of solutions to conjunctive queries
A formalization of programs in first-order logic with a discrete linear order
Limiting Until in Ordered Tree Query Languages
Approximations of Mappings
Separation logics and modalities: a survey
The complexity of weighted counting for acyclic conjunctive queries
Model-checking hierarchical structures
An optimal construction of Hanf sentences
Bounded situation calculus action theories
Definability of Combinatorial Functions and Their Linear Recurrence Relations
Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
Unary automatic graphs: an algorithmic perspective
Partial algebras and complexity of satisfiability and universal theory for distributive lattices, Boolean algebras and Heyting algebras
The first order definability of graphs: Upper bounds for quantifier depth
First-order query rewriting for inconsistent databases
Muller message-passing automata and logics
The implication problem for `closest node' functional dependencies in complete XML documents
A logical approach to locality in pictures languages
On the decidability of axiomatized mereotopological theories
The ins and outs of first-order runtime verification
Title not available (Why is that?)
Super/rosy \(L^k\)-theories and classes of finite structures
Finite model theory and its applications.
Independence-friendly logic without Henkin quantification
A remark on the complexity of consistent conjunctive query answering under primary key violations
Model checking Petri nets with names using data-centric dynamic systems
Controlled query evaluation with open queries for a decidable relational submodel
Equivariant unification
Cyclic congruences of slim semimodular lattices and non-finite axiomatizability of some finite structures
On the model-checking of monadic second-order formulas with edge set quantifications
Second-order propositional modal logic and monadic alternation hierarchies
On the power of deep pushdown stacks
Canonisation and Definability for Graphs of Bounded Rank Width
Process-centric views of data-driven business artifacts
Compact labelings for efficient first-order model-checking
Regular languages of nested words: fixed points, automata, and synchronization
Faster Property Testers in a Variation of the Bounded Degree Model
Circle graphs and monadic second-order logic
Extending two-variable logic on data trees with order on data values and its automata
Title not available (Why is that?)
Query languages for data exchange: beyond unions of conjunctive queries
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
On the Parameterised Intractability of Monadic Second-Order Logic
Recursive Definitions and Fixed-Points
From a zoo to a zoology: Towards a general theory of graph polynomials
Guarded Negation
Affine systems of equations and counting infinitary logic
Universal algebra and hardness results for constraint satisfaction problems
Second-order propositional modal logic: expressiveness and completeness results
On complexity of Ehrenfeucht-Fraïssé games
An Ehrenfeucht-Fraïssé game approach to collapse results in database theory
Querying Regular Graph Patterns
On the equivalence between FDs in XML and FDs in relations
Finding Reductions Automatically
Relational hidden variables and non-locality
First-order under-approximations of consistent query answers
On the complexity of propositional and relational credal networks
Subshifts as models for MSO logic
A representation theorem for (\(q\)-)holonomic sequences
Solutions and query rewriting in data exchange
Expressiveness and static analysis of extended conjunctive regular path queries
The language of plain SO-tgds: composition, inversion and structural properties
On finding short resolution refutations and small unsatisfiable subsets
Existential monadic second order logic on random rooted trees
A disproof the Le Bars conjecture about the zero-one law for existential monadic second-order sentences
The navigational power of web browsers
Expressive power of entity-linking frameworks
Nonmaximal decidable structures
Model theoretical aspects of weakly aggregative modal logic
Lifted inference with tree axioms
Relating Structure and Power: Comonadic Semantics for Computational Resources
Parameterized model checking of rendezvous systems
Varieties
Ontology-Mediated Query Answering with Data-Tractable Description Logics
Comparison of expressive power of some query languages for databases
Partitioning graphs into induced subgraphs
Title not available (Why is that?)
Title not available (Why is that?)
Parameterized Complexity Classes under Logical Reductions
Axiomatisability and hardness for universal Horn classes of hypergraphs
Title not available (Why is that?)
Message exchange games in strategic contexts
The mu-calculus and Model Checking
Relativised homomorphism preservation at the finite level
Regular model checking revisited
Ehrenfeucht-Fraïssé games in finite set theory
On the Descriptive Complexity of Linear Algebra
From Hilbert's program to a logic tool box
Title not available (Why is that?)
Meta-kernelization with structural parameters
Structural characterizations of the navigational expressiveness of relation algebras on a tree
Arity and alternation: a proper hierarchy in higher order logics

This page was built for publication: Elements of finite model theory.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703864)