On the relations between acceptable programs and stratifiable classes

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

Volumn 1515, Issue , 1998, Pages 141-150

  Protti, F ^a   Zaverucha, G ^a  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Acceptable programs; Logic programs; Stratified programs

Indexed keywords

ARTIFICIAL INTELLIGENCE; LOGIC PROGRAMMING; SEMANTICS;

INCLUSION RELATION; LOGIC PROGRAMS;

COMPUTER CIRCUITS;

EID: 22444454185     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10692710_15     Document Type: Conference Paper

References (20)

1. K. R. Apt and R. Bol. Logic programming and negation: a survey. Journal of Logic Programming 19-20 (1994) 9-71.
2. K. R. Apt, H. Blair, and A. Walker. Towards a theory of declarative knowledge. In: J. Minker, ed. Foundations of Deductive Databases and Logic Programming (Morgan Kaufmann, Los Altos, CA, 1988), pp. 89-142.
3. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases, Addison-Wesley, 1995.
4. K. R. Apt and D. Pedresci. Reasoning about termination of pure prolog programs. Information and Computation 106 (1993) 109-157.
5. M. Bezem. Characterizing termination of logic programs with level mappings. In: E. L. Lusk and R. A. Overbeek, eds. Proceedings of the North American Conference on Logic Programming, MIT Press, Cambridge, MA, 1989.
6. N. Bidoit and C. Froidevaux. Negation by default and unstratifiable logic programs. Theoretical Computer Science 78 (1991) 85-112.
7. L. Cavedon. Continuity, consistency, and completeness properties for logic programs. In G. Levi and M. Martelli, Eds., Proceedings of the Sixth International Conference on Logic Programming, pp. 571-584, MIT Press, Cambridge, 1989.
8. Y. Dimopoulos, V. Magirou and C. H. Papadimitriou. On kernels, defaults and even graphs. Technical Report MPI-I-93-264, Max-Planck-Institut für Informatik, Germany.
9. Y. Dimopoulos and A. Torres. Graph theoretical structures in logic programs and default theories. Theoretical Computer Science 170 (1996) 209-244.
10. D. W. Etherington. Formalizing nonmonotonic reasoning systems. Artificial Intelligence 31 (1987) 41-85.
11. A. Garcez, G. Zaverucha, and V. Silva. Applying the Connectionist Inductive Learning and Logic Programming System to Power System Diagnosis. Proceedings of the IEEE/INNS International Conference on Neural Networks (ICNN-97), 9-12 June 1997, Houston, Texas, USA, Vol. 1, pp. 121-126.
12. S. Holldobler and Y. Kalinke. Toward a new massively parallel computational model for logic programming. In: Workshop on Combining Symbolic and Connectionist Processing (ECAI’94) (1994) pp. 1-14.
13. K. Kunen. Signed data dependencies in logic programming. J. Logic Programming 7 (1989) 231-245.
14. H. Przymusinska and T. C. Przymusinski. Weakly perfect model semantics for logic programs. In: Proc. Logic Programming Conf., Seattle (1988) 1106-1120.
15. T. Przymusinski. On the declarative semantics of logic programs with negation. In: J. Minker, ed. Foundations of Deductive Databases and Logic Programming (Morgan Kaufmann, Los Altos, CA, 1988), pp. 193-216.
16. C. H. Papadimitriou and M. Sideri. Default theories that always have extensions. Artificial Intelligence 69 (1994) 347-357.
17. T. Sato. Completed logic programs and their consistency. J. Logic Programming 9 (1990) 33-44.
18. L. Sterling and Shapiro. The Art of Prolog, MIT Press, Cambridge, MA, 1986.
19. A. Van Gelder. Negation as failure using tight derivations for general logic programs. In J. Minker, Ed., Foundations of Deductive Databases and Logic Programming, pp. 149-176, Morgan Kaufmann, Los Altos, CA, 1988.
20. A. Van Gelder, R. Roth, and J. S. Schlipf. Unfounded sets and well founded semantics for general logic programs. In: Proc. ACM SIGACT-SIGMOD Symp. on Principles of Database Systems (1988) 221-230.