论文信息 - Partial Semantics for Truth Maintenance - a Compositional Approach

Partial Semantics for Truth Maintenance - a Compositional Approach

To generalize the 2-valued stable model semantics for truth maintenance, we introduce a partial semantics. This semantics can be given compositional properties and in particular, the well-founded model can be derived as a composition of partial interpretations.

Cees Witteveen

[1] Jean H. Gallier,et al. Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[2] Kenneth A. Ross,et al. Unfounded sets and well-founded semantics for general logic programs , 1988, PODS.

[3] Charles Elkan,et al. Logical Characterizations of Nonmonotonic TMSs , 1989, MFCS.

[4] Kenneth Kunen,et al. Signed Data Dependencies in Logic Programs , 1989, J. Log. Program..

[5] J. Lloyd. Foundations of Logic Programming , 1984, Symbolic Computation.

[6] Michael Reinfrank,et al. Logical Foundations of Nonmonotonic Truth Maintencance , 1989, EPIA.

[7] Allen Van Gelder,et al. The Alternating Fixpoint of Logic Programs with Negation , 1993, J. Comput. Syst. Sci..