Constructive negation under the well-founded semantics

Journal of Logic Programming

Volumn 38, Issue 3, 1999, Pages 295-330

  Liu, Julie Yuchih ^c   Adams, Leroy ^a   Chen, Weidong ^b  

^a Campus Minister and the Director of the Institutional Quality Initiative   (United States)

^b Southern Methodist University   (United States)

^c NONE

Author keywords

Constraints; Constructive negation; Query evaluation; SLG resolution; Termination; Well foundation semantics

Indexed keywords

COMPUTATIONAL LINGUISTICS; CONSTRAINT THEORY; QUERY LANGUAGES;

CONSTRUCTIVE NEGATION; FUNCTION-FREE PROGRAMS; QUERY EVALUATION; WELL-FOUNDED SEMANTICS;

LOGIC PROGRAMMING;

EID: 0033101677     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(98)10027-4     Document Type: Article

References (33)

1. R. Bol, L. Degerstedt, Tabulated resolution for well founded semantics, Int. Logic Programming Symposium, October 1993.
2. G. Bossu, P. Siegel, Saturation, nonmonotonic reasoning and the closed world assumption, Artificial Intelligence 25 (1) (1985) 13-63.
3. W. L. Buntine, H.-J. Bürckert, On solving equations and disequations, Journal of ACM 41 (4) (1994) 591-629.
4. D. Chan, Constructive negation based on the completed database, in: R.A. Kowalski, K.A. Bowen (Eds.), Proceedings of the Fifth International Conference and Symposium on Logic Programming, 1988, pp. 111-125.
5. D. Chan, An extension of constructive negation and its application in coroutining, in: Proceedings of the North American Conference on Logic Programming, October 1989.
6. W. Chen, T. Swift, D.S. Warren, Efficient top-down computation of queries under the well-founded semantics, Journal of Logic Programming 24 (3) (1995) 161-199.
7. W. Chen, D.S. Warren, Tabled evaluation with delaying for general logic programs, Journal of ACM 43 (1) (1996) 20-74.
8. K.L. Clark, Negation as failure, in: H. Gallaire, J. Minker (Eds.), Logic and Databases, Plenum Press, New York, 1978, pp. 293-322.
9. H. Comon, P. Lescanne, Equational problems and disunification, Journal of Symbolic Computation 7 (1989) 371-425.
10. C. Damásio, Paraconsistent Extended Logic Programming with Constraints, Ph.D. thesis, Dept. de Informâtica, Universidade Nova de Lisboa, 1996.
11. W. Drabent, What is failure? An approach to constructive negation, Acta Informatica 32 (1) (1995) 27-59.
12. F. Fages, Constructive negation by pruning, Journal of Logic Programming, to appear.
13. M. Gelfond, V. Lifschitz, The stable model semantics for logic programming, in: R.A. Kowalski, K.A. Bowen (Eds.), Joint Int. Conference and Symposium on Logic Programming, 1988, pp. 1070-1080.
14. M. Johnson, A negation meta interpreter using anti-subsumption constraints, posted to comp.lang.prolog, 1992.
15. T. Khabaza, Negation as failure and parallelism, in: IEEE Symposium on Logic Programming, March 1984, pp. 70-75.
16. J.-L. Lassez, K.G. Marriott, Explicit representation of terms defined by counter examples, Journal of Automated Reasoning 3 (3) (1987) 1-17.
17. J. Maluszyński, T. Näslund, Fail substitutions for negation as failure, in: E.L. Lusk, R.A. Overbeek (Eds.), North American Conference on Logic Programming, 1989, pp. 461-476.
18. A. Martelli, U. Montanari, An efficient unification algorithm, ACM Transactions on Programming Languages and Systems 4 (2) (1982) 258-282.
19. J.F. Naughton, R. Ramakrishnan, Bottom-up evaluation of logic programs, in: J.-L. Lassez, G. Plotkin (Eds.), Computational Logic: Essays in Honor of Alan Robinson, MIT Press, Cambridge, MA, 1991, pp. 640-700.
20. T.C. Przymusinski, Every logic program has a natural stratification and an iterated least fixed point model, in ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1989, pp. 11-21.
21. T.C. Przymusinski, On constructive negation in logic programming, in: North American Conference on Logic Programming, October 1989.
22. T.C. Przymusinski, On the declarative and procedural semantics of logic programs, Journal of Automated Reasoning 5 (1989) 167-205.
23. T.C. Przymusinski, The well-founded semantics coincides with the three-valued stable semantics, Fundamenta Informaticae 13 (1990) 445-463.
24. T.C. Przymusinski, D.S. Warren, Well founded semantics: Theory and implementation, Draft, 1990.
25. I.V. Ramakrishnan, P. Rao, K. Sagonas, T. Swift, and D.S. Warren, Efficient tabling mechanisms for logic programs, in: L. Sterling (Ed.), International Conference on Logic Programming, MIT Press, Cambridge, MA, 1995, pp. 697-711.
26. K.A. Ross, A procedural semantics for well founded negation in logic programs, Journal of Logic Programming 13 (1) (1992) 1-22.
27. K. Sagonas, T. Swift, D.S. Warren, XSB as an efficient deductive database engine, in: ACM SIGMOD Conference on Management of Data, 1994, pp. 442-453.
28. P. Stuckey, S. Sudarshan, Well-founded ordered search, in: Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes Computer Science 761, 1993.
29. P.J. Stuckey, Constructive negation in constraint logic programming, in: Proceedings of the Sixth IEEE Annual Symposium on Logic in Computer Science, 1991, pp. 328-339.
30. A. Van Gelder, K.A. Ross, J.S. Schlipf, The well-founded semantics for general logic programs, Journal of ACM 38 (3) (1991) 620-650.
31. M. Vardi, The complexity of relational query languages, in: ACM Symposium on Theory of Computing, May 1982, pp. 137-146.
32. M. Wallace, Negation by constraints: A sound and efficient implementation of negation in deductive databases, in: IEEE Symposium on Logic Programming, 1987, pp. 253-263.
33. D.S. Warren, The XOLDT System, SUNY at Stony Brook, 1992.