Smallest horn clause programs

Journal of Logic Programming

Volumn 27, Issue 3, 1996, Pages 227-267

  Devienne, P ^b   Lebegue P ^b   Parrain, A ^b   Routier, J C ^a   Wurtz J ^b  

^a UNIV LILLE   (France)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; ENCODING (SYMBOLS); ITERATIVE METHODS; LOGIC PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; THEOREM PROVING; TURING MACHINES;

APPEND LIKE PROGRAMS; BOHM-JACOPINI THEOREM; HORN CLAUSE PROGRAMS; NONTRIVIAL PROGRAM PATTERN; PROGRAM TRANSFORMATIONS;

COMPUTER SOFTWARE;

EID: 0030170118     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/0743-1066(95)00122-0     Document Type: Article

References (51)

1. Abramson, H. and Rogers, M. H. (eds.), Meta-Programming in Logic Programming, Logic Programming series, MIT Press, 1989.
2. Bibel, W., Hölldobler, S., and Würtz, J., Cycle Unification, CADE 94-108 (June 1992).
3. Böhm, C. and Jacopini, G., "Flow Diagrams, Turing Machines and Languages with Only Two Formation Rules," Communications of the ACM 9:366-371 (1966).
4. Blair, H. A., The Recursion-Theoretic Complexity of Predicate Logic as a Programming Language, Information and Control 54:25-47 (1982).
5. Bouquard, J. L., Logic Programming and Attribute Grammars, Ph.D. Thesis, Orléans 1992.
6. Bratko, I., Prolog Programming for Artificial Intelligence, Addison-Wesley, 1986.
7. Chen, H. and Hsiang, J., Recurrence Domains: Their Unification and Application to Logic Programming, Technical Report, Stony Brook (available by anonymous ftp on "sbcs.sunysb.edu"), July 1991.
8. Conway, J. H., Unpredictable Iterations, in: Proc. 1972 Number Theory Conference, University of Colorado, pp. 49-52, 1972.
9. Courcelle, B., Fundamental Properties of Infinite Trees, J. TCS 17:95-169 (1983).
10. Dauchet, M., Simulation of Turing Machines by a Regular Rewrite Rule, J. Theoretical Computer Science 103:409-420 (1982).
11. Dauchet, M., Devienne, P., and Lebègue, P., Weighted Graphs: A Tool for Logic Programming, in: 11th CAAP86, 1986.
12. Dauchet, M., Devienne, P., and Lebègue, P., Weighted Systems of Equations, Informatika 91, Grenoble, Special Issue of TCS (1991).
13. Delahaye, J.-P., Semantique Logique et Dénotationnelle des Interpréteurs Prolog, Informatique Théorique et Applications 22(1):3-42 (1988).
14. De Schreye, D., Verschaetse, K., and Bruynooghe, M., A Practical Technique for Detecting Nonterminating Queries for a Restricted Class of Horn Clauses, Using Directed Weighted Graphs, in: Proc. ICLP'90, Jerusalem, MIT Press, June 1990, pp. 649-663.
15. De Schreye, D. and Decorte, S., Termination of Logic Programs: The Never-Ending Story, J. Logic Programming (1994).
16. Devienne, P., Les Graphes Orientés Pondérés: Un Outil pour l'étude de la Terminaison et de la Complexité dans les Systèmes de Réécritures et en Programmation Logique, Ph.D. Thesis, Lille, 1987.
17. Devienne, P., Weighted Graphs - Tool for Studying the Halting Problem and Time Complexity in Term Rewriting Systems and Logic Programming, J. Theoretical Computer Science 75:157-215 (1990).
18. Devienne, P., Lebègue, P., and Routier, J. C., Weighted Systems of Equations Revisited, in: Analyse Statique, Actes WSA'92, Bordeaux, BIGRE 81-82, Sept. 1992, pp. 163-173.
19. Devienne, P., Lebègue, P., and Routier, J. C., Halting Problem of One Binary Horn Clause is Undecidable, in: Proc. STACS'93, Würzburg, Springer-Verlag, Feb. 1993.
20. Devienne, P., Lebègue, P., and Routier, J. C., The Emptiness Problem of One Binary Recursive Horn Clause is Undecidable, in Proc. ILPS'93, Vancouver, MIT Press, Nov. 1993, pp. 250-265.
21. Devienne, P., Lebègue, P., Routier, J. C., and Würtz, J., One Binary Horn Clause is Enough, in: Proc. STACS'94, Caen, Springer-Verlag, Feb. 1994, pp. 21-32.
22. Devienne, P., Lebègue, P., Parrain, A., Routier, J. C., and Würtz, J., Smallest Horn Clause Programs (extended), Technical Report, LIFL, June 1995.
23. Goldfarb, W. and Lewis, H. R., The Decision Problem for Formulas with a Small Number of Atomic Subformulas, J. Symbolic Logic 38(3):471-480 (1973).
24. Gaifman, H. and Mairson, H., Undecidable Optimisation Problems for Database Logic Programs, in: Symp. on Logic in Computer Science, New York, 1987, pp. 106-115.
25. Gallagher, J. and Bruynooghe, M., Some Low-Level Source Transformations for Logic Programs, in: Proc. 2nd Workshop on Meta-Programming in Logic, Leuven, Belgium, Apr. 1990, pp. 229-244.
26. Guy, R. K., Conway's Prime Producing Machine, Mathematics Magazine, 56:26-33 (1983).
27. Harel, D., On Folk Theorems, Commun. ACM 7:379-389 (1980).
28. Hanschke, P. and Würtz, J., Satisfiability of the Smallest Binary Program, Inform. Processing Lett. 45(5):237-241 (Apr. 1993).
29. Hansson, Å. and Tärnlund, S. Å., Program Transformation by Data Structure Mapping, in: Logic Programming, K. L. Clark and S. Å. Tärnlund (eds.), APIC Studies in Data Processing, Academic Press, 1982, pp. 117-122.
30. Lagarias, J. C., The 3x + 1 Problem and Its Generalizations, Amer. Math Monthly 92:3-23 (1985).
31. Lagarias, J. C., Annotated Bibliography on Collatz Problem," Private Communication, 1992.
32. Lebègue, P., Contribution à l'Etude de la Programmation Logique par les Graphes Orientés Podérés, Ph.D. Thesis, Lille, 1988.
33. Lewis, H. R., The Decision Problem for Formulae with a Bounded Number of Atomic Subformulae, Notices Amer. Math. Soc. 20 (1973).
34. Lloyd, J. W., Foundations of Logic Programming (2nd, ext. ed.), Springer-Verlag, 1987.
35. Marcinkowski, J., A Horn Clause that Implies an Undecidable Set of Horn Clauses, Private Communication, 1993.
36. Marcinkowski, J. and Pacholski, L., Undecidability of the Horn-Clause Implication Problem, in: FOCS, 1992.
37. Marcinkowski, J., The 3 Frenchmen Method Proves Undecidability of the Uniform Boundedness for Single Recursive Rule Ternary DATALOG Programs, Submitted (1995).
38. Marcinkowski, J., Undecidability of Uniform Boundedness for Single Rule Datalog Programs, Submitted (1995).
39. Minsky, M., Computation: Finite and Infinite Machines, Prentice-Hall, 1967.
40. Parrain, A., Transformations de Programmes Logiques et Sémantique Opérationnelle, Ph.D. Thesis, Lille, Feb. 1994.
41. Parrain, A., Devienne, P., and Lebègue, P., Prolog Programs Transformations and Meta-Interpreters, in: Logic Program Synthesis and Transformation, LOP-STR'91, Manchester, Springer-Verlag, 1991, pp. 228-241.
42. Post, E. M., A Variant of a Recursively Unsolvable Problem, Bulletin Amer. Math. Soc. 46:264-268 (1946).
43. Rogers, H., Theory of Recursive Functions and Effective Computability, MIT Press, 1987.
44. Routier, J. C., Termination, Satisfiability and Computational Power of One Binary Horn Clause, Ph.D. thesis, Lille, Feb. 1994.
45. Salzer, G., Solvable Classes of Cycle Unification Problems, in: IMYCS, Smolenice (CSFR), 1992.
46. Shmueli, O., A Single Recursive Predicate is Sufficient for Pure Datalog, Inform. and Computation 117:91-97.
47. Schmidt-Schauß, M., Implication of Clauses is Undecidable, J. Theoretical Comput. Sci. 59:287-296 (1988).
48. Tamaki, H. and Sato, T., Unfold/Fold Transformation of Logic Programs, in: S.-Å. Tärnlund (ed.), 2nd Int. Logic Programming Conf., Uppsala, 1984, pp. 127-138.
49. Tärnlund, S. Å., Horn Clause Computability, BIT 172:215-226 (1977).
50. Vardi, M., Decidability and Undecidability Results for Boundedness of Linear Recursive Queries, in: Symp.. Principles of Database Systems, Austin, TX, 1988, pp. 341-351.
51. Würtz, J., Unifying Cycles, in: Proc. European Conf. on Artificial Intelligence, Aug. 1992, pp. 60-64.