Acceptable programs revisited

Electronic Notes in Theoretical Computer Science

Volumn 30, Issue 1, 1999, Pages 59-76

  Hitzler, Pascal ^a   Seda, Anthony Karel ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING; MAPPING; MATHEMATICAL MODELS; SEMANTICS; SET THEORY; THEOREM PROVING; TOPOLOGY;

HERBRAND MODEL; NATURAL NUMBERS; PROLOG PROGRAMS;

COMPUTER SOFTWARE;

EID: 0041392847     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00114-8     Document Type: Conference Paper

References (20)

1. Apt K.R. Program Verification and Prolog. Börger E. Specification and Validation Methods for Programming Languages and Systems. 1995;55-95 Oxford University Press
2. Apt K.R., Blair H.A., Walker A. Towards a Theory of Declarative Knowledge. Minder J. Foundations of Deductive Databases and Logic Programming. 1988;89-148 Morgan Kaufmann Publishers Inc, Los Altos
3. Apt K.R., Pedreschi D. Reasoning about Termination of Pure Prolog Programs. Information and Computation. 106:1993;109-157
4. Apt K.R., Pedreschi D. Modular Termination Proofs for Logic and Pure Prolog Programs. Levi G. Advances in Logic Programming Theory. 1994;183-229 Oxford University Press, Oxford
5. Batarekh A., Subrahmanian V.S. Topological Model Set Deformations in Logic Programming. Fundamenta Informaticae. 12:(3):1989;357-400
6. Cavedon L., Continuity, Consistency, and Completeness Properties for Logic Programs. Proceedings of the 6th International Conference on Logic Programming, Lisbon, Portugal, 1989, pp. 571-584.
7. Cavedon L. Acyclic Logic Programs and the Completeness of SLDNF-Resolution. Theoretical Computer Science. 86:1991;81-92
8. Chan D., Constructive Negation Based on the Completed Database. In: Proc. of the 5th Int. Conf. and Symp. on Logic Programming, 1988, pp. 111-125.
9. Etalle S., Bossi A., Cocco N. Termination of Well-moded Programs. J. Logic Programming. 38:1999;243-257
10. Fitting M. A Kripke-Kleene Semantics for General Logic Programs. J. Logic Programming. 2:1985;295-312
11. Fitting M. Metric Methods: Three Examples and a Theorem. J. Logic Programming. 21:(3):1994;113-127
12. Hitzler P. Topology and Logic Programming Semantics. Diplomarbeit in Mathematik. 1998;Universität Tübingen
13. Hitzler P., and Seda, A. K., Characterizations of Classes of Programs by Three-Valued Operators. In: Proceedings of the 5th International Conference of Logic Programming and Non-Monotonic Reasoning (LPNMR'99), El Paso, Texas, December, 1999. Springer Lecture Notes in Artificial Intelligence, pp. 1-15, to appear.
14. Lloyd J.W. Foundations of Logic Programming. 1988;Second Edition, Springer, Berlin
15. Marchiori E. On Termination of General Logic Programs with respect to Constructive Negation. J. Logic Programming. 26:(1):1996;69-89
16. Marchiori E., A Methodology for Proving Termination of General Logic Programs. Proc. 14th International Joint Conference on Artificial Intelligence (IJCAI'95), 1995, 356-367.
17. Seda A.K. Topology and the Semantics of Logic Programs. Fundamenta Informaticae. 24:(4):1995;359-386
18. Seda, A. K., and Hitzler P., Topology and Iterates in Computational Logic. Proceedings of the 12th Summer Conference on Topology and its Applications: Special Session on Topology in Computer Science, Ontario, August 1997. Topology Proceedings 22, Summer 1997, 427-469.
19. Seda, A. K., and Hitzler P., Strictly Level-Decreasing Logic Programs. In: A. Butterfield, and S. Flynn, (Eds.), Proceedings of the Second Irish Workshop on Formal Methods (IWFM'98), Electronic Workshops in Computing, British Computer Society, 1999, pp. 1-18.
20. Willard S. General Topology. Addison Wesley Series in Mathematics. 1970;Addison Wesley Publishing Company Inc, Massachusetts