Isoinitial semantics for logic programs

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1861, Issue , 2000, Pages 223-238

  Lau, Kung Kiu ^a   Ornaghi, Mario ^b  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

^b UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPOSITIONALITY; HERBRAND MODEL; INCOMPLETE INFORMATION; LITERALS; LOGIC PROGRAMS; PARAMETRICITY;

SEMANTICS;

LOGIC PROGRAMMING;

EID: 35048859318     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-44957-4_15     Document Type: Conference Paper

References (16)

1. K.R. Apt and R. Bol. Logic programming and negation: a survey. JLP 19,20:9-71, 1994.
2. A. Bertoni, G. Mauri and P. Miglioli. On the power of model theory in specifying abstract data types and in capturing their recursiveness. Fundamenta Informaticae VI(2):127-170, 1983.
3. A. Bossi, M. Gabbrielli, G. Levi and M.C. Meo. A compositional semantics for logic programs. TCS 122:3-47, 1994.
4. A. Brogi, P. Mancarella, D. Pedreschi and F. Turini. Modular logic programming. ACM TOPLAS 16(4):1361-1398, 1994.
5. M. Bugliesi, E. Lamma and P. Mello. Modularity in logic programming. JLP 19,20:443-502, 1994.
6. D. Chan. Constructive negation based on the completed database. In Proc. JIC-SLP'88, pages 111-125, MIT Press, 1988.
7. D. De Schreye and S. Decorte. Termination of logic program s: The never-ending story. JLP 19,20:199-260, 1994.
8. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing 9:365-385, 1991.
9. W. Hodges. Logical features of horn clauses. In D.M. Gabbay, C.J. Hogger, and J.A. Robinson. editors, Handbook of Logic in Artificial Intelligence and Logic Pro-gramming, Volume 1 :449-503, Oxfor d University Press, 1993.
10. J. Küster Filipe, K.-K. Lau, M. Ornaghi, and H. Yatsu. On dynamic aspects of OOD frameworks in component-based software development in computational logic. In Proc. LOPSTR'99, LNCS 1817:43-62, Springer-Verlag, 2000.
11. K.-K. Lau, M . Ornaghi, and S.A. Tärnlund. Steadfast logic programs. JLP 38(3):259-294, 1999.
12. J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 2nd edition, 1987.
13. P. Lucio, F. Orejas, and E. Pino. An algebraic framework for the de-nition of compositional semantics of normal logic programs. JLP 40:89-123, 1999.
14. P. Miglioli, U. Moscato and M . Ornaghi. Constructive theories with abstract data types for program synthesis. In D.G. Skordev, editor, Mathematical Logic and its Applications, pages 293-302, Plenum Press, 1986.
15. P. Miglioli, U. Moscato and M. Ornaghi. Abstract parametric classes and abstract data types de-ned by classical and constructive logical methods. J. Symb. Comp. 18:41-81, 1994.
16. R. Reiter. On closed world data bases. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293-322, Plenum Press, 1978.