Computing the frequency of partial orders

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3258, Issue , 2004, Pages 772-776

  Van Dongen, Marc R C ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT SATISFACTION PROBLEMS; CONSTRAINT THEORY;

ALL SOLUTIONS; PARTIAL ORDER; PROTOTYPE IMPLEMENTATIONS;

ALGORITHMS;

EID: 35048860439     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30201-8_64     Document Type: Article

References (7)

1. O. Angelsmark and P. Jonsson. Improved algorithms for counting solutions in constraint satisfaction problems. In F. Rossi, editor, Proceedings of the ninth International Conference on Principles and Practice of Constraint Programming (CP'2003), pages 81-95, 2003.
2. A.A. Bulatov and V. Dalmau. Towards a dichotomy for the counting constraint satisfaction problem. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS 2003), pages 272-282, 2003.
3. th National Conference on Artificial Intelligence (AAAI'94), pages 362-367, 1994.
4. M.P. Schellekens. Compositional average time analysis toward a calculus for software timing. Technical report, Centre for Efficiency Orientated Languages, 2004. In Preparation.
5. R. Sedgewick and P. Flajolet. An Introduction to the Analysis of Algorithms. Addison-Wesley Publishing Company, 1996.
6. M.R.C. van Dongen. Saving support-checks does not always save time. Artificial Intelligence Review, 2004. Accepted for publication.
7. P. Van Hentenryck. The OPL Programming Language. MIT Press, 1999.