Pages that link to "Item:Q2946994"
From MaRDI portal
The following pages link to Building tractable disjunctive constraints (Q2946994):
Displaying 22 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- An initial study of time complexity in infinite-domain constraint satisfaction (Q514144) (← links)
- Point algebras for temporal reasoning: Algorithms and complexity (Q814509) (← links)
- The complexity of equality constraint languages (Q929295) (← links)
- Approximability of clausal constraints (Q970111) (← links)
- New tractable classes from old (Q1424765) (← links)
- Solving multi-granularity temporal constraint networks (Q1614864) (← links)
- Disjunctions, independence, refinements (Q1614865) (← links)
- Constants and finite unary relations in qualitative constraint reasoning (Q1749385) (← links)
- Domain permutation reduction for constraint satisfaction problems (Q2389649) (← links)
- Complexity of clausal constraints over chains (Q2480746) (← links)
- Complexity and approximability of quantified and stochastic constraint satisfaction problems (Q2741527) (← links)
- Schaefer's theorem for graphs (Q2796406) (← links)
- Characterizations of stable model semantics for logic programs with arbitrary constraint atoms (Q3183130) (← links)
- Satisfying constraint sets through convex envelopes (Q3429327) (← links)
- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints (Q3503848) (← links)
- On the Computational Complexity of Monotone Constraint Satisfaction Problems (Q3605505) (← links)
- Adding clauses to poor man's logic (without increasing the complexity) (Q3647233) (← links)
- (Q4535521) (← links)
- Improving IntSat by expressing disjunctions of bounds as linear constraints (Q4589125) (← links)
- Parameterized Complexity of the Workflow Satisfiability Problem (Q4689628) (← links)
- Constraint Satisfaction Problems with Infinite Templates (Q5504704) (← links)
