Some computational aspects of distance-sat

Journal of Automated Reasoning

Volumn 37, Issue 4, 2006, Pages 231-260

  Bailleux, Olivier ^a   Marquis, Pierre ^b  

^a UNIVERSITÉ DE BOURGOGNE   (France)

^b UNIVERSITÉ D'ARTOIS   (France)

Author keywords

Computational complexity; Satisfiability

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DECISION MAKING; MATHEMATICAL MODELS; PROBLEM SOLVING;

DECISION PROBLEMS; DISTANCE-SAT;

ARTIFICIAL INTELLIGENCE;

EID: 33847285607     PISSN: 01687433     EISSN: 15730670     Source Type: Journal    
DOI: 10.1007/s10817-006-9063-9     Document Type: Article

References (41)

1. Bacchus, F.: The 2000 AI planning systems competition. Artif. Intell. Mag. 22(3), 47-56 (2001)
2. th International Conference on Principles and Practice of Constraint Programming (CP'03). Lecture Notes in Computer Science, vol. 2833, pp. 108-122, Kinsale (Ireland). Springer, Berlin Heidelberg New York (2003)
3. th Annual Symposium on Theoretical Aspects of Computer Science (STACS'94). Lecture Notes in Computer Science, vol. 775, pp. 71-84, Caen (France). Springer, Berlin Heidelberg New York (1994)
4. Bessiere, C., Regin, J.-C.: Refining the basic constraint propagation algorithm. In: Proceedings of IJCAI01, pp. 309-315 (2001)
5. th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU'00), pp. 1405-1412, Madrid (Spain) (2000)
6. Bockmayr, A.: Solving pseudo-boolean constraints. In: Constraint Programming: Basics and Trends. Lecture Notes in Computer Science, vol. 910, pp. 22-38. Springer, Berlin Heidelberg New York (1995)
7. Chabrier, J., Juliard, V., Chabrier, J.J.: SCORE(FD/B): an efficient complete local-based search method for satisfiability problems. In: Proceedings of the CP'95 Workshop on Solving Really Hard Problems, pp. 25-30, Cassis (France) (1995)
8. th International Joint Conference on Artificial Intelligence (IJCAI'91), pp. 331-337, Sydney (1991)
9. Chvátal, V., Szemerédi, E.: Many hard examples for resolution. J. ACM 35(4), 759-768 (1988)
10. Crawford, J.M., Auton, L.D.: Experimental results on the crossover point in random 3SAT. Artif. Intell. 81, 31-57 (1996)
11. th National Conference on Artificial Intelligence (AAAI'88), pp. 475-479, St Paul (MN) (1988)
12. th International Joint Conference on Artificial Intelligence (IJCAI'99), pp. 175-182, Seattle (WA) (2001)
13. th International Joint Conference on Artificial Intelligence (IJCAI'99), pp. 284-289, Stockholm (Sweden) (1999)
14. Darwiche, A.: Decomposable negation normal form. J. ACM 48(4), 608-647 (2001)
15. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Commun. ACM 5, 394-397 (1962)
16. Dubois, O., André, P., Boufkhad, Y., Carlier, J.: SAT versus UNSAT, pp. 415-436. Second DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society (1996)
17. Dubois, D., Esteva, F., Garcia, P., Godo, L., Prade, H.: A logical approach to interpolation based on similarity relations. Int. J. Approx. Reason. 17(1), 1-36 (1997)
18. th International Conference on Theory and Application of Satisfiability Testing. Lecture Notes in Computer Science, vol. 2919, pp. 502-518. Springer, Berlin Heidelberg New York (2004)
19. th International Joint Conference on Artificial Intelligence (IJCAI'89), pp. 1273-1278, Detroit (MI) (1989)
20. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of N P-Completeness. Freeman (1979)
21. th National Conference on Artificial Intelligence (AAAI'98), pp. 334-339, Madison (WI) (1998)
22. Goldberg, E., Novikov, Y.: Berkmin: a fast and robust SAT-solver. In: Proceedings of the Design, Automation and Test in Europe Conference (DATE'02), pp. 142-149, Paris (2002)
23. th National Conference on Artificial Intelligence (AAAI'05), pp. 372-377 (2005)
24. Karp, R.M.: Reducibility Among Combinatorial Problems, Chapter Complexity of Computer Computations, pp. 85-103. Plenum Press, New York (1972)
25. th International Conference on Knowledge Representation and Reasoning (KR'96), pp. 374-384 (1996)
26. th International Conference on Principles of Knowledge Representation and Reasoning (KR'98), pp. 488-498, Trento (Italy) (1998)
27. th International Conference on Knowledge Representation and Reasoning (KR'00), pp. 457-468, Breckenridge (C0) (2000)
28. th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU'01), pp. 48-59, Toulouse (France) (2001)
29. th International Joint Conference on Artificial Intelligence (IJCAI'97), pp. 366-371, Nagoya (Japan) (1997)
30. Liberatore, P., Schaerf, M.: Reducing belief revision to circumscription (and vice versa). Artif. Intell. 93(1-2), 261-296 (1997)
31. rd international planning competition: results and analysis. Int. J. Approx. Reason. 20, 1-59 (2003)
32. Marquis, P.: Consequence finding algorithms. In: Handbook for Uncertain and Defeasible Reasoning, Chapter Algorithms for Uncertain and Defeasible Reasoning, vol. 5, pp. 41-145. Kluwer Academic Publishers (2000)
33. Nadel, A.: The Jerusat SAT Solver. Master's thesis, Hebrew University of Jerusalem (2002)
34. Reiter, R.: A theory of diagnosis from first principles. Artif. Intell. 32, 57-95 (1987)
35. Roy, A., Wilson, Ch.: Supermodels and closed sets. Electronic Colloquium on Computational Complexity (ECCC), TR00-010 (2000)
36. th International Joint Conference on Artificial Intelligence (IJCAI'97), pp. 50-54 (1997)
37. th International Conference on Principles and Practice of Constraint Programming (CP'05). Lecture Notes in Computer Science, vol. 3709, pp. 827-831, Sitges (Spain). Springer, Berlin Heidelberg New York (2005)
38. th International Symposium on the Theory and Applications of Satisfiability Testing (SAT'02), Cincinnati (OH) (2002)
39. th European Conference on Artificial Intelligence (ECAI'00), pp. 123-127, Berlin (Germany) (2000)
40. th International Conference on Logic Programming (ICLP'91), pp. 745-749, Paris (France) (1991)
41. Warners, J.P.: A linear-time transformation of linear inequalities into conjunctive normal form. Inf. Process. Lett. 68(2), 63-69 (1998)