Skip to main content
SpringerLink
Log in

CWA formalizations in multi-valued logics

  • Correspondence
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bidoit N. Negation in rule-based database languages: A survey.Theoretical Computer Science, 1991, 78: 3–83.

    Article  MATH  MathSciNet  Google Scholar 

  2. Chazarain J, Riscos A, Alonso J A, Briales E. Multi-valued logic and Gröbner bases with applications to modal logic.J. Symbolic Computation, 1991, 11: 181–194.

    Article  MATH  MathSciNet  Google Scholar 

  3. Shepherdson J C. Negation as failure, completion and stratification. InHandbook of Logic in Artificial Intelligence and Logic Programming, Gabbay Dov Met al. (eds.), 1998, 5: 356–419.

  4. Bolc L, Borowik P. Many-Valued Logics (1 Theoretical Foundations). Berlin Heidelberg: Springer-Verlag, 1992.

    MATH  Google Scholar 

  5. Cox D, Little J, O’Shea D. Ideals, Varieties, and Algorithms, — An Introduction to Computational Algebraic Geometry and Commutative Algebra. New York: Springer-Verlag, 1997.

    Google Scholar 

  6. Wu W-T. Basic Principles of Mechanical Theorem Proving in Geometries. Beijing: Science Press, 1984. (in Chinese).

    Google Scholar 

  7. Wu J, Tan H. An algebraic method to decide the deduction problem in many-valued logics. InProc. International Symposium on Multi-Valued Logics, IEEE Computer Society Press, 1994, pp.272–275.

  8. Baaz M, Fermüller C G. Resolution-based theorem proving for many-valued logics.J. Symbolic Computation, 1995, 19: 353–391.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Max-Planck-Institut für Informatik, Im Stadtwald, D-66123, Saarbrücken, Germany

    Wu Jinzhao

Authors
  1. Wu Jinzhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wu Jinzhao.

Additional information

On leave from School of Mathematical Sciences, Peking University.

WU Jinzhao was born in 1965. He obtained his Ph.D. degree in 1994 from the Institute of Systems Science, The Chinese Academy of Sciences. From 1994 to 1999 he was a postdoctor and research scientist in Peking University and Texas A&M University and Max-Planck Institute of Computer Science. Since 2000 he has been working on the Faculty of Mathematics and Computer Science, University of Mannheims.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wu, J. CWA formalizations in multi-valued logics. J. Comput. Sci. & Technol. 16, 263–269 (2001). https://doi.org/10.1007/BF02943204

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02943204

Keywords

Search

Navigation