Compact representation of sets of binary constraints

Frontiers in Artificial Intelligence and Applications

Volumn 141, Issue , 2006, Pages 143-147

  Rintanen, Jussi ^a  

^a CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

MODEL CHECKING; PROBLEM SOLVING;

AI PLANNING; BICLIQUE; BINARY CONSTRAINTS; COMPACT REPRESENTATION; COMPUTER-AIDED VERIFICATIONS; LITERALS; MODEL CHECKING PROBLEM; PLANNING PROBLEM; PROPOSITIONAL FORMULAS; REAL-WORLD PROBLEM;

GRAPH THEORY;

EID: 84886004323     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Article

References (16)

1. Carlos Ansótegui and Felip Manya, 'Mapping problems with finitedomain variables into problems with Boolean variables', in SAT 2004 - Theory and Applications of Satisfiability Testing: 7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers, eds., Holger Hoos and David G. Mitchell, number 3542 in Lecture Notes in Computer Science, pp. 1-15. Springer-Verlag, (2005).
2. Armin Biere, Alessandro Cimatti, Edmund M. Clarke, and Yunshan Zhu, 'Symbolic model checking without BDDs', in Tools and Algorithms for the Construction and Analysis of Systems, Proceedings of 5th International Conference, TACAS'99, ed., W. R. Cleaveland, volume 1579 of Lecture Notes in Computer Science, pp. 193-207. Springer-Verlag, (1999).
3. Avrim L. Blum and Merrick L. Furst, 'Fast planning through planning graph analysis', Artificial Intelligence, 90(1-2), 281-300, (1997).
4. B. M. W. Cheng, K. M. F. Choi, J. H. M. Lee, and J. C. K. Wu, 'Increasing constraint propagation by redundant modeling: an experience report', Constraints, 4, 167-192, (1999).
5. Alan M. Frisch and Timothy J. Peugniez, 'Solving non-Boolean satisfiability problems with stochastic local search', in Proceedings of the 17th International Joint Conference on Artificial Intelligence, ed., Bernhard Nebel, pp. 282-288. Morgan Kaufmann Publishers, (2001).
6. M. R. Garey and D. S. Johnson, Computers and Intractability, W. H. Freeman and Company, San Francisco, 1979.
7. Enrico Giunchiglia, Joohyung Lee, Vladimir Lifschitz, Norman Mc-Cain, and Hudson Turner, 'Nonmonotonic causal theories', Artificial Intelligence, 49-104, (2004).
8. Dorit S. Hochbaum, 'Approximating clique and biclique problems', Journal of Algorithms, 29, 174-200, (1998).
9. R.M. Karp, 'Reducibility among combinatorial problems', in Complexity of Computer Computations, eds., R.E. Miller and J.W. Thatcher, pp. 85-103. Plenum Press, (1972).
10. Henry Kautz and Bart Selman, 'Planning as satisfiability', in Proceedings of the 10th European Conference on Artificial Intelligence, ed., Bernd Neumann, pp. 359-363. John Wiley & Sons, (1992).
11. Henry Kautz and Bart Selman, 'Pushing the envelope: planning, propositional logic, and stochastic search', in Proceedings of the 13th National Conference on Artificial Intelligence and the 8th Innovative Applications of Artificial Intelligence Conference, pp. 1194-1201. AAAI Press, (August 1996).
12. René Peeters, 'The maximum edge biclique problem is NP-complete', Discrete Applied Mathematics, 131(3), 651-654, (2003).
13. Jussi Rintanen, 'A planning algorithm not based on directional search', in Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR '98), eds., A. G. Cohn, L. K. Schubert, and S. C. Shapiro, pp. 617-624. Morgan Kaufmann Publishers, (June 1998).
14. Jussi Rintanen, Keijo Heljanko, and Ilkka Niemelä, 'Planning as satisfiability: parallel plans and algorithms for plan search', Report 216, Albert-Ludwigs-Universität Freiburg, Institut für Informatik, (2005).
15. Barbara. M. Smith, K. Stergiou, and T. Walsh, 'Using auxiliary variables and implied constraints to model non-binary problems', in Proceedings of the 17th National Conference on Artificial Intelligence (AAAI-2000) and the 12th Conference on Innovative Applications of Artificial Intelligence (IAAI-2000), pp. 182-187. AAAI Press, (2000).
16. M. Yannakakis, 'Node- and edge-deletion NP-complete problems', in Proceedings of the Tenth Annual ACM Symposium on the Theory of Computing, pp. 253-264. The Association for Computing Machinery, (1978).