Skip to main content

A Logic for Complete Information Systems

  • Conference paper
Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2009)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5590))

Abstract

A logic LIS for complete information systems is proposed. The language of LIS contains constants corresponding to attribute and attribute-values. A sound and complete deductive system for the logic is presented. Decidability is also proved.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balbiani, P.: Axiomatization of logics based on Kripke models with relative accessibility relations. In: Orłowska, E. (ed.) Incomplete Information: Rough Set Analysis, pp. 553–578. Physica Verlag, Heidelberg (1998)

    Chapter  Google Scholar 

  2. Balbiani, P., Orłowska, E.: A hierarchy of modal logics with relative accessibility relations. Journal of Applied Non-Classical Logics 9(2-3), 303–328 (1999)

    Article  MATH  Google Scholar 

  3. Banerjee, M., Khan, M.A.: Propositional logics from rough set theory. In: Peters, J.F., Skowron, A., Düntsch, I., Grzymała-Busse, J.W., Orłowska, E., Polkowski, L. (eds.) Transactions on Rough Sets VI. LNCS, vol. 4374, pp. 1–25. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  4. Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001)

    Book  MATH  Google Scholar 

  5. Demri, S., Orłowska, E.: Incomplete Information: Structure, Inference, Complexity. Springer, Heidelberg (2002)

    Book  MATH  Google Scholar 

  6. Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning About Knowledge. MIT Press, Cambridge (1995)

    MATH  Google Scholar 

  7. Orłowska, E.: Dynamic information systems. Fundamenta Informaticae 5, 101–118 (1982)

    MATH  Google Scholar 

  8. Orłowska, E.: Logic of nondeterministic information. Studia Logica 44(1), 91–100 (1985)

    Article  MATH  Google Scholar 

  9. Orłowska, E.: Logic of indiscernibility relations. In: Goos, G., Hartmanis, J. (eds.) SCT 1984. LNCS, vol. 208, pp. 177–186. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  10. Orłowska, E.: Kripke semantics for knowledge representation logics. Studia Logica 49(2), 255–272 (1990)

    Article  MATH  Google Scholar 

  11. Pawlak, Z.: Rough Sets. Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)

    MATH  Google Scholar 

  12. Vakarelov, D.: Abstract characterization of some knowledge representation systems and the logic NIL of nondeterministic information. In: Jorrand, Ph., Sgurev, V. (eds.) Artificial Intelligence II, pp. 255–260. North-Holland, Amsterdam (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Khan, M.A., Banerjee, M. (2009). A Logic for Complete Information Systems. In: Sossai, C., Chemello, G. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2009. Lecture Notes in Computer Science(), vol 5590. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02906-6_71

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02906-6_71

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02905-9

  • Online ISBN: 978-3-642-02906-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics