scientific article; zbMATH DE number 4162321
From MaRDI portal
Recommendations
Cited in
(20)- The approximation of implicates and explanations
- Local search with constraint propagation and conflict-based heuristics
- Learning to select SAT encodings for pseudo-Boolean and linear Integer constraints
- Linear resolution for consequence finding
- Using OBDDs to handle dynamic constraints
- A kind of logical compilation for knowledge bases
- Underconstrained knowledge-intensive constraint satisfaction search
- Reasoning with propositional logic: from SAT solvers to knowledge compilation
- On the relations between SAT and CSP enumerative algorithms
- \textsc{Conjure}: automatic generation of constraint models from problem specifications
- Exploiting the deep structure of constraint problems
- Local consistency in parallel constraint satisfaction networks
- Problem solving by searching for models with a theorem prover
- Structure-driven algorithms for truth maintenance
- Compiling finite linear CSP into SAT
- aspartame: solving constraint satisfaction problems with answer set programming
- Scheduling with neural networks -- the case of the Hubble Space Telescope
- The logic of constraint satisfaction
- Dealing with satisfiability and \(n\)-ary CSPs in a logical framework
- MUST: Provide a Finer-Grained Explanation of Unsatisfiability
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3489523)