Nothing Special   »   [go: up one dir, main page]

Skip to main content

Epistemic Analysis of Interrogative Domains using Cuboids

  • Conference paper
  • First Online:
Advanced Techniques in Computing Sciences and Software Engineering
  • 2390 Accesses

Abstract

We are interested in analyzing the propositional knowledge extracted by an epistemic agent from interrogative domains. The interrogative domains that have our current focus are taken from transcripts of legal trials, congressional hearings, or law enforcement interrogations. These transcripts have be encoded in XML or HTML formats. The agent uses these transcripts as a primary knowledge source. The complexity, size, scope and potentially conflicting nature of transcripts from interrogative domains bring into question the quality of propositional knowledge that can be garnered by the agent. Epistemic Cuboids or Cubes are used as a knowledge analysis technique that helps determine the quality and quantity of the propositional knowledge extracted by an epistemic agent from an interrogative domain. In this paper we explore how 'Epistemic Cubes' can be used to evaluate the nature of the agent's propositional knowledge.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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.

Similar content being viewed by others

References

  1. J.P. Doignon and J.C. Falmagne, “Knowledge Spaces,” Hiedelberg; Springer ISBN-3-540-64501-2, 1999.

    Google Scholar 

  2. [2] Lewis, C.I., “A Survey of Symbolic Logic,” Berkeley: University of California Press, 1918.

    Google Scholar 

  3. Kripke, S., “Semantical Considerations on Modal Logic,” Acta Philosophica Fennica, pp. 16, 83-94, 1963.

    Google Scholar 

  4. Hintikka, J., “Individuals, Possible Worlds and Epistemic Logic,” Nous, pp. 1, 33-62, 1967.

    Google Scholar 

  5. Galitsky, B., “Natural Language Question Answering System Technique of Semantic Headers,” Advanced Knowledge International Pty Ltd, 2003

    Google Scholar 

  6. T. Hughes, C. Hughes, and A. Lazar, “ Epistemic Structured Representation for Legal Transcript Analysis,” Advances in Computer and Information Sciences and Engineering Springer, pp. 101-107, 2008

    Google Scholar 

  7. P.K. Moser, D.H. Mulder, and J.D. Trout, “The Theory of Knowledge: A Thematic Introduction,” Oxford University Press, 1998.

    Google Scholar 

  8. Casullo A. “A Priori Justification,” Oxford University Press,2003.

    Google Scholar 

  9. P. Blackburn and J. Bos, “Representation and Inference for Natural Language,” CSLI Publications, 2005.

    Google Scholar 

  10. S. Nirenburg, V. Raskin, “Ontological Semantics,” MIT Press, 2004.

    Google Scholar 

  11. [12] M. Minsky, “A framework for representing knowledge,” The psychology of computer vision. New York: McGraw-Hill, pp. 211-277, 1975.

    Google Scholar 

  12. R. Brachman, H Levesque “Knowledge Representation and Reasoning”, Elsevier, 2004.

    Google Scholar 

  13. R. Fagin, J. Halbern and M. Vard, “ Model Theoretic Analysis of Knowledge,” Journal of Association for Computing Machinery Vol 38. No 2, 1991.

    Google Scholar 

  14. [15] E. Gettier, “Is Justified True Belief Knowledge?,” Analysis, Vol.23, pp. 121-23. 1963.

    Article  Google Scholar 

  15. Swinburne R, “Epistemic Justification”,Clarendon Press Oxford, 2001.

    Google Scholar 

  16. J. Cussens and S. Pulman, “Incorporating Linguistics Constraints into Inductive Logic Programming,” Proceedings of CoNLL-2000 and LLL-2000, pp. 184-193. Lisbon, Portugal, 2000.

    Google Scholar 

  17. J. F. Sowa, “Semantics of Conceptual Graphs,” Proceeding of the 17th Annual Meeting of the Association for Computation Linguistics, pp. 39-44, 1979.

    Google Scholar 

  18. M.Covington, “Natural Language Processing For Prolog Programmers,” Prentice Hall, 1994.

    Google Scholar 

  19. W.G. Lehnert, “The Process of Question Answering,” Lawrence Erlbaum Associates, Inc., Publishers, 1978.

    Google Scholar 

  20. M. Biasiotti, E. Francesconi, M. Palmirani, G. Sartor, F. Vitali, “Legal Informatics and Management of Legislative Documents,” Global Centre for ICT in Parliament Working Paper No.2, January 2008.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Cameron Hughes .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer Science+Business Media B.V.

About this paper

Cite this paper

Hughes, C., Hughes, T. (2010). Epistemic Analysis of Interrogative Domains using Cuboids. In: Elleithy, K. (eds) Advanced Techniques in Computing Sciences and Software Engineering. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-3660-5_94

Download citation

  • DOI: https://doi.org/10.1007/978-90-481-3660-5_94

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-3659-9

  • Online ISBN: 978-90-481-3660-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics