As time goes by II: More automatic complexity analysis of concurrent rule programs

Electronic Notes in Theoretical Computer Science

Volumn 59, Issue 3, 2002, Pages 185-206

  Frühwirth, Thom ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

Complexity Analysis; Constraint Handling Rules; Constraint Solving; Cost Analysis; Derivation Length; Program Analysis; Rankings; Termination

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; COMPUTER SCIENCE; CONFORMAL MAPPING; CONSTRAINT THEORY; INTEGER PROGRAMMING; LOGIC PROGRAMMING; OPTIMIZATION; QUERY LANGUAGES; REDUNDANCY;

COMPLEXITY ANALYSIS; CONSTRAINT HANDLING RULE (CHR); CONSTRAINT SOLVING; COST ANALYSIS; DERIVATION LENGTH; PROGRAM ANALYSIS; RANKINGS; TERMINATION;

CONCURRENT ENGINEERING;

EID: 23844475859     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00288-9     Document Type: Conference Paper

References (25)

1. Applied Artificial Intelligence, Special Issue on Constraint Handling Rules (C. Holzbaur and T. Frühwirth, Eds.), Taylor & Francis, Vol 14(4), 2000.
2. S. Abdennadher and T. Frühwirth, Operational Equivalence of CHR Programs and Constraints, 5th Intl Conf on Principles and Practice of Constraint Programming (CP'99), Springer LNCS 1894, 1999.
3. S. Abdennadher, T. Frühwirth and H. Meuss, Confluence and Semantics of Constraint Simplification Rules, Constraints Journal Vol 4(2), Kluwer Academic Publishers, 1999.
4. S. Abdennadher, A Language for Experimenting with Declarative Paradigms, Second Workshop on Rule-Based Constraint Reasoning and Programming, at the 6th Intl Conf on Principles and Practice of Constraint Programming (CP'2000), Singapore, 2000.
5. F. Benhamou, Interval Constraint Logic Programming, in Constraint Programming: Basics and Trends, (A. Podelski, Ed.), Springer LNCS 910, 1995.
6. T. Frühwirth and S. Abdennadher, Essentials of Constraint Programming, Springer Verlag, Heidelberg, Germany, 2002.
7. T. Frühwirth and P. Hanschke, Terminological Reasoning with Constraint Handling Rules, in Principles and Practice of Constraint Programming, (P. van Hentenryck and V.J. Saraswat, Eds.), MIT Press, Cambridge, Mass., USA, 1995.
8. T. Frühwirth, Theory and Practice of Constraint Handling Rules, Special Issue on Constraint Logic Programming (P. J. Stuckey and K. Marriot, Eds.), Journal of Logic Programming Vol 37(1-3), Elsevier, 1998.
9. T. Frühwirth, Proving Termination of Constraint Solver Programs, in New Trends in Constraints, (K.R. Apt, A.C. Kakas, E. Monfroy and F. Rossi, Eds.), Springer LNAI 1865, 2000.
10. T. Frühwirth, On the Number of Rule Applications in Constraint Programs, Declarative Programming - Selected Papers from AGP 2000, (A. Dovier, M. C. Meo, A. Omicini, Eds.), Electronic Notes in Theoretical Computer Science (ENTCS), Vol 48, Elsevier Science Publishers, June 2001.
11. T. Frühwirth, As Time Goes by: Complexity Analysis of Simplification Rules, Workshop on Quantitative Aspects of Programming Laguages (QAPL'01), at the Conf on Principles, Logics, and Implementations of high-level programming languages (PLI'01), Firenze, Italy, September 2001.
12. T. Frühwirth, As Time Goes By: Automatic Complexity Analysis of Simplification Rules, 8th Intl Conf on Principles of Knowledge Representation and Reasoning (KR2002), Toulouse, France, April 2002.
13. H. Ganzinger and D. McAllester, A New Meta-Complexity Theorem for Bottum-up Logic Programs, (R. Gore, A. Leitsch and T. Nipkow, Eds.) First Intl Joint Conf on Automated Reasoning IJCAR 2001, Springer LNAI 2083, 2001.
14. H. Ganzinger and D. McAllester, Logical Algorithms, 18th Intl Conference on Logic Programming ICLP'02, Copenhagen, Denmark, July/August, 2002.
15. C. Holzbaur and T. Frühwirth, Constraint Handling Rules Reference Manual for Sicstus Prolog, TR-98-01, Österreichisches Forschungsinstitut für Artificial Intelligence, Vienna, Austria, July 1998.
16. C. Holzbaur and T. Frühwirth, A Prolog Constraint Handling Rules Compiler and Runtime System, Applied Artificial Intelligence, Special Issue on Constraint Handling Rules (C. Holzbaur and T. Frühwirth, Eds.), Taylor &: Francis, Vol 14(4), 2000.
17. J.-L. J. Imbert, Linear Constraint Solving in CLP-Languages, (A. Podelski, Ed.), Constraint Programming: Basics and Trends, LNCS 910, March 1995.
18. A. K. Mackworth and E. C. Freuder, The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems, Artificial Intelligence Vol 25, 1985.
19. K. Marriott and P. J. Stuckey, Programming with Constraints, MIT Press, USA, 1998.
20. D. McAllester, On the Complexity Analysis of Static Analyses, (A. Cortesi and G. File, Eds.), 6th Intl. Static Analysis Symposium (SAS'99), Springer LNCS 1694, 1999.
21. R. Mohr and T.C. Henderson, Arc and Path Consistency Revisited, Artificial Intelligence 28, 1986.
22. P. Patel-Schneider and M-C. Rousset, Eds., Special Issue on Description Logics, Journal of Logic and Computation, Volume 9, Number 3, Oxford University Press, June 1999.
23. M. Saft and S. Abdennadher, WebCHR, Ludwig-Maximilians-Universität München, www.pms.informatik.uni-muenchen.de/~webchr, as of October 2002.
24. P. Van Hentenryck, Y. Deville and C.-M. Teng, A generic arc-consistency algorithm and its specializations, Artificial Intelligence, 57(2-3):291-321, October 1992.
25. P. van Hentenryck, V. A. Saraswat, and Y. Deville, Constraint Processing in cc(FD), Chapter in Constraint Programming: Basics and Trends, (A. Podelski, Ed.), Springer LNCS 910, 1995.