Theory and Applications of Satisfiability Testing
From MaRDI portal
Publication:5325854
Recommendations
Cited in
(12)- Generalised graph colouring by a hybrid of local search and constraint programming
- The state of SAT
- Theory and Applications of Satisfiability Testing
- Automated reformulation of specifications by safe delay of constraints
- Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings
- Clause weighting local search for SAT
- Programming for modular reconfigurable robots
- scientific article; zbMATH DE number 2016108 (Why is no real title available?)
- An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems
- Modelling and solving temporal reasoning as propositional satisfiability
- Another look at graph coloring via propositional satisfiability
- scientific article; zbMATH DE number 1405442 (Why is no real title available?)
This page was built for publication: Theory and Applications of Satisfiability Testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5325854)