Combining explicit negation and negation by failure via Belnap's logic

Theoretical Computer Science

Volumn 171, Issue 1-2, 1997, Pages 61-75

  Ruet, Paul ^a,b   Fages, François ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b LCR   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC;

BELNAP'S LOGIC;

LOGIC PROGRAMMING;

EID: 0030817470     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00125-9     Document Type: Article

References (22)

1. J.J. Alferes and L.M. Pereira, On logic program semantics with two kinds of negation, in: Proc. ILPS'92 Joint Internat. Conf., and Symp. on Logic Programming (1992).
2. A.R. Anderson, N.D. Belnap Jr. and J.M. Dunn, Entailment: the Logic of Relevance and Necessity, Vol. 2 (Princeton University Press, 1992) 506-541.
3. K.R. Apt, H.A. Blair and A. Walker, Towards a theory of declarative knowledge, in: J. Minker, ed., Foundations of Deductive Databases and Logic Programming (Morgan Kaufmann, Los Altos, CA, 1988).
4. N.D. Belnap Jr., A useful four-valued logic, in: J.M. Dunn and G. Epstein, eds., Modern Uses of Multiple-Valued Logic (Reidel, Dordrectit, 1977).
5. K.L. Clark, Negation as failure, in: H. Gallaire and J. Minker, eds., Logic and Databases (Plenum, New York, 1978).
6. F. Fages, Consistency of clark's completion and existence of stable models, Tech. Report 90-15, Ecole Normale Supérieure, Paris, 1990, and Methods of Logic in Computer Science 1 (1994).
7. F. Fages, Consistency of clark's completion and existence of stable models, Tech. Report 90-15, Ecole Normale Supérieure, Paris, 1990, and Methods of Logic in Computer Science 1 (1994).
8. F. Fages, Constructive Negation by pruning, J. Logic Programming, to appear.
9. M. Fitting, A Kripke-Kleene semantics for logic programs, J. Logic Programming 2 (1985).
10. M. Fitting, Bilattices and the theory of truth, J. Philos. Logic 18 (1989).
11. M. Fitting, Bilattices and the semantics of logic programming, J. Logic Programming 11 (1991).
12. M. Fitting, The family of stable models, J. Logic Programming 17 (1993).
13. M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in: Proc. ICLP'88, 5th Internat. Conf. on Logic Programming (1988).
14. M. Gelfond and V. Lifschitz, Logic programs with classical negation, in: Proc. ICLP'90, 7th Internat. Conf. on Logic Programming (1990).
15. M. Gelfond and V. Lifschitz, classical negation in Logic programs and disjunctive databases, New Generation Computing 9 (1991).
16. M. Gelfond and V. Lifschitz, Representing actions in extended logic programs, in: Proc. ILPS'92 Joint Internat. Conf. and Symp. on Logic Programming (1992).
17. M. Ginsberg, Multivalued logics: a uniform approach to reasoning in artificial intelligence, Computat. Intelligence 4 (1988).
18. K. Kunen, Negation in logic programming, J. Logic Programming 4 (1987).
19. K. Kunen, Signed data dependences in logic programs, J. Logic Programming 1 (1989).
20. P. Stuckey, Constructive negation for constraint logic programming, in: Proc. LICS'91 Internat. Conf. on Logic in Computer Science (1991).
21. M.H. Van Emden and R. Kowalski, The semantics of predicate logic as a programming language, in: J. Assoc. Comput. Mach. 23 (1976).
22. G. Wagner, A database needs two kinds of negation, in: B. Thalheim, J. Demetrovics and H.-D. Gerhardt, eds., MFDBS'91 (Springer, Berlin 1991).