On the coincidence of semantics for uniquely determined programs

Electronic Notes in Theoretical Computer Science

Volumn 40, Issue , 2001, Pages 189-205

  Hitzler, Pascal ^a   Karel Seda, Anthony ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER PROGRAM LISTINGS; FORMAL LOGIC; LOGIC PROGRAMMING; SET THEORY; THEOREM PROVING;

AXIOMS; LOGIC PROGRAMS; MODEL SEMANTICS; PROLOG SYSTEMS;

SEMANTICS;

EID: 0041392844     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80047-7     Document Type: Conference Paper

References (24)

1. Apt K.R., Marek V.W., Truszczyński M., Warren D.S. "The Logic Programming Paradigm: A 25-Year Perspective," 1999;Springer, Berlin
2. Apt, K.R. and, Pedreschi D. Reasoning about termination of pure prolog programs. Information and Computation. 106:1993;109-157
3. Batarekh A. "Topological Aspects of Logic Programming," Ph.D. thesis, Syracuse University (June. 1989
4. Batarekh, A. and, Subrahmanian V.S. Topological model set deformations in logic programming. Fundamenta Informaticae. 12:1989;357-400
5. Bidoit, N. and, Froideveaux C. Negation by default and unstratifiable logic programs. Theoretical Computer Science. 78:1991;85-112
6. Cavedon L. Continuity, consistency, and completeness properties for logic programs. Levi G., Martelli M. Proceedings of the 6th International Conference on Logic Programming. 1989;571-584
7. Clark K. Negation as failure. Gallaire H., Minker J. Logic and Data Bases. 1978;293-322 Plenum Press, New York
8. Pages F. A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics. New Generation Computing. 9:1991;425-443
9. Fages F. Consistency of Clark's completion and existence of stable models. Journal of Methods of Logic in Computer Science. 1:1994;51-60
10. Fitting M. A Kripke-Kleene-semantics for general logic programs. Journal of Logic Programming. 2:1985;295-312
11. Gelder A.V., Ross, K. and, Schlipf J. The well-founded semantics for general logic programs. Journal of the ACM. 38:1991;620-650
12. Gelfond, M. and, Lifschitz V. The stable model semantics for logic programming. Kowalski R., Bowen K. Logic Programming. Proceedings of the 5th International Conference and Symposium on Logic Programming. 1988;1070-1080
13. Hitzler, P. and, Seda A.K. Acceptable programs revisited. Proc. Workshop on Verification in Logic Programming, 16th Int. Conf. on Logic Programming (ICLP'99), Las Cruces, New Mexico, Electronic Notes in Theoretical Computer Science. 30:(1):1999;1-18
14. Hitzler, P. and, Seda A.K. Characterizations of classes of programs by three-valued operators. Gelfond M., Leone N., Pfeifer G. Logic Programming and Nonmonotonic Reasoning, Proceedings of the 5th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR'99), El Paso, Texas, USA. Lecture Notes in Artificial Intelligence. 1730:1999;357-371
15. Hitzler, P. and, Seda A.K. The fixed-point theorems of Priess-Crampe and Ribenboim in logic programming. Valuation Theory and its Applications, Proceedings of the International Conference and Workshop in Valuation Theory in Honour of Paulo Ribenboim, University of Saskatchewan in Saskatoon, Canada, to appear. 1999;17 Fields Institute Communications Series, American Mathematical Society, Providence, RI
16. Lloyd J. "Foundations of Logic Programming," Springer, Berlin. 1988
17. Marek, V.W. and, Truszczynski M. Stable models and an alternative logic programming paradigm. Apt K.R., Marek V.W., Truszczynski M., Warren D.S. The Logic Programming Paradigm: A 25-Year Persepective. 1999;375-398 Springer, Berlin
18. Prieß-Crampe S., Ribenboim P. Ultrametric spaces and logic programming. Journal of Logic Programming. 42:2000;59-70
19. Protti, F. and, Zaverucha G. On the relations between acceptable programs and stratifiable classes. Oliveira F.D. Advances in Artificial Intelligence, 14th Brazilian Symposium on Artificial Intelligence, SBIA '98, Porto Alegre, Brazil. Lecture Notes in Computer Science. 1515:1998;141-150
20. Przymusinska, H. and Przymusinski, T., Weakly stratified logic programs, Fundamenta Informaticae 13 (1990), pp.51-65, in: K.R. Apt, editor, special issue of Fundamenta Informaticae on Logical Foundations of Artificial Intelligence.
21. Przymusinski T. On the declarative semantics of deductive databases and logic programs. Minker J. Foundations of Deductive Databases and Logic Programming. 1988;193-216 Morgan Kaufmann, Los Altos, CA
22. Przymusinski T. On the declarative and procedural semantics of logic programs. Journal of Automated Reasoning. 5:1989;167-205
23. Seda A.K. Topology and the semantics of logic programs. Fundamenta Informaticae. 24:1995;359-386
24. Willard S. "General Topology," Addison-Wesley, Reading, MA. 1970