Skip to main content

First-Order Reasoning for Attempto Controlled English

  • Conference paper

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

Abstract

RACE is a first-order reasoner for Attempto Controlled English (ACE) that can show the (in-) consistency of a set of ACE axioms, prove ACE theorems from ACE axioms and answer ACE queries from ACE axioms. In each case RACE gives a proof justification in ACE and full English. This paper is a system description of RACE sketching its structure, its implementation, its operation and its user interface. The power and the limitations of RACE are demonstrated and discussed by concrete examples.

Keywords

  • controlled natural language
  • Attempto Controlled English
  • ACE
  • first-order reasoning
  • RACE

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Manthey, R., Bry, F.: SATCHMO: A Theorem Prover Implemented in Prolog. In: Lusk, E., Overbeek, R. (eds.) CADE 1988. LNCS, vol. 310, pp. 415–434. Springer, Heidelberg (1988)

    CrossRef  Google Scholar 

  2. Bry, F., Yahya, A.: Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation. Journal of Automated Reasoning 25, 35–82 (2000)

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. Basin, D., D’Agostino, M., Gabbay, D.M., Matthews, S., Viganò, L. (eds.): Labelled Deduction. Applied Logic Series, vol. 17. Springer (2000)

    Google Scholar 

  4. Bos, J.: Computational Semantics in Discourse: Underspecification, Resolution, and Inference. Journal of Logic, Language and Information 13, 139–157 (2004)

    CrossRef  MATH  Google Scholar 

  5. Pratt-Hartmann, I., Third, A.: More fragments of language. Notre Dame Journal of Formal Logic 47(2), 151–177 (2006)

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. Mandl, M.: Zur Komplexität des Erfüllbarkeitsproblems von Sprachfragmenten, Hauptseminar Kontrollierte Sprache CIS, SS 2010. Universität München (2010)

    Google Scholar 

  7. Fuchs, N.E., Kaljurand, K., Kuhn, T.: Discourse Representation Structures for ACE 6.6, Technical Report ifi-2010.0010, Department of Informatics, University of Zurich (2010)

    Google Scholar 

  8. Schwertel, U.: Plural Semantics for Natural Language Understanding — A Computational Proof-Theoretic Approach, PhD thesis, University of Zurich (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fuchs, N.E. (2012). First-Order Reasoning for Attempto Controlled English. In: Rosner, M., Fuchs, N.E. (eds) Controlled Natural Language. CNL 2010. Lecture Notes in Computer Science(), vol 7175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31175-8_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31175-8_5

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-642-31175-8

  • eBook Packages: Computer ScienceComputer Science (R0)