Pages that link to "Item:Q5325854"
From MaRDI portal
The following pages link to Theory and Applications of Satisfiability Testing (Q5325854):
Displaying 10 items.
- Clause weighting local search for SAT (Q862404) (← links)
- Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings (Q862408) (← links)
- Programming for modular reconfigurable robots (Q1758696) (← links)
- Modelling and solving temporal reasoning as propositional satisfiability (Q2389682) (← links)
- Automated reformulation of specifications by safe delay of constraints (Q2457622) (← links)
- Generalised graph colouring by a hybrid of local search and constraint programming (Q2467347) (← links)
- Another look at graph coloring via propositional satisfiability (Q2467359) (← links)
- The state of SAT (Q2643296) (← links)
- An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems (Q3638568) (← links)
- Theory and Applications of Satisfiability Testing (Q5325869) (← links)