Aggregation and negation-as-failure

New Generation Computing

Volumn 17, Issue 3, 1999, Pages 255-284

  Osorio, Mauricio ^a   Jayaraman, Bharat ^b  

^a UNIVERSIDAD DE LAS AMÉRICAS PUEBLA   (Mexico)

^b the State University of New York   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; DISTRIBUTED DATABASE SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; LOGIC PROGRAMMING; PROGRAM TRANSLATORS; QUERY LANGUAGES;

PARTIAL-ORDER PROGRAMS;

COMPUTER SYSTEMS PROGRAMMING;

EID: 0032592775     PISSN: 02883635     EISSN: None     Source Type: Trade Journal    
DOI: 10.1007/BF03037222     Document Type: Article

References (30)

1. Abiteboul, S. and Grumbach, S., "A Rule-Based Language with Functions and Sets," ACM Trans. on Database Systems, 16, 1, pp. 1-30, 1991.
2. Aravindam, C. and Dung, P. M., "Partial deduction of Logic Programs wrt Well-Founded Semantics," New Generation Computing, 13, pp. 45-74, 1994.
3. Brass, S. and Dix, J., "Disjunctive Semantics based upon Partial and Bottom-Up Evaluation," in Proc. of the 12th International Conf. on Logic Programming (Leon Sterling, ed.), Tokyo, MIT Press, pp. 199-213, Jun. 1995.
4. Brass, S. and Dix, J., "Characterizations of the Disjunctive Well-founded Semantics: Confluent Calculi and Iterated GCWA," to appear in Journal of Automated Reasoning, 1997. Extended abstract appeared in: "Characterizing D-WFS: Confluence and Iterated GCWA," Logics in Artificial Intelligence, JELIA '96, LNCS 1126, Springer-Verlag, pp. 268-283, 1996.
5. Brass, S. and Dix, J., "Characterizations of the Disjunctive Well-founded Semantics: Confluent Calculi and Iterated GCWA," to appear in Journal of Automated Reasoning, 1997. Extended abstract appeared in: "Characterizing D-WFS: Confluence and Iterated GCWA," Logics in Artificial Intelligence, JELIA '96, LNCS 1126, Springer-Verlag, pp. 268-283, 1996.
6. Beeri, C. and Naqvi, S. et al, "Sets and Negation in a Logic Database Language (LDL1)," in Proc. 6th ACM Symp. on Principles of Database Systems, pp. 21-37, 1987.
7. Dix, J., "A framework for representing and characterizing semantics of Logic Programs," in Proc. 3rd International Conf. on Principles of Knowledge Representation and Reasoning, pp. 591-602, 1992.
8. Dix, J., "A Classification-Theory of Semantics of Normal Logic Programs: I. Strong Properties," Fundamenta Informaticae XXII, 3, pp. 227-255, 1995.
9. Dix, J., "A Classification-Theory of Semantics of Normal Logic Programs: II. Weak Properties," Fundamenta Informaticae XXII, 3, pp. 257-288, 1995.
10. Dix, J. and Osorio, M., "Towards Well-behaved Semantics Suitable for Aggregation," Research Report, 11-97, University of Koblenz, Germany. Also, poster paper, ILPS97.
11. Dix, J. and Osorio, M., "Provability Closures in Logic Programming," in Proc. International Symp. of Computer Science, Mexico City, Oct. 1997.
12. Ganguly, G., Greco, S. and Zaniolo, C., "Minimum and maximum predicates in logic programs," in Proc. 10th ACM Symp. on Principles of Database Systems, pp. 154-163, 1991.
13. Gelfond, M. and Lifschitz, V., "The Stable Model Semantics for Logic Programming," in Proc. 5th International Conf. of Logic Programming, Seattle, pp. 1070-1080, Aug. 1988.
14. Jana, D. and Jayaraman, B., "Set constructors, Finite Sets, and Logical Semantics," Journal of Logic Programming, 38, 1, pp. 55-77, 1999.
15. Jayaraman, B. and Moon, K., "Subset-Logic Programs and Their Implementation," to appear in Journal of Logic Programming.
16. Jayaraman, B., Osorio, M. and Moon, K., "Partial Order Programming (revisited)," in Proc. Algebraic Methodology and Software Technology, Springer-Verlag, Jul. 1995.
17. Kemp, D. B. and Stuckey, P. J., "Semantics of logic programs with aggregates," in International Logic Programming Symp., pp. 387-401, 1991.
18. Kunen, K., "Some remarks on the completed database," Technical Report, 775, Univ. of Wisconsin, Madison, WI, 1988.
19. Lefebvre, A., "Towards and Efficient Evaluation of Recursive Aggregates in Deductive Databases," New Generation Computing, 12, pp. 131-160, 1994.
20. Liu, M., "Relationlog: A typed Extension to Datalog with Sets and Tuples," in Proc. International Symp. of Logic Programming, pp. 83-97, 1995.
21. Lloyd, J., Foundations of Logic Programming(2nd ed.), Springer-Verlag, Berlin, 1987.
22. Moon, K., "Implementation of Subset Logic Languages," Ph.D. dissertation, Department of Computer Science, SUNY-Buffalo, 1997.
23. Przymusinski, T. C., "On the Declarative Semantics of Stratified Deductive Databases," in Foundations of Deducive Databases and Logic Programming (J. Minker, ed.), pp. 193-216, 1988.
24. Przymusinski, T. C. and Przymusinska, H., "Semantic Issues in Deductive Databases and Logic Programs," in Formal Techniques in Artificial Intelligence (R. B. Banerji, ed.), pp. 321-367, 1990.
25. Ross, K. A. and Sagiv, Y., "Monotonic Aggregation in Deductive Databases," in Proc. 11th ACM Symp. on Principles of Database Systems, San Diego, pp. 114-126, 1992.
26. Schlipf, J., "Formalizing a Logic for Logic Programming," Annals of Mathematics and Artificial Intelligence, 5, pp. 279-302, 1992.
27. Sudarshan, S., Srivastava, D., Ramakrishnan, R. and Beeri, C., "Extending the Well-Founded and Valid Semantics for Aggregation," in Proc. International Logic Programming Symp., pp. 590-608, 1993.
28. Sacca, D. and Zaniolo, C., "Stable models and non-determinism in logic programs with negation," in Proc. 9th ACM Symp. on Principles of Database Systems, pp. 205-217, 1990.
29. Van Gelder, A., "The Well-Founded Semantics of Aggregation," in Proc. ACM 11th Principles of Database Systems, San Diego, pp. 127-138, 1992.
30. Van Gelder, A., Ross, K. A. and Schlipf, J. S., "The Well-Founded Semantics for General Logic Programs," JACM, 38, 3, pp. 620-650.