High-level logic programming

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

Volumn 1762 LNCS, Issue , 2000, Pages 226-240

  Osorio, Mauricio ^a   Zacarias, Fernando ^b  

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

^b BENEMÉRITA UNIVERSIDAD AUTÓNOMA DE PUEBLA   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING; PROGRAM TRANSLATORS; SEMANTICS; RECONFIGURABLE HARDWARE;

DATALOG; DECLARATIVE SEMANTICS; PARTIAL ORDER; STANDARD LOGIC;

COMPUTER CIRCUITS;

EID: 84874754642     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46564-2_14     Document Type: Conference Paper

References (34)

1. J. Arrazola, J. Dix y M. Osorio. Confluent term Rewriting Systems for Non Monotonic Reasoning. Computaciń y Sistemas, II (2-3). pp. 104-123, 1999. México.
2. S. Abiteboul and S. Grumbach, "A Rule-Based Language with Functions and Sets," ACM Transactions on Database Systems, 16(1): 1-30, 1991.
3. C. Beeri, S. Naqvi, et al, "Sets and Negation in a Logic Database Language (LDL1)," Proc. 6th ACM Principles of Database Systems, pp. 21-37, 1987.
4. S. Brass, J. Dix, T. Przymusinski, "Super Logic Programs," Proc. of the Fifth Intern. Conf. on Principles of Knowledge Repr. and Reasoning (KR '96), L. C. Aiello, J. Doyle and S. C. Shapiro (eds.), Morgan Kaufmann, San Francisco 1996.
5. Stefan Brass and Jürgen Dix. Characterizations of the Disjunctive Stable Semantics by Partial Evaluation. Journal of Logic Programming, 32(3): 207-228, 1997.
6. (Extended abstract appeared in: Characterizations of the Stable Semantics by Partial Evaluation LPNMR, Proceedings of the T hird International Conference, Kentucky, pages 85-98, 1995. LNCS 928, Springer.).
7. Stefan Brass and Jürgen Dix. Characterizations of the Disjunctive Wellfounded Semantics: Confluent Calculi and Iterated GCWA. Journal of Automated Reasoning, to appear, 1998.
8. (Extended abstract appeared in: Characterizing D-WFS: Confluence and Iterated GCWA. Logics in Artificial Intelligence, JELIA '96, pages 268-283, 1996. Springer, LNCS 1126.).
9. Stefan Brass, Ulrich Zukowski, and Burkhardt Freitag. Transformation Based Bottom-Up Computation of the Well-Founded Model. In J. Dix, L. Pereira, and T. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, LNAI 1216, pages 171-201. Springer, Berlin, 1997.
10. Gerhard Brewka and Jürgen Dix. Knowledge representation with logic programs. Technical report, Tutorial Notes of the 12th European Conference on Artificial Intelligence (ECAI '96), 1996.
11. Also appeare d as Technical Report 15/96, Dept. of CS of the University of Koblenz-Landau. Will appear as Chapter 6 in Handbook of Philosophical Logic, 2nd edition (1998), Volume 6, Methodologies.
12. Keith L. Clark. Negation as Failure. In H. Gallaire and J. Minker, editors, Logic and Data-Bases, pages 293-322. Plenum, New York, 1978.
13. Dovier, A., Omodeo, E. G., Pontelli, E., and Rossi, G. "{log}: A Logic Programming Language with Finite Sets," Proc. 8th International Conference of Logic Programming, pp. 111-124, Paris, June 1991.
14. Jürgen Dix. A Framework for Representing and Characterizing Semantics of Logic Programs. In B. Nebel, C. Rich, and W. Swartout, editors, Principles of Know ledge Representation and Reas oning: Proceedings of the Third International Conference (KR '92), pages 591-602. San Mateo, CA, Morgan Kaufmann, 1992.
15. Jürgen Dix. A Classification-Theory of Semantics of Normal Logic Programs: II. Weak Properties. Fundamenta Informaticae, XXII(3): 257-288, 1995.
16. G. Ganguly, S. Greco, and C. Zaniolo, "Minimum and maximum predicates in logic programs", Proceedings of the ACM Symposium on Principles of Database Systems, pp 154-163, 1991.
17. Allen van Gelder, Kenneth A. Ross, and John S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38: 620-650, 1991.
18. B. Jayaraman, "Implementation of Subset-Equational Programs," Journal of Logic Programming, 11(4): 299-324, 1992.
19. D. Jana, "Semantics of Subset-Logic Languages," dissertation submitted to SUNY-Buffalo, 1994.
20. B. Jayaraman, M. Osorio and K. Moon, "Partial Order Programming (revisited)", Proc. AMAST, Springer-Verlag, July 1995.
21. Jayaraman, B. and Plaisted, D. A., "Programming with Equations, Subsets, and Relations," Proc. North American Conference of Logic Programming 89, pp. 1051-1068, Cleveland, October 1989.
22. Kuper, G. M., "Logic Programming with Sets," JCSS, 41(1): 44-64, 1990.
23. J. Lloyd, "Foundations of Logic Programming," (2 ed.) Springer-Verlag, 1987.
24. M. Liu., 'Relationlog: A typed extension to Datalog with Sets and Tuples," Proc. ISLP95 pp. 83-97. MIT Press. June 1995.
25. John W. Lloyd. Foundations of Logic Programming. Springer, Berlin, 1987. 2nd edition.
26. Mauricio Osorio y B. Jayaraman Integrating the Completion and the Well Founded Semantics. Titulo del libro: Progress in Artificial Intelligence IBERAMIA 98. Ed. Springer-Verlag. ISBN 3-540-64992-1. pp 230-241. Alemania 1998.
27. M. Osorio and B. Jayaraman, "Aggregation and Negation as Failure", New Genetation Computing, 17(3), 1999.
28. M. Osorio, B. Jayaraman and J. C. Nieves "Declarative Pruning in a Functional Query Language", accepted ICLP99.
29. Mauricio Osorio, B. Jayaraman and D. Plaisted "Theory of partial-order programming," in Science of computer programming Journal, (34) 3, 1999.
30. +", In J. Dix, L. Pereida, and T. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, LNAI 1216, pp. 71-90. Springer, Berlin 1997
31. Mauricio Osorio, "Semantics of Partial order programming," presented at JELIA98, Germany, Oct. 1998 appears in Proc. JELIA98, pp. 47-61, LNAI 1489, Springer-Verlag, 1998.
32. K. Ross, "Modular Stratification and Magic Sets for DATALOG Programs with negation", Journal of the ACM, Vol. 41, No. 6, November 1994, pp. 1216-1266.
33. K.A. Ross and Y. Sagiv, "Monotonic Aggregation in Deductive Databases," Proc. 11th ACM Symposium on Principles of Database Systems, pp. 114-126, San Diego, 1992.
34. A. Van Gelder, "The Well-Founded Semantics of Aggregation," Proc. ACM 11th Principles of Database Systems, pp. 127-138, San Diego, 1992.