Programming by combining general logic programs

Journal of Logic and Computation

Volumn 9, Issue 1, 1999, Pages 7-24

  Brogi, A ^a   Contiero, S ^a   Turini, F ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Logic programming; Non monotonic reasoning; Program composition; Three valued logic

Indexed keywords

COMPUTATIONAL LINGUISTICS; CONSTRAINT THEORY; FORMAL LOGIC; KNOWLEDGE REPRESENTATION; MATHEMATICAL TRANSFORMATIONS;

MODULAR PROGRAMMING; NON-MONOTONIC REASONING;

LOGIC PROGRAMMING;

EID: 0033077770     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/9.1.7     Document Type: Article

References (14)

1. K. R. Apt. Logic programming. In Handbook of Theoretical Computer Science, Vol. B. J. van Leeuwen, ed., pp. 493-574. Elsevier, 1990.
2. K. R. Apt and R. Bol. Logic programming and negation: a survey. Journal of Logic Programming, 19-20, 9-71, 1994.
3. R. Barbuti, P. Mancarella, D. Pedreschi and F. Turini. A transformational approach to negation in logic programming. Journal of Logic Programming, 8, 201-228, 1990.
4. A. Brogi. Program Construction in Computational Logic. PhD thesis, University of Pisa, 1993.
5. A. Brogi, E. Lamma, P. Mancarella and P. Mello. A unifying view for logic programming with non-monotonic reasoning. Theoretical Computer Science, 184, 1-59, 1997.
6. A. Brogi, P. Mancarella, D. Pedreschi and F. Turini. Modular logic programming. ACM Transactions on Programming Languages and Systems, 16, 1361-1398, 1994.
7. A. Brogi and F. Turini. Fully abstract compositional semantics for an algebra of logic programs. Theoretical Computer Science, 149, 201-229, 1995.
8. F. Bry. A compositional semantics for logic programs and deductive databases. In JICSLP 96 Proc. of the Joint International Conference and Symposium on Logic Programming, M. Maher, ed., pp. 453-467, 1996.
9. L. Cavedon and H. Decker. Generalizing allowedness while retaining completeness of SLDNF-resolution. In Proc. of the Third Workshop on Computer Science Logic, E. Börger, H. Kleine Büning and M. M. Richter, eds, Vol. 440 of Lecture Notes in Computer Science, pp. 98-115. Springer Verlag, 1990.
10. K. Clark. Negation as failure. In Logic and Data Bases, H. Gallaire and J. Minker, eds, pp. 293-322. Plenum, 1978.
11. J. Dix. Semantics of logic programs: Intuition and formal properties. In Logic, Action and Information. A. Furhmann and K. Rott, eds, De Gruyter, 1993.
12. H. C. Doets. Leviatonis laus. Journal of Logic and Computation, 3, 487-516, 1993.
13. W. Drabent. Completeness of SLDNF-resolution for non-floundering queries. Journal of Logic Programming, 27, 89-106, 1994.
14. P. M. Dung. Negation as hypotheses: An abductive foundation for logic programming. In Proc. 8th International Conference on Logic Programming, K. Furukawa, ed., pp. 3-17. The MIT Press, 1991.