scientific article; zbMATH DE number 6876267
From MaRDI portal
DOI10.23638/LMCS-14(2:12)2018zbMath1476.68120arXiv1705.07767MaRDI QIDQ4643959
Publication date: 30 May 2018
Full work available at URL: https://arxiv.org/abs/1705.07767
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Logic in computer science (03B70) Grammars and rewriting systems (68Q42) Nonclassical and second-order set theories (03E70)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constraint satisfaction and semilinear expansions of addition over the rationals and the reals
- A strong Mal'cev condition for locally finite varieties omitting the unary type
- Point algebras for temporal reasoning: Algorithms and complexity
- The complexity of equality constraint languages
- Existence theorems for weakly symmetric operations
- Affine systems of equations and counting infinitary logic
- The wonderland of reflections
- Datalog and constraint satisfaction with infinite templates
- Characterizations of several Maltsev conditions.
- Constraints, MMSNP and expander relational structures
- Schaefer's Theorem for Graphs
- Automata theory in nominal sets
- Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
- Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk).
- Constraint Satisfaction Problems over the Integers with Successor
- The complexity of temporal constraint satisfaction problems
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- On free actions, minimal flows, and a problem by Ellis
- Closure properties of constraints
- The Complexity of Phylogeny Constraint Satisfaction
- Turing machines with atoms, constraint satisfaction problems, and descriptive complexity
- Locally Finite Constraint Satisfaction Problems
- The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
- A complexity dichotomy for poset constraint satisfaction
- A Proof of the CSP Dichotomy Conjecture
- Constraint Satisfaction Problems of Bounded Width
- Turing Machines with Atoms
- Cores of Countably Categorical Structures
- Classifying the Complexity of Constraints Using Finite Algebras
- Decidability of Definability
- Topological Birkhoff
- Principles and Practice of Constraint Programming – CP 2003