Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 31, Number 5, 1997
Page(s) 411 - 428
DOI https://doi.org/10.1051/ita/1997310504111
Published online 01 February 2017
  1. 1. K. R. APT, Introduction to Logic Programming, Handbook of Theoretical Computer Science (J. Van Leeuwen), North Holland, 1990. [MR: 1127195] [Zbl: 0900.68136]
  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. [MR: 1286751] [Zbl: 0938.68571]
  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. [MR: 1059055] [Zbl: 0697.03022]
  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. [EuDML: 92298] [MR: 945922] [Zbl: 0652.68025]
  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. [MR: 1386806] [Zbl: 0874.68050]
  11. 11. F. FAGES, Constructive Negation by Pruning, in Journal of Logic Programming, 1997, vol. 32, n° 2, p. 85-118. [MR: 1448073] [Zbl: 0882.68034]
  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. [MR: 818647] [Zbl: 0589.68011]
  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. [MR: 1157860] [Zbl: 0754.68028]
  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. [MR: 344115] [Zbl: 0222.02064]
  17. 17. K. KUNEN, Negation in Logic Programming, in Journal of Logic Programming, 1987, n° 4, p. 289-308. [MR: 916936] [Zbl: 0655.68018]
  18. 18. K. KUNEN, Signed Data Dependencies in Logic Programs, in Journal of Logic Programming, 1989, n° 7, p. 231-245. [MR: 1022791]
  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.) [MR: 191128] [Zbl: 0158.26004]
  20. 20. P. J. STUCKEY, Constructive Negation for Constraint Logic Programming, in Proceedings LICS, Amsterdam, 1991, p. 328-335.

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.