Situated simplification

Theoretical Computer Science

Volumn 173, Issue 1, 1997, Pages 235-252

  Podelski, Andreas ^a   Smolka, Gert ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE DFKI   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTER PROGRAMMING; OPERATIONS RESEARCH; PROBLEM SOLVING; TREES (MATHEMATICS);

CONCURRENT CONSTRAINT PROGRAMMING; DISENTAILMENT; ENTAILMENT; SIMPLIFICATION;

CONSTRAINT THEORY;

EID: 0031077037     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00197-1     Document Type: Article

References (16)

1. H. Aït-Kaci and A. Podelski, Towards a meaning of LIFE, in: J. Maluszynski and M. Wirsing, eds., Proc. 3rd Internat. Symp. on Programming Language Implementation and Logic Programming, Lecture Notes in Computer Science, Vol. 528 (Springer, Berlin, 1991) 255-274.
2. H. Aït-Kaci and A. Podelski, Functions as passive constraints in life, ACM Trans. Programming Languages Systems (TOPLAS) 16 (1994) 1279-1318.
3. H. Aït-Kaci, A. Podelski and G. Smolka, A feature-based constraint system for logic programming with entailment, Theoret. Comput. Sci. 122 (1994) 263-283.
4. K.L. Clark and S. Gregory, A relational language for parallel programming, in: Proc. ACM Conf. on Functional Programming Languages and Computer Architecture (1981) 171-178.
5. A. Colmerauer, Prolog II reference manual and theoretical model, Tech. Report, Groupe Intelligence Artificielle, Université Aix - Marseille II, October 1982.
6. B. Courcelle, Fundamental properties of infinite trees, Theoret. Comput. Sci. 25 (1983) 95-169.
7. S. Haridi and S. Janson, Kernel Andorra Prolog and its computation model, in: D.H.D. Warren and P. Szeredi, eds., Proc. 7th Internat. Conf. on Logic Programming (MIT Press, Cambridge, MA, 1990) 31-48.
8. M. Henz, M. Mehl, M. Müller, T. Müller, J. Niehren, R. Scheidhauer, C. Schulte, G. Smolka, R. Treinen and J. Würtz, The Oz Handbook, Research Report RR-94-09, Deutsches Forschungszentrum für Künstliche Intelligenz, Stuhlsatzenhausweg 3, D-66123 Saarbrücken, Germany, 1994. Available through anonymous ftp from duck.dfki.uni-sb.de.
9. M. Henz, G. Smolka and J. Würtz, Oz - a programming language for multi-agent systems, in: Ruzena Bajcsy, ed., 13th Internat. Joint Conf. on Artificial Intelligence, Vol. 1, Chambéry, France (Morgan Kaufmann, Los Altos, CA, 1993) 404-409.
10. M.J. Maher, Logic semantics for a class of committed-choice programs, in: J.-L. Lassez, ed., Proc. 4th Internat. Conf. on Logic Programming (MIT Press, Cambridge, MA, 1987) 858-876.
11. L. Naish, Automating control for logic programs, J. Logic Programming 2 (1985) 167-184.
12. L. Naish, The Mu-Prolog 3.2db reference manual, Tech. Report, Department of Computer Science, University of Melbourne, Victoria, Australia, 1985.
13. A. Podelski and P. Van Roy, The Beauty and the Beast algorithm: quasi-linear incremental tests of entailment and disentailment, in: Proc. Internat. Symp. on Logic Programming (ILPS) (MIT Press, Cambridge, MA, 1994) 359-374.
14. V. Saraswat and M. Rinard, Concurrent constraint programming, in: Proc. 17th ACM Conf. on Principles of Programming Languages, San Francisco, CA (1990) 232-245.
15. E. Shapiro, The family of concurrent logic programming languages, ACM Comput. Surveys 21 (1989) 413-511.
16. G. Smolka and R. Treinen, Records for logic programming, J. Logic Programming 18 (1994) 229-258.