Skip to main content

A Logic for Incomplete Sequential Information

  • Conference paper
Knowledge-Based and Intelligent Information and Engineering Systems (KES 2010)

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

  • 1560 Accesses

Abstract

Describing incomplete sequential information is of growing importance in Knowledge Representation in Artificial Intelligence and Computer Science. To obtain logical foundations for representing incomplete sequential information, a new logic, called sequence-indexed constructive propositional logic (SLJ), is introduced as a Gentzen-type sequent calculus by extending Gentzen’s LJ for intuitionistic logic. The system LJ is known as useful for representing incomplete information, and SLJ is obtained from LJ by adding a sequence modal operator which can represent sequential information. The cut-elimination and decidability theorems for SLJ are proved. A sequence-indexed Kripke semantics is introduced for SLJ, and the completeness theorem with respect to this semantics is proved. A logic programming framework can be developed based on SLJ.

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. van Dalen, D.: Logic and structure, 3rd edn. Springer, Heidelberg (1994)

    MATH  Google Scholar 

  2. Kamide, N., Kaneiwa, K.: Extended full computation-tree logic with sequence modal operator: Representing hierarchical tree structures. In: Nicholson, A., Li, X. (eds.) AI 2009. LNCS (LNAI), vol. 5866, pp. 485–494. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  3. Kamide, N., Wansing, H.: Combining linear-time temporal logic with constructiveness and paraconsistency. Journal of Applied Logic 8, 33–61 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  4. Miller, D., Nadathur, G., Pfenning, F., Scedrov, A.: Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic 51, 125–157 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  5. Odintsov, S., Wansing, H.: Inconsistency-tolerant description logic. Motivation and basic systems. In: Trends in Logic. 50 Years of Studia Logica, pp. 301–335. Kluwer Academic Publishers, Dordrecht (2004)

    Google Scholar 

  6. Wansing, H.: The Logic of Information Structures. LNCS (LNAI), vol. 681, 163 p. Springer, Heidelberg (1993)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kamide, N. (2010). A Logic for Incomplete Sequential Information. In: Setchi, R., Jordanov, I., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based and Intelligent Information and Engineering Systems. KES 2010. Lecture Notes in Computer Science(), vol 6277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15390-7_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15390-7_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15389-1

  • Online ISBN: 978-3-642-15390-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics