Closure properties of constraints
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Existentially restricted quantified constraint satisfaction
- Affine systems of equations and counting infinitary logic
- Maximal infinite-valued constraint languages
- The complexity of satisfiability problems: Refining Schaefer's theorem
- Minimization of locally defined submodular functions by optimal soft arc consistency
- Relatively quantified constraint satisfaction
- The SAT-UNSAT transition for random constraint satisfaction problems
- Homogeneous and strictly homogeneous criteria for partial structures
- A combinatorial constraint satisfaction problem dichotomy classification conjecture
- Constraints, consistency and closure
- Contractions of closure systems
- Learnability of quantified formulas.
- A comparison of structural CSP decomposition methods
- Fixed-parameter complexity in AI and nonmonotonic reasoning
- An efficient algorithm for a class of constraint satisfaction problems
- Binary constraint satisfaction problems defined by excluded topological minors
- Tropically convex constraint satisfaction
- On the complexity of \(\mathbb{H}\)-coloring for special oriented trees
- On tree-preserving constraints
- The power of propagation: when GAC is enough
- On bijunctive predicates over a finite set
- Implementing a test for tractability
- A new tractable class of constraint satisfaction problems
- The complexity of minimal satisfiability problems
- Closure properties and witness reduction
- The complexity of problems for quantified constraints
- Galois connections for patterns: an algebra of labelled graphs
- Optimization of a recursive conveyor by reduction to a constraint satisfaction problem
- Beyond PCSP (\textbf{1-in-3}, \textbf{NAE})
- From semantic games to provability: the case of Gödel logic
- Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs
- On Maltsev digraphs
- Isomorphic implication
- Constraint satisfaction problems over semilattice block Mal'tsev algebras
- Minimal distance of propositional models
- Constructing NP-intermediate problems by blowing holes with parameters of various properties
- Commutative idempotent groupoids and the constraint satisfaction problem.
- Domain permutation reduction for constraint satisfaction problems
- Properties of tree convex constraints
- On digraph coloring problems and treewidth duality
- Majority constraints have bounded pathwidth duality
- A complete 4-parametric complexity classification of short shop scheduling problems
- Semilattice polymorphisms and chordal graphs
- Closure-based constraints in formal concept analysis
- The complexity of soft constraint satisfaction
- Combinatorial problems raised from 2-semilattices
- Dichotomy for finite tournaments of mixed-type
- The complexity of partition functions
- Tractability in constraint satisfaction problems: a survey
- Complexity and approximability of quantified and stochastic constraint satisfaction problems
- The constraint satisfaction problem and universal algebra
- As Close as It Gets
- Robustly solvable constraint satisfaction problems
- CSP dichotomy for special polyads
- Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis
- Why is it hard to obtain a dichotomy for consistent query answering?
- On Maltsev digraphs
- On the CSP Dichotomy Conjecture
- Constraint Satisfaction Parameterized by Solution Size
- On the complexity of the model checking problem
- Constraint Satisfaction Problems Solvable by Local Consistency Methods
- Approximability of the Maximum Solution Problem for Certain Families of Algebras
- CSP dichotomy for special triads
- Constraint satisfaction problems over the integers with successor
- A Galois connection for valued constraint languages of infinite size
- Algebraic properties of valued constraint satisfaction problem
- Necessary conditions for tractability of valued CSPs
- Testing list H-homomorphisms
- scientific article; zbMATH DE number 3605521 (Why is no real title available?)
- scientific article; zbMATH DE number 1487982 (Why is no real title available?)
- Colouring, constraint satisfaction, and complexity
- A dichotomy for first-order reducts of unary structures
- The language of stratified sets is confluent and strongly normalising
- scientific article; zbMATH DE number 2152666 (Why is no real title available?)
- scientific article; zbMATH DE number 859974 (Why is no real title available?)
- Qualitative constraint satisfaction problems: an extended framework with landmarks
- Boolean max-co-clones
- Extendable partial clones on a finite set
- On m-junctive predicates on a finite set
- scientific article; zbMATH DE number 7359806 (Why is no real title available?)
- Absorption in universal algebra and CSP
- Constraint satisfaction problems over numeric domains
- Backdoor sets for CSP
- The complexity of valued CSPs
- Universal algebraic methods for constraint satisfaction problems
- scientific article; zbMATH DE number 7559384 (Why is no real title available?)
- Beyond Boolean surjective VCSPs
- Dichotomy for symmetric Boolean PCSPs
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties
- Ideal membership problem over 3-element CSPs with dual discriminator polymorphism
- Time complexity of constraint satisfaction via universal algebra
- Robust algorithms with polynomial loss for near-unanimity CSPs
- Constraint satisfaction problems for reducts of homogeneous graphs
- The power of linear programming for general-valued CSPs
- Gap theorems for robust satisfiability: Boolean CSPs and beyond
- The complexity of general-valued CSPs
- The power of Sherali-Adams relaxations for general-valued CSPs
- Binarisation for valued constraint satisfaction problems
- Tractable structures for constraint satisfaction with truth tables
- Quantified constraint satisfaction and the polynomially generated powers property
This page was built for publication: Closure properties of constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376981)
