Decidability of logic program semantics and applications to testing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1140, Issue , 1996, Pages 347-362

  Ruggieri, Salvatore ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; BLACK-BOX TESTING; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL LINGUISTICS; COMPUTER CIRCUITS; FORMAL METHODS; LOGIC PROGRAMMING; RECONFIGURABLE HARDWARE; SEMANTICS; SOFTWARE TESTING;

BLACK BOXES; DECIDABILITY PROBLEMS; DECISION PROCEDURE; FINITE SET; FORMAL SEMANTICS; HERBRAND MODEL; LOGIC PROGRAM SEMANTICS; META-PREDICATES;

PROLOG (PROGRAMMING LANGUAGE);

EID: 84957610639     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61756-6_96     Document Type: Conference Paper

References (18)

1. K.R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 493-574. Elsevier, 1990.
2. K.R. Apt, M. Gabbrielli, and D. Pedreschi. A Closer Look at Declarative Interpretations. Technical Report CS-R9470, Centre for Mathematics and Computer Science, Amsterdam, 1994. To appear in Journal of Logic Programming.
3. K.R. Apt and E. Marchiori. Reasoning about Prolog programs: from modes through types to assertions. Formal Aspects of Computing, 6A:743-764, 1994.
4. K.R. Apt and D. Pedreschi. Studies in Pure Prolog: Termination. In J. W. Lloyd, editor, Symposium on Computational Logic. Springer-Verlag, Berlin, 1990.
5. A. Bossi, M. Gabbrielli, G. Levi, and M. Martelli. The 5-semantics Approach: Theory and Applications. Journal of Logic Programming, 19,20:149-197, 1994.
6. L. Bougè, N. Choquet, L. Fribourg, and M. Gaudel. Test sets generation from algebraic specifications using logic programming. Journal of System and Software, 6(4), 1986.
7. M. Bruynooghe. A Practical Framework for the Abstract Interpretation of Logic Programs. New Generation Computing, 10(2):91-124, 1991.
8. K.L. Clark. Predicate logic as a computational formalism. Technical Report DOC 79/59, Imperial College, Dept, of Computing, 1979.
9. M. Comini, G. Levi, and G. Vitiello. Efficient detection of incompleteness errors in the abstract debugging of logic programs. In AADEBUG'95, 1995.
10. M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. A Model-Theoretic Reconstruction of the Operational Semantics of Logic Programs. Information and Computation, 102(1): 86-113, 1993.
11. M. Gorlick, C.F. Kesselman, D. Marotta, and D. Stott Parker. MOCKINGBIRD: A Logical Methodology for Testing. Journal of Logic Programming, 8(1,2), 1990.
12. G. Levi and D. Ramundo. A Formalization of Metaprogramming for Real. In D.S. Warren, editor, Proceedings Tenth International Conference on Logic Programming, pages 354-373. The MIT Press, 1993.
13. L. Naish. Declarative Diagnosis of Missing Answers. New Generation Computing, 10:255-285, 1991.
14. D. Pedreschi and S. Ruggieri. Termination is language-independent. In M. Alpuente et. al., editor, Proc. of the GULP-PRODE'94 Joint Conference on Declarative Programming. Univ. Politecnica de Valencia, 1994.
15. D. Pedreschi and S. Ruggieri. Verification of Metainterpreters. Technical Report TR-96-23, Dipartimento di Informatica, Università di Pisa, 1996. Accepted for publication in Journal of Logic and Computation.
16. J. Shoenfield. Mathematical logic. Addison Wesdley, Reading, 1967.
17. L. Sterling and E. Shapiro. The Art of Prolog. The MIT Press, 1986.
18. J.D. Ulmann and A. van Gelder. Efficient tests for top-down termination of logical rules. Journal of the ACM, 35(2):345-373, 1988.