Négation constructive et axiomatique interne

 Access to full text

 Full (PDF)

1. 1. K. R. APT, Introduction to Logic Programming, Handbook of Theoretical Computer Science (J. Van Leeuwen), North Holland, 1990. Zbl0900.68136MR1127195
2. 2. N. BLEUZEN-GUERNALEC et B. GIL, Internal Negation in Logic Programming, Rapport Technique, U.A.225, Université d'Aix-Marseille-II, 1989. 
3. 3. A. BRIEU, Négation en Programmation par Contraintes, Thèse de Doctorat (en préparation), Institut de Mathématiques de Luminy, Université de la Méditerranée. 
4. 4. P. BRUSCOLI, F. LEVI, G. LEVI et M. C. MEO, Compilative Constructive Negation in Constraint Logic Programs, CAAP'94, 19th International Colloquium, Edinburg, April 11-14, in Proceedings Stison, Springer-Verlag, 1994, p. 52-57. Zbl0938.68571MR1286751
5. 5. D. CHAN, Constructive Negation Based on the Completed Database, Technical Report, ECRC, 1988. 
6. 6. D. CHAN, Constructive Negation based on the Completed Database, in Proceedings of the fifth International Conference on Logic Programming, R. A. Kowalski and K. A. Bowen eds., MIT Press, Cambridge, 1988, p. 111-125. 
7. 7. C. C. CHANG and H. G. KEISLER, Model Theory, 3th Edition, Studies in Logic, North-Holland, Amsterdam, 1990. Zbl0697.03022MR1059055
8. 8. K. L. CLARK, Negation as Failure, in Logic and Data Bases, H. Gallaire et J. Minkers eds., Plenum Press, New York, 1978, p. 293-322. 
9. 9. J.-P. DELAHAYE, Sémantiques Logiques et Dénotationnelles des Interpréteurs PROLOG, in Theoretical Informatics and Applications, 1988, vol. 22, p. 3-42. Zbl0652.68025MR945922
10. 10. W. DRABENT, Completeness of SLDNF-resolution for non-floundering queries, in Journal of Logic Programming, 1996, vol. 27, n° 2, p. 89-106. Zbl0874.68050MR1386806
11. 11. F. FAGES, Constructive Negation by Pruning, in Journal of Logic Programming, 1997, vol. 32, n° 2, p. 85-118. Zbl0882.68034MR1448073
12. 12. F. FAGES, Constructive negation by pruning and optimization higher-order predicates, in CLP and CC languages, In M. Nivat et A. Podelski eds., Constraints: Basics and Trends, Lecture Notes in Computer Science, n° 910, Springer-Verlag, 1995, p. 68-89. 
13. 13. M. FITTING, A KRIPKE-KLEENE Semantics for Logic Programs, in Journal of Logic Programming, 1985, vol. 2, n° 4, p. 295-312. Zbl0589.68011MR818647
14. 14. B. GIL, Intériorisation de la Négation en Programmation Logique, Thèse, Université d'Aix-Marseille-II, 1991. 
15. 15. B. GIL, Complete Extension of General Logic Programs, Theoretical Computer Science 94, Elsevier, 1992, p. 281-294. Zbl0754.68028MR1157860
16. 16. H. J. KEISLER, Model Theory for Infinitary Logic (Logic with Countable Conjonctions and Finite Quantifiers), Studies in Logic and The Foundations of Mathematics, vol. 62, North-Holland Publishing Company, Amsterdam-London, 1971. Zbl0222.02064MR344115
17. 17. K. KUNEN, Negation in Logic Programming, in Journal of Logic Programming, 1987, n° 4, p. 289-308. Zbl0655.68018MR916936
18. 18. K. KUNEN, Signed Data Dependencies in Logic Programs, in Journal of Logic Programming, 1989, n° 7, p. 231-245. MR1022791
19. 19. B. MELTZER, Theorem-proving for Computers: Some Results on Resolution and Renaming, in Automation of Reasoning, J. Siekmann et G.Wrightson eds., Springer-Verlag, Berlin, 1983, vol. 1, p. 493-495. (Première parution de l'article in Computing Journal 8, 1966, p. 341-343.) Zbl0158.26004MR191128
20. 20. P. J. STUCKEY, Constructive Negation for Constraint Logic Programming, in Proceedings LICS, Amsterdam, 1991, p. 328-335.