Complexity of graph partition problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Constraint satisfaction and database theory: a tutorial
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of maximal constraint languages
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SIGACT news complexity theory column 34
ACM SIGACT News
Homomorphisms to powers of digraphs
Discrete Mathematics - Algebraic and topological methods in graph theory
Hypertree Decompositions: A Survey
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Satisfiability of Systems of Equations over Finite Monoids
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Constraint Satisfaction Problems and Finite Algebras
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Towards a Predictive Computational Complexity Theory
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Constraint Satisfaction Problems in Non-deterministic Logarithmic Space
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Complexity of Minimal Satisfiability Problems
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Solving Order Constraints in Logarithmic Space
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Learnability of Quantified Formulas
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Connected and Loosely Connected List Homomorphisms
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
New tractable constraint classes from old
Exploring artificial intelligence in the new millennium
View-Based Query Processing and Constraint Satisfaction
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
Journal of the ACM (JACM)
New Tractable Classes From Old
Constraints
Learnability of quantified formulas
Theoretical Computer Science
Reasoning on regular path queries
ACM SIGMOD Record
The complexity of minimal satisfiability problems
Information and Computation
Annals of Mathematics and Artificial Intelligence
On sufficient conditions for unsatisfiability of random formulas
Journal of the ACM (JACM)
The list partition problem for graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Implementing a Test for Tractability
Constraints
Dichotomies for classes of homomorphism problems involving unary functions
Theoretical Computer Science
A new tractable class of constraint satisfaction problems
Annals of Mathematics and Artificial Intelligence
Recognizing frozen variables in constraint satisfaction problems
Theoretical Computer Science
The complexity of counting homomorphisms seen from the other side
Theoretical Computer Science
A polynomial-time algorithm for near-unanimity graphs
Journal of Algorithms
Constraint solving via fractional edge covers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Journal of Computer and System Sciences
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
The complexity of partition functions
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
H-Coloring dichotomy revisited
Theoretical Computer Science - Graph colorings
The complexity of soft constraint satisfaction
Artificial Intelligence
Minimum cost and list homomorphisms to semicomplete digraphs
Discrete Applied Mathematics
A rendezvous of logic, complexity, and algebra
ACM SIGACT News
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
View-based query processing: On the relationship between rewriting, answering and losslessness
Theoretical Computer Science
Determining the consistency of partial tree descriptions
Artificial Intelligence
Digraph matrix partitions and trigraph homomorphisms
Discrete Applied Mathematics
Towards a dichotomy theorem for the counting constraint satisfaction problem
Information and Computation
Maximum H-colourable subdigraphs and constraint optimization with arbitrary weights
Journal of Computer and System Sciences
On counting homomorphisms to directed acyclic graphs
Journal of the ACM (JACM)
A combinatorial characterization of resolution width
Journal of Computer and System Sciences
Counting truth assignments of formulas of bounded tree-width or clique-width
Discrete Applied Mathematics
On digraph coloring problems and treewidth duality
European Journal of Combinatorics
Majority constraints have bounded pathwidth duality
European Journal of Combinatorics
European Journal of Combinatorics
Forbidden lifts (NP and CSP for combinatorialists)
European Journal of Combinatorics
Majority functions on structures with finite duality
European Journal of Combinatorics
What makes propositional abduction tractable
Artificial Intelligence
The complexity of temporal constraint satisfaction problems
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Graphs, polymorphisms and the complexity of homomorphism problems
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Computational complexity of auditing finite attributes in statistical databases
Journal of Computer and System Sciences
Tree-width and functional dependencies in databases
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Partially Ordered Connectives and Monadic Monotone Strict NP
Journal of Logic, Language and Information
The approximability of MAX CSP with fixed-value constraints
Journal of the ACM (JACM)
Communication: On the restricted homomorphism problem
Discrete Applied Mathematics
Hierarchies in Fragments of Monadic Strict NP
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Computational Complexity of Constraint Satisfaction
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
First-Order Model Checking Problems Parameterized by the Model
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Directed st-Connectivity Is Not Expressible in Symmetric Datalog
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Non-dichotomies in Constraint Satisfaction Complexity
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
An Algebraic Framework for Schema Matching
Informatica
There are no pure relational width 2 constraint satisfaction problems
Information Processing Letters
Approximating fractional hypertree width
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Relatively quantified constraint satisfaction
Constraints
Recent Results on the Algebraic Approach to the CSP
Complexity of Constraints
Dualities for Constraint Satisfaction Problems
Complexity of Constraints
Uniform Constraint Satisfaction Problems and Database Theory
Complexity of Constraints
Constraint Satisfaction Problems with Infinite Templates
Complexity of Constraints
Introduction to the Maximum Solution Problem
Complexity of Constraints
On the Computational Complexity of Monotone Constraint Satisfaction Problems
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Existentially restricted quantified constraint satisfaction
Information and Computation
Extension problems with degree bounds
Discrete Applied Mathematics
The complexity of satisfiability problems: Refining Schaefer's theorem
Journal of Computer and System Sciences
Universal algebra and hardness results for constraint satisfaction problems
Theoretical Computer Science
Affine systems of equations and counting infinitary logic
Theoretical Computer Science
Maximal infinite-valued constraint languages
Theoretical Computer Science
Holant problems and counting CSP
Proceedings of the forty-first annual ACM symposium on Theory of computing
A new line of attack on the dichotomy conjecture
Proceedings of the forty-first annual ACM symposium on Theory of computing
Tricolorable torus knots are NP-complete
Proceedings of the 47th Annual Southeast Regional Conference
Hybrid tractable CSPs which generalize tree structure
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
A rendezvous of logic, complexity, and algebra
ACM Computing Surveys (CSUR)
The complexity of constraint satisfaction games and QCSP
Information and Computation
Hard constraint satisfaction problems have hard gaps at location 1
Theoretical Computer Science
The complexity of weighted Boolean #CSP with mixed signs
Theoretical Computer Science
Collapsibility and consistency in quantified constraint satisfaction
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
A maximal tractable class of soft constraints
Journal of Artificial Intelligence Research
A maximal tractable class of soft constraints
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A combinatorial constraint satisfaction problem dichotomy classification conjecture
European Journal of Combinatorics
The complexity of soft constraint satisfaction
Artificial Intelligence
Theoretical Computer Science
The Helly property and satisfiability of Boolean formulas defined on set families
European Journal of Combinatorics
The complexity of temporal constraint satisfaction problems
Journal of the ACM (JACM)
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Communication: Minimum cost and list homomorphisms to semicomplete digraphs
Discrete Applied Mathematics
Approximating fractional hypertree width
ACM Transactions on Algorithms (TALG)
A fast algorithm and datalog inexpressibility for temporal reasoning
ACM Transactions on Computational Logic (TOCL)
Enumerating all solutions for constraint satisfaction problems
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
An approximation trichotomy for Boolean #CSP
Journal of Computer and System Sciences
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
Artificial Intelligence
Computational complexity of generalized domination: a complete dichotomy for chordal graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Bounded tree-width and CSP-related problems
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
The complexity of rooted phylogeny problems
Proceedings of the 13th International Conference on Database Theory
Proceedings of the forty-second ACM symposium on Theory of computing
Tractable hypergraph properties for constraint satisfaction and conjunctive queries
Proceedings of the forty-second ACM symposium on Theory of computing
Tree-width for first order formulae
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Decidable relationships between consistency notions for constraint satisfaction problems
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Constraint satisfaction problems and global cardinality constraints
Communications of the ACM
CSP duality and trees of bounded pathwidth
Theoretical Computer Science
Constraint satisfaction with succinctly specified relations
Journal of Computer and System Sciences
Minimum cost homomorphisms to oriented cycles with some loops
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Graph homomorphisms with complex values: a dichotomy theorem
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Distance constraint satisfaction problems
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Parameterized complexity and kernelizability of max ones and exact ones problems
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
A new hybrid tractable class of soft constraint problems
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
On the containment of forbidden patterns problems
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Extensions of the minimum cost homomorphism problem
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Tree dualities for constraint satisfaction
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Maltsev digraphs have a majority polymorphism
European Journal of Combinatorics
Congruence Distributivity Implies Bounded Width
SIAM Journal on Computing
Tractability and Learnability Arising from Algebras with Few Subpowers
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
Complexity of conservative constraint satisfaction problems
ACM Transactions on Computational Logic (TOCL)
Finding reductions automatically
Fields of logic and computation
Hybrid tractability of valued constraint problems
Artificial Intelligence
Dichotomy for tree-structured trigraph list homomorphism problems
Discrete Applied Mathematics
Note: The Ck-extended graft construction
Discrete Applied Mathematics
Disjunction property and complexity of substructural logics
Theoretical Computer Science
Interleaved adjoints of directed graphs
European Journal of Combinatorics
Computing vertex-surjective homomorphisms to partially reflexive trees
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
On the CSP dichotomy conjecture
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
The complexity of symmetric Boolean parity Holant problems
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Low-level dichotomy for quantified constraint satisfaction problems
Information Processing Letters
An algebraic theory of complexity for valued constraints: establishing a Galois connection
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Submodularity on a tree: unifying L-convex and bisubmodular functions
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
On guaranteeing polynomially bounded search tree size
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
QCSP on partially reflexive forests
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
The Complexity of Positive First-Order Logic without Equality
ACM Transactions on Computational Logic (TOCL)
Guest column: complexity dichotomies of counting problems
ACM SIGACT News
Linear programming, width-1 CSPs, and robust satisfaction
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
An algebraic characterisation of complexity for valued constraint
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Approximability of integer programming with generalised constraints
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Locally injective graph homomorphism: lists guarantee dichotomy
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Generalised dualities and finite maximal antichains
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Bounded-degree forbidden patterns problems are constraint satisfaction problems
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
The complexity of conservative valued CSPs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Datalog and constraint satisfaction with infinite templates
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Towards a trichotomy for quantified H-coloring
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Computing hypergraph width measures exactly
Information Processing Letters
Journal of Computer and System Sciences
Collapsibility in infinite-domain quantified constraint satisfaction
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Universal structures and the logic of forbidden patterns
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
View-based query processing: on the relationship between rewriting, answering and losslessness
ICDT'05 Proceedings of the 10th international conference on Database Theory
The dichotomy of list homomorphisms for digraphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On counting homomorphisms to directed acyclic graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
The structure of tractable constraint satisfaction problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Systems of equations over finite semigroups and the #CSP dichotomy conjecture
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
The core of a countably categorical structure
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Quantified constraint satisfaction, maximal constraint languages, and symmetric polymorphisms
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
A dichotomy theorem for typed constraint satisfaction problems
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Complexity of counting CSP with complex weights
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Robust satisfiability of constraint satisfaction problems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The complexity of surjective homomorphism problems-a survey
Discrete Applied Mathematics
Efficient rule-based inferencing for OWL EL
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Survey: Colouring, constraint satisfaction, and complexity
Computer Science Review
Locally constrained graph homomorphisms-structure, complexity, and applications
Computer Science Review
SIAM Journal on Discrete Mathematics
Meditations on quantified constraint satisfaction
Logic and Program Semantics
Constraint optimization problems and bounded tree-width revisited
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Near Unanimity Constraints Have Bounded Pathwidth Duality
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Lower Bounds for Existential Pebble Games and k-Consistency Tests
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Computing vertex-surjective homomorphisms to partially reflexive trees
Theoretical Computer Science
Counting homomorphisms via hypergraph-based structural restrictions
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
A dichotomy theorem for homomorphism polynomials
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Tractable triangles and cross-free convexity in discrete optimisation
Journal of Artificial Intelligence Research
Combinatorial proof that subprojective constraint satisfaction problems are NP-complete
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
NP by means of lifts and shadows
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Qualitative temporal and spatial reasoning revisited
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Universal algebra and hardness results for constraint satisfaction problems
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Maximal infinite-valued constraint languages
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Affine systems of equations and counting infinitary logic
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Datalog and constraint satisfaction with infinite templates
Journal of Computer and System Sciences
The complexity of approximating bounded-degree Boolean #CSP
Information and Computation
Containment, equivalence and coreness from CSP to QCSP and beyond
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Syntactically characterizing local-to-global consistency in ORD-Horn
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable
Theoretical Computer Science
Computational complexity of linear constraints over the integers
Artificial Intelligence
Query processing under GLAV mappings for relational and graph databases
Proceedings of the VLDB Endowment
The complexity of conservative valued CSPs
Journal of the ACM (JACM)
The fine classification of conjunctive queries and parameterized logarithmic space complexity
Proceedings of the 32nd symposium on Principles of database systems
Semantic acyclicity on graph databases
Proceedings of the 32nd symposium on Principles of database systems
Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP
Proceedings of the 32nd symposium on Principles of database systems
Reducing examples in relational learning with bounded-treewidth hypotheses
NFMCP'12 Proceedings of the First international conference on New Frontiers in Mining Complex Patterns
A complete dichotomy rises from the capture of vanishing signatures: extended abstract
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
The complexity of finite-valued CSPs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
The power of linear programming for finite-valued CSPs: a constructive characterization
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Graph partitions with prescribed patterns
European Journal of Combinatorics
Obstructions to locally injective oriented improper colourings
European Journal of Combinatorics
The complexity of the counting constraint satisfaction problem
Journal of the ACM (JACM)
Constraint satisfaction tractability from semi-lattice operations on infinite sets
ACM Transactions on Computational Logic (TOCL)
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
Journal of the ACM (JACM)
Robust Satisfiability for CSPs: Hardness and Algorithmic Results
ACM Transactions on Computation Theory (TOCT)
Constraint Satisfaction Problems Solvable by Local Consistency Methods
Journal of the ACM (JACM)
Constraints, MMSNP and expander relational structures
Combinatorica
Semilattice polymorphisms and chordal graphs
European Journal of Combinatorics
Hi-index | 0.03 |
This paper starts with the project of finding a large subclass of NP which exhibits a dichotomy. The approach is to find this subclass via syntactic prescriptions. While the paper does not achieve this goal, it does isolate a class (of problems specified by) "monotone monadic SNP without inequality" which may exhibit this dichotomy. We justify the placing of all these restrictions by showing, essentially using Ladner's theorem, that classes obtained by using only two of the above three restrictions do not show this dichotomy. We then explore the structure of this class. We show that all problems in this class reduce to the seemingly simpler class CSP. We divide CSP into subclasses and try to unify the collection of all known polytime algorithms for CSP problems and extract properties that make CSP problems NP-hard. This is where the second part of the title, "a study through Datalog and group theory," comes in. We present conjectures about this class which would end in showing the dichotomy.