Skip to main content
SpringerLink
Log in

Dealing with Satisfiability and n-ary CSPs in a Logical Framework

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

We investigate in this work a generalization of the known CNF representation that we call General Normal Form (GNF) and extend the resolution rule of Robinson to design a new sound and complete resolution proof system for the GNF. We show that by using a cardinality operator in the GNF we obtain the new representation CGNF that allows a natural and efficient Boolean encoding for n-ary finite discrete extensional CSPs. We prove that the space complexity of a CSP encoded in the CGNF is identical to its space complexity when it is expressed in the classical CSP representation. We prove that the generalized resolution rule applies for the CGNF encoding and introduce a new inference rule whose application until saturation achieves arc-consistency in a linear time complexity for n-ary CSP expressed in the CGNF encoding. Two enumerative methods for solving CSP instances encoded in this Boolean framework are studied: the first one (equivalent to MAC in CSPs) maintains full arc-consistency at each node of the search tree while the second (equivalent to FC in CSPs) performs partial arc-consistency on each node. Both methods are experimented and compared on some instances of the Ramsey problem, randomly generated 3/4-ary CSPs and promising results are obtained. We also adapted the notion of clause learning defined in SAT for the CGNF encoding. Finally, we show how the proposed inference rule can be used to achieve Path-consistency in the case of binary CSPs encoded in CGNF, and how it can be used to enforce strong path consistency when it is combined with the generalized resolution rule.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Audemard, G., Bordeaux, L, Hamadi, Y., Jabbour, S., Sais, L.: A generalized framework for conflict analysis. In: Eleventh International Conference on Theory and Applications of Satisfiability Testing (SAT’08), pp. 21–27 (2008)

  2. Benhamou, B., Saïs, L., Siegel, P.: Two proof procedures for a cardinality based language in propositional calculus. In: STACS, pp. 71–82 (1994)

  3. Bennaceur, H.: The satisfiability problem regarded as constraint satisfaction problem. In: Proceedings of the European Conference on Artificial Intelligence (ECAI’96), pp. 155–159 (1996)

  4. Bessière, C., Regin, J.: Arc consistency for general constraint networks: preliminary results. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI’97), pp. 398–404 (1997)

  5. Bessière, C., Regin, J.: Refining the basic constraint propagation algorithm. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI’01), pp. 309–315 (2001)

  6. Bessière, C., Meseguer, P., Freuder, E.C., Larrosa, J.: On forward checking for non-binary constraint satisfaction. J. Artif. Intell. 141, 205–224 (2002)

    Article  MATH  Google Scholar 

  7. Bessière, C., Hebrard, E., Walsh, T.: Local consistency in sat. In: Selected Revised Papers from SAT’03. LNCS, vol. 2919, pp. 299–314. Springer (2003)

  8. Cheng, K.C., Yap, R.H.: Maintaining generalized arc consistency on ad hoc r-ary constraints. In: Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming (CP’08), pp. 509–523. Springer, Sydney, Australia (2008)

    Chapter  Google Scholar 

  9. Davis, M., Putnam, H.: A computing procedure for quantification theory. J. ACM 7, 201–215 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  10. Debruyne, R., Bessière, C.: Some practicable filtering techniques for the constraint satisfaction problem. In: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence IJCAI 1997, pp. 412–417 (1997)

  11. Debruyne, R., Bessière, C.: Optimal and suboptimal singleton arc consistency algorithms. In: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence IJCAI 2005, pp. 54–59 (2005)

  12. Eén, N., Sörensson, N.: An extensible sat-solver. In: Giunchiglia, E., Tacchella, A. (eds.) In: Proceeding of the 6th International Conference on Theory and Applications of Satisfiability Testing (SAT’03). Lecture Notes in Computer Science, vol. 2919, pp. 502–518. Springer (2003)

  13. Galil, Z.: On the validity and complexity of bounded resolution. In: Proceedings of Seventh Annual ACM Symposium on Theory of Computing, pp. 72–82 (1975)

  14. Gent, I., Walsh, T.: Csplib: a benchmark library for constraints. Tech. rep., technical report APES-09-1999. A shorter version appears in the Proceedings of the 5th International Conference on Principles and Practices of Constraint Programming (CP-99) (1999). http://csplib.cs.strath.ac.uk/

  15. Gent, I., MacIntyre, E., Prosser, P., Smith, B., Walsh, T.: Random constraints: flaws and structure. Constraints 6(4), 345–372 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  16. Gent, I.P.: Arc consistency in sat. In: Proceedings of the European Conference on Artificial Intelligence (ECAI’02), pp. 121–125 (2002)

  17. Gent, I.P., Jefferson, C., Miguel, I., Nightingale, P.: Data structures for generalised arc consistency for extensional constraints. In: Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence (AAAI’07), pp. 191–197. AAAI Press, Vancouver, British Columbia, Canada (2007)

    Google Scholar 

  18. Goldberg, E., Novikov, Y.: Berkmin: a fast and robust sat solver. In: Proceedings of the 2002 Design Automation and Test in Europe, pp. 142–149 (2002)

  19. Haralick, R., Elliott, G.: Increasing tree search efficiency for constraint satisfaction problems. J. Artif. Intell. 14, 263–313 (1980)

    Article  Google Scholar 

  20. Kasif, S.: On the parallel complexity of discrete relaxation in constraint satisafaction networks. J. Artif. Intell. 45, 275–286 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  21. Katsirelos, G., Walsh, T.: A compression algorithm for large arity extensional constraints. In: Bessiere, C. (ed.) Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming (CP’07). Lecture Notes in Computer Science, vol. 4741, pp. 379–393. Springer (2007)

  22. Kleer, J.D.: A comparison of atms and csp techniques. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI’89), pp. 290–296 (1989)

  23. Lecoutre, C., Szymanek, R.: Generalized arc consistency for positive table constraints. In: Benhamou, F. (ed.) Proceedings of the 12th International Conference on Principles and Practice of Constraint Programming (CP’2006). Lecture Notes in Computer Science, pp. 284–298. Springer (2006)

    Google Scholar 

  24. Li, C.M., Anbulagan, X.: Heuristics based on unit propagation for satisfiability problems. In: Proceedings of 15th International Joint Conference on Artificial Interlligence (IJCAI’97), Japan, pp. 366–371 (1997)

  25. Malik, S., Zhao, Y., Madigan, C.F., Zhang, L., Moskewicz, M.W.: Chaff: engineering an efficient sat solver. In: Proceedings of the 38th Conference on Design Automation (IEEE 2001), pp. 530–535 (2001)

  26. Mohr, R.: A correct path consistency algorithm and an optimal generalized arc consistency algorithm. Rapport CRIN 87-R-030 (1987)

  27. Montanari, U.: Networks of constraints: fundamental properties and application to picture processing. J. Inf. Sci. 9(2), 95–132 (1974)

    MathSciNet  Google Scholar 

  28. Palmer, E.M.: Graphical evolution. Willey (1985)

  29. Prosser, P., Stergiou, K., Walsh, T.: Singleton consistencies. In: Proceedings of the Sixth International Conference on Principles and Practice of Constraint Programming CP’00, pp. 353–368 (2000)

  30. Robison, J.: A machine oriented logic based on the resolution principle. J. ACM 12(1), 23–41 (1965)

    Article  Google Scholar 

  31. Sabin, D., Freuder, E.: Understanding and improving the mac algorithm. In: Proceedings of International Conference on Principles and Practice of Constraint Programming (CP’97), pp. 167–181 (1997)

  32. Silva, J., Sakallah, K.: Grasp—a new search algorithm for satisfiability. In: Proceedings of International Conference on Computer-Aided Design (IEEE 1996), pp. 220–227 (1996)

  33. Walsh, T.: Sat v csp. In: Proceedings of International Conference on Principles and Practice of Constraint Programming (CP’00), pp. 441–456 (2000)

  34. Xu, K., Li, W.: Exact phase transitions in random constraint satisfaction problems. J. Artif. Intell. Res. 12, 93–103 (2000)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LSIS - UMR CNRS 6168, Université de Provence, Marseille, France

    Belaïd Benhamou, Lionel Paris & Pierre Siegel

Authors
  1. Belaïd Benhamou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lionel Paris
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pierre Siegel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lionel Paris.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Benhamou, B., Paris, L. & Siegel, P. Dealing with Satisfiability and n-ary CSPs in a Logical Framework. J Autom Reasoning 48, 391–417 (2012). https://doi.org/10.1007/s10817-010-9204-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10817-010-9204-z

Keywords

Search

Navigation