Constraint Satisfaction Problems over the Integers with Successor

DOI10.1007/978-3-662-47672-7_21zbMath1440.68111arXiv1503.08572OpenAlexW1813610230MaRDI QIDQ3448790

Manuel Bodirsky, Antoine Mottet, Barnaby Martin

Publication date: 27 October 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.08572

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70)

Related Items (12)

Constraint satisfaction and semilinear expansions of addition over the rationals and the reals ⋮ Tropically convex constraint satisfaction ⋮ Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic ⋮ Circuit satisfiability and constraint satisfaction around Skolem arithmetic ⋮ \((\mathbb{Z},\mathrm{succ},U)\), \((\mathbb{Z},E,U)\), and their CSP's ⋮ Unnamed Item ⋮ The wonderland of reflections ⋮ Constraint Satisfaction Problems over Numeric Domains ⋮ Max-Closed Semilinear Constraint Satisfaction ⋮ A Dichotomy for First-Order Reducts of Unary Structures ⋮ Unnamed Item ⋮ Distance constraint satisfaction problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance constraint satisfaction problems
• Computational complexity of linear constraints over the integers
• The complexity of equality constraint languages
• Existence theorems for weakly symmetric operations
• On the complexity of H-coloring
• Schaefer's Theorem for Graphs
• On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction
• Constraint Satisfaction with Countable Homogeneous Templates
• The complexity of temporal constraint satisfaction problems
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• Closure properties of constraints
• Model Theory

This page was built for publication: Constraint Satisfaction Problems over the Integers with Successor