CWA formalizations in multi-valued logics
暂无分享，去创建一个
To enhance the expressive power and the declarative ability of a deductive database, various CWA (Closed World Assumption) formalizations including the naive CWA, the generalized CWA and the careful CWA are extended to multi-valued logics. The basic idea is to embed logic formulas into some polynomial ring. The extensions can be applied in a uniform manner to any finitely multi-valued logics. Therefore they are also of computational significance.
[1] Christian G. Fermüller,et al. Resolution-Based Theorem Proving for Manyvalued Logics , 1995, J. Symb. Comput..
[2] Yongli Li,et al. An Algebraic Method to Decide the Deduction Problem in Many-Valued Logics , 1998, J. Appl. Non Class. Logics.
[3] Emilio Briales Morales,et al. Multi-Valued Logic and Gröbner Bases with Applications to Modal Logic , 1991, J. Symb. Comput..
[4] Nicole Bidoit,et al. Negation in Rule-Based Database Languages: A Survey , 1991, Theor. Comput. Sci..