A logical foundation for logic programming II: Semantics of general logic programs

Alferes, 1992, On logic program semantics with two kinds of negation, 574 Baral, 1992, Generalized negation as failure and semantics of normal disjunctive logic programs, vol. 624, 309 Baral, 1991, Dualities between alternative semantics for logic programming and nonmonotonic reasoning (Extended abstract), 69 Baral, 1992, Stable and extension class theory for logic programs and default logics, J. Automat. Reason., 8, 345, 10.1007/BF02341854 Bochman, 1995, Default consequences relations as a logical framework for logic programs, vol. 928, 245 Bochman, 1995, On bimodal nonmonotonic logics and their unimodal and nonmodal equivalents, 1518 Bochman, 1996, Biconsequence relations for nonmonotonic reasoning Bochman, 1996, On a logical basis of normal logic programs, Fund. Inform., 28, 223, 10.3233/FI-1996-283402 A. Bochman, What is a four-valued reasoning and how it can be nonmonotonic, submitted. Bochman, 1997, A study of Przymusinski's static semantics, vol. 1265, 170 A. Bochman. Biconsequence relations: A general formalism of reasoning with inconsistency and incompleteness, submitted. Bochman, 1998, A logical foundation for logic programming I: Biconsequence relations and nonmonotonic completion, J. Logic Programming, 35, 151, 10.1016/S0743-1066(97)10005-X Brass, 1995, A general approach to bottom-up computation of disjunctive semantics, vol. 927, 127 Brass, 1996, Characterizing D-WFS: Confluence and iterated GCWA, vol. 1126, 268 Brass, 1997, Comparison and efficient computation of the static and the disjunctive WFS, 37 Brass, 1996, Super logic programs, 529 Dix, 1994, Partial evaluation and relevance for approximations of the stable semantics, vol. 869, 511 Giordano, 1995, A logical characterization for truth maintenance systems with dependency-directed backtracking, Comput. Intelligence, 11, 11, 10.1111/j.1467-8640.1995.tb00022.x Inoue, 1994, On positive occurrence of negation as failure, 293 Lifschitz, 1994, Minimal belief and negation as failure, Artificial Intelligence, 70, 53, 10.1016/0004-3702(94)90103-1 Lifschitz, 1992, Answer sets in general nonmonotonic reasoning (preliminary report), 603 Müller, 1993, Implementing semantics of disjunctive logic programs using fringes and abstract properties (extend abstract), 43 Przymusinski, 1988, On the declarative semantics of stratified deductive detabases and logic programs, 193 Przymusinski, 1990, The well-founded semantics coincides with the three-valued stable semantics, Fund. Inform., 13, 445 Przymusinski, 1991, Stable semantics for disjunctive programs, New Generation Computing, 9, 401, 10.1007/BF03037171 Przymusinski, 1991, Semantics of disjuctive logic programs and deductive databases, 85 Przymusinski, 1995, Static semantics and normal and disjunctive logic programs, Ann. Math. Artificial Intelligence, 14, 323, 10.1007/BF01530826 Przymusinski, 1994, Semantics of normal and disjunctive logic programs: A unifying framework, 43 Schlipf, 1992, Formalizing a logic for logic programming, Ann. Math. Artificial Intelligence, 5, 279, 10.1007/BF01543479 You, 1994, A three-valued semantics for deductive databases and logic programs, J. Comput. System Sci., 49, 334, 10.1016/S0022-0000(05)80053-4 Van Gelder, 1991, The well-founded semantics for general logic programs, J. ACM, 38, 620, 10.1145/116825.116838 Witteveen, 1995, Revision by communication, vol. 928, 189