Skip to main content
SpringerLink
Log in

Reasoning in Attempto Controlled English

  • Conference paper
Principles and Practice of Semantic Web Reasoning (PPSWR 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2901))

Abstract

Attempto Controlled English (ACE) – a subset of English that can be unambiguously translated into first-order logic – is a knowledge representation language. To support automatic reasoning in ACE we have developed the Attempto Reasoner RACE (Reasoning in ACE). RACE proves that one ACE text is the logical consequence of another one, and gives a justification for the proof in ACE. Variations of the basic proof procedure permit query answering and consistency checking. Reasoning in RACE is supported by auxiliary first-order axioms and by evaluable functions. The current implementation of RACE is based on the model generator Satchmo.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Beckert, B., Posegga, J.: leanT AP: Lean, Tableau-Based Deduction. Journal of Automated Reasoning 15(3), 339–358 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  2. Blackburn, P., Bos, J.: Computational Semantics. Theoria 18(1), 27–45 (2003)

    MATH  MathSciNet  Google Scholar 

  3. Bos, J.: Model Building for Natural Language Understanding, ms. (2001), Draft at www.iccs.informatics.ed.ac.uk/~jbos

  4. Bry, F., Torge, S.: A Deduction Method Complete for Refutation and Finite Satisfiability. In: Dix, J., Fariñas del Cerro, L., Furbach, U. (eds.) JELIA 1998. LNCS (LNAI), vol. 1489, p. 122. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. Fuchs, N.E.: Specifications Are (Preferably) Executable. Software Engineering Journal 7(5), 323–334 (1992); Reprinted in: Bowen, J.P., Hinchey, M.G.: High-Integrity System Specification and Design. Springer, London (1999)

    Google Scholar 

  7. He, L.F.: UNSATCHMO: Unsatisfiability Checking by Model Rejection. In: Goré, R., Leitsch, A., Nipkov, T. (eds.) International Joint Conference on Automated Reasoning IJCAR 2001, Short Papers, Siena, Italy, pp. 64–75 (2001)

    Google Scholar 

  8. Hobbs, J.R.: Ontological Promiscuity. In: 23rd Annual Meeting of the ACL, pp. 61–69. University of Chicago, Illinois (1985)

    Google Scholar 

  9. Iwanska, L.M., Shapiro, S.C. (eds.): Natural Language Processing and Knowledge Representation. AAAI Press/MIT Press, Menlo Park (2000)

    MATH  Google Scholar 

  10. Kamp, H., Reyle, U.: From Discourse to Logic. Introduction to Modeltheoretic Semantics of Natural Language, Formal Logic and Discourse Representation Theory. Kluwer, Dordrecht (1993)

    Google Scholar 

  11. Link, G.: The Logical Analysis of Plurals and Mass Terms: A Lattice-Theoretical Approach. In: Bäuerle, R., Schwarze, C., von Stechow, A. (eds.) Meaning, Use, and Interpretation of Language, pp. 302–323. de Gruyter, Berlin (1983)

    Google Scholar 

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

    Chapter  Google Scholar 

  13. McCune, W.W.: Otter 3.0 Reference Manual and Guide. Technical Report ANL- 94/6, Argonne National Laboratory (1994)

    Google Scholar 

  14. McCune, W.W.: Mace 2.0 Reference Manual and Guide. Technical Memorandum ANL/MCS-TM-249, Argonne National Laboratory (2001)

    Google Scholar 

  15. Reyle, U., Gabbay, D.M.: Direct Deductive Computation on Discourse Representation Structures. Linguistics and Philosophy 17, 343–390 (1994)

    Article  MATH  Google Scholar 

  16. Schütz, H., Geisler, T.: Efficient Model Generation through Compilation. Information and Computation 162(1-2), 138–157 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  17. Schwertel, U.: Controlling Plural Ambiguities in Attempto Controlled English. In: 3rd International Workshop on Controlled Language Applications (CLAW), Seattle, Washington (2000)

    Google Scholar 

  18. Sowa, J.F.: Knowledge Representation: Logical, Philosophical, and Computational Foundations. Brooks Cole Publishing Co., Pacific Grove (2000)

    Google Scholar 

  19. Stickel, M.E.: Schubert’s Steamroller Problem: Formulation and Solutions. Journal of Automated Reasoning 2(1), 89–101 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  20. Sukkarieh, J.: Quasi-NL Knowledge Representation for Structurally-Based Inferences. In: 3rd Workshop on Inference in Computational (ICoS-3), Siena, Italy (2001a)

    Google Scholar 

  21. Suttcliffe, G., Suttner, C.: Results of the CADE-13 ATP System Competition. Journal Automated Reasoning 18(2), 259–264 (1997)

    Article  Google Scholar 

  22. Torge, S.: Überprüfung der Erfüllbarkeit im Endlichen: Ein Verfahren und seine Anwendung. Ph.D. thesis, University of Munich (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Zürich,  

    Norbert E. Fuchs & Uta Schwertel

Authors
  1. Norbert E. Fuchs
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Uta Schwertel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Informatics, University of Munich, Oettingenstr. 67, D-80538, München, Germany

    François Bry

  2. IVS - Semantic Web Group, Leibniz University of Hannover, Appelstr. 4, D-30167, Hannover, Germany

    Nicola Henze

  3. Department of Computer and Information Science, Linköping University, 581 83, Linköping, Sweden

    Jan Małuszyński

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fuchs, N.E., Schwertel, U. (2003). Reasoning in Attempto Controlled English. In: Bry, F., Henze, N., Małuszyński, J. (eds) Principles and Practice of Semantic Web Reasoning. PPSWR 2003. Lecture Notes in Computer Science, vol 2901. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24572-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24572-8_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20582-1

  • Online ISBN: 978-3-540-24572-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation