Decidability of logic program semantics and applications to testing

Journal of Logic Programming

Volumn 46, Issue 1, 2000, Pages 103-137

  Ruggieri, Salvatore ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL LINGUISTICS; CONFORMAL MAPPING; DIGITAL ARITHMETIC; PROGRAM COMPILERS; PROGRAM DIAGNOSTICS; PROGRAM INTERPRETERS; PROLOG (PROGRAMMING LANGUAGE); RECURSIVE FUNCTIONS;

BOUNDED LOGIC PROGRAMS; HERBRAND MODEL; LOGIC PROGRAM SEMANTICS; RECURSIVE LEVEL MAPPING;

LOGIC PROGRAMMING;

EID: 0034325983     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(99)00067-9     Document Type: Article

References (39)

1. H. Andréka, I. Németi, The generalized completeness of horn predicate logic as a programming language, Acta Cybernetica 4 (1978) 3-10.
2. K.R. Apt, M. Bezem, Acyclic programs, in: D.H.D. Warren, P. Szeredi (Eds.), Proceedings of the Seventh International Conference on Logic Programming, MIT Press, Cambridge, MA 1990, pp. 617-633.
3. K.R. Apt, D. Pedreschi, Modular termination proofs for logic and pure Prolog programs, in: G. Levi (Ed.), Advances in Logic Programming Theory, Oxford University Press, Oxford, 1994, pp. 183-229.
4. K.R. Apt, Logic programming, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. B, Elsevier, Amsterdam, 1990, pp. 493-574.
5. K.R. Apt, From Logic Programming to Prolog. CAR Hoare Series Editor, Prentice-Hall, Englewood Cliffs, NJ, 1996.
6. K.R. Apt, M. Gabbrielli, D. Pedreschi, A closer look at declarative interpretations, Journal of Logic Programming 28 (2) (1996) 147-180.
7. K.R. Apt, E. Marchiori, Reasoning about prolog programs: from modes through types to assertions, Formal Aspects of Computing A 6 (1994) 743-764.
8. K.R. Apt, D. Pedreschi, Reasoning about termination of pure prolog programs, Information and Computation 106 (1) (1993) 109-157.
9. F. Belli, O. Jack, A product assurance environment for Prolog, in: Ducassé et al. (Eds.), Proceedings of the ILPS'93 Workshop on Logic Programming Environments, LPE'93, Publication IRISA, Campus de Beaulieu, 35042 Rennes, France, 1991.
10. M.A. Bezem, Strong termination of logic programs, Journal of Logic Programming 15 (1/2) (1993) 79-98.
11. H.A. Blair, The recursion-theoretic complexity of predicate logic as a programming language, Information and Control 54 (1982) 25-47.
12. E. Börger, Unsolvable decision problems for Prolog programs, in: Computation Theory and Logic, Lecture Notes in Computer Science 270, Springer, Berlin, 1987, pp. 3-48.
13. A. Bossi, M. Gabbrielli, G. Levi, M. Martelli, The ℒ-semantics approach: theory and applications, Journal of Logic Programming 19 (20) (1994) 149-197.
14. A. Brogi, P. Mancarella, D. Pedreschi, F. Turini, Modular logic programming, ACM Transactions on Programming Languages and Systems 16 (4) (1994) 1361-1398.
15. K.L. Clark, Predicate logic as a computational formalism, Technical Report DOC 79/59, Imperial College, Department of Computing, 1979.
16. M. Comini, G. Levi, G. Vitiello, Efficent detection of incompleteness errors in the abstract debugging of logic programs, in: M. Ducassé (Ed.), Proceedings of AADEBUG'95, IRISA-CNRS, 1995, pp. 159-174.
17. R.A. De Millo, Software Testing and Evaluation, The Benjamin/Cummings, Menlo Park, CA, 1987.
18. D. De Schreye, S. Decorte, Termination of logic programs: the never-ending story, Journal of Logic Programming 19/20 (1994) 199-260.
19. P. Devienne, P. Lebègue, J.C. Routier, Halting Problem of one binary horn clause is undecidable, in: STACS '93, vol. 665 of Lecture Notes in Computer Science, Springer, Berlin, 1993, pp. 48-57.
20. M. Ducasseé, J. Noyé, Logic programming environments: dynamic program analysis and debugging, Journal of Logic Programming 1920 (1994) 351-384.
21. M. Falaschi, G. Levi, M. Martelli, C. Palamidessi, Declarative modelling of the operational behaviour of logic languages, Theoretical Computer Science 69 (3) (1989) 289-318.
22. M. Falaschi, G. Levi, M. Martelli, C. Palamidessi, A model-theoretic reconstruction of the operational semantics of logic programs, Information and Computation 103 (1) (1993) 86-113.
23. P.M. Hill, J.W. Lloyd, The Gödel Programming Language, MIT Press, Cambridge, MA, 1994.
24. O. Jack, Software Testing for Conventional and Logic Programming, W. De Gruyter, Berlin, 1996.
25. N.D. Jones, Computability and Complexity from a Programming Perspective, MIT Press, Cambridge, MA, 1997.
26. M. Kalsbeek, Y. Jiang, A vademecum of ambivalent logic, in: K.R. Apt, F. Turini (Eds.), Meta-Logics and Logic Programming, MIT Press, Cambridge, MA, 1995, pp. 27-56.
27. J.D. Kiper, Structural testing of rule-based expert systems, ACM Transactions of Software Engineering and Methodology 1 (2) (1992) 168-187.
28. J.W. Lloyd, Foundations of Logic Programming, second ed., Springer, Berlin, 1987.
29. G. Luo, G.V. Bochmann, B. Sarikaya, M. Boyer, Control-flow based testing of prolog programs, Technical Report IRO-825, Dept. d'Informatique et de Recherche Operationnelle, Université de Montreal, 1992.
30. D. Mustaro, Progetto e Realizzazione di uno Strumento per il Testing di Programmi Logici, Master's Thesis, Dipartimento di Informatica, Università di Pisa, 1998 (in Italian).
31. G.J. Myers, The Art of Software Testing, Wiley, New York, 1979.
32. D. Pedreschi, S. Ruggieri, Termination is language-independent, in: M. Alpuente et al. (Eds.), Proceedings of the GULP-PRODE'94 Joint Conference on Declarative Programming, University of Politecnica de Valencia, Valencia, 1994.
33. D. Pedreschi, S. Ruggieri, Verification of metainterpreters, Journal of Logic and Computation 7 (2) (1997) 267-303.
34. L. Plümer, Termination Proofs for Logic Programs, Lecture Notes in Artificial Intelligence 446, Springer, Berlin, 1990.
35. S. Ruggieri, Decidability of logic program semantics and applications to testing, in: Proceedings of PLILP'96, Lecture Notes in Computer Science, vol. 1140, Springer, Berlin. 1996, pp. 347-362.
36. S. Ruggieri, A complete declarative debugger of missing answers, in: C. Hankin (Ed.), Proceedings of ESOP'98, Lecture Notes in Computer Science, vol. 1381, 1998, pp. 236-251.
37. F. Saglietti, Structural testing strategies applied to knowledge-based systems, in: F.J. Belli, F. Radermacher (Eds.), Proceedings of the Fifth IEA/AIE, LNAI, vol. 604, Springer, Berlin, 1992, pp. 236-245.
38. J. Shoenfield, Mathematical Logic, Addison-Wesley, Reading, MA, 1967.
39. L. Sterling, E. Shapiro, The Art of Prolog, second ed., MIT Press, Cambridge, MA, 1994.