Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
Year of publication: |
2009
|
---|---|
Authors: | Desrosiers, Christian ; Galinier, Philippe ; Hertz, Alain ; Paroz, Sandrine |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 18.2009, 2, p. 124-150
|
Subject: | Entscheidungstheorie | Decision theory | Logik | Logic | Heuristik | Heuristics | Algorithmus | Algorithm |
-
Dietvorst, Berkeley J., (2018)
-
A fast heuristic attribute reduction approach to ordered decision systems
Du, Wen Sheng, (2018)
-
On the flexibility of a decision theory-based heuristic for single machine scheduling
Gahm, Christian, (2019)
- More ...
-
Using local search to speed up filtering algorithms for some NP-hard constraints
Galinier, Philippe, (2011)
-
Using local search to speed up filtering algorithms for some NP-hard constraints
Galinier, Philippe, (2011)
-
A reliable model for global planning of mobile networks
Adjarath Lemamou, Eunice, (2013)
- More ...