Termination detection in logic programs using argument sizes

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 1991, Pages 216-226

  Sohn, Kirack ^a   Van Gelder, Allen ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; DATABASE SYSTEMS; LINEAR PROGRAMMING; MATHEMATICAL TRANSFORMATIONS;

AUTOMATED TERMINATION; DUALITY THEORY; LINEAR COMBINATIONS; MUTUAL RECURSION; PROCEDURAL LANGUAGES; RECURSIVE RULES; SYNTACTIC TRANSFORMATIONS; TERMINATION DETECTION;

LOGIC PROGRAMMING;

EID: 85026774552     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/113413.113433     Document Type: Conference Paper

References (16)

1. F . Afrati, C . Papadimitriou, G . Papageorgiou, A.R. Roussou, Y. Sagiv, and J.D . Ullman . On the convergence of query evaluation . Journal of Computer and System Sciences, 38 (2): 341-359, 1989.
2. A. Brodsky and Y. Sagiv. Inference of monotonicity constraints in Datalog programs. In Eighth ACM Symposium on Principles of Database Systems, pages 190-199, 1989.
3. A . Brodsky and Y. Sagiv. On termination of Data log pr ograms . I n First International Conference on Deductive and Object-Oriented Databases, pages 95-112, Kyoto, Japan, 1989 .
4. A . Brodsky and Y. Sagiv. Inference of inequality constraints in logic programs . I n Tenth ACM Symposium on Principles of Database Systems, 1990.
5. B. C. Eaves and U. G. Rothblum. Elimination of quantifiers of linear variables and correspondmg transfer prmciples. lechnical Report Operations Research, Stanford University, 1987.
6. J.-L. Lassez. Querying constraints. In Ntnth ACM Symposium on Principles of Database Systems, pages 288-298, 1990.
7. J.-L. Lassez, H. Huynh, and K. McAloon. Simplification and elimination of redundant linear arithmetic constraints. In North American Conf. on Logic Programming, pages 37-51, 1989.
8. L. Naish. Automatic generation of control for logic programs. Technical Report 83/6, Dept. of Computer Science, University of Melbourne, Melbourne, Australia, 1983.
9. L. Pliimer . Termination Proofs for Logic Programs, volume 44 6 of Lecture Notes in Artificial Intelligence. S pringer - Verlag, 1990.
10. C.H. Papadimitriou and K. Steiglitz . Combinatorial Optimization. Prentice - Hall, Englewood Cliffs, N , 1982.
11. A. Schrijver. Theory of Linear and Integer Programming. Wiley, New York, 1986.
12. Y. Sagiv and J. D. Ullman . Complexity of a top-down capture rule. Technical Report STAN-CS-84-1009, Stanford University, 1984.
13. J.D . Ullman . Implementation of logical query language s for databases. ACM Transactions on Database Systems, 10 (3): 289 -321, 1985.
14. J.D. Ullman and A. Van Gelder. Efficient tests for top-d own termination of logical rules. Journal of the ACM, 35 (2): 345-373, 1988.
15. A. Van Gelder. Deriving constraints among argument sizes in logic programs. Annals of Mathematics and Artificial Intelligence, (to appear), 1990. Available as UCSC-CRL - 89-41. Extended abstract appears in Ninth A C M Symposium on Principles of Database Systems, 1990.
16. C. Walther. Automated Termination Proofs. PhD thesis. University of Karlsruhe, 1988.