First-Order Reasoning for Attempto Controlled English
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.
Keywordscontrolled natural language Attempto Controlled English ACE first-order reasoning RACE
Unable to display preview. Download preview PDF.
- 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
- 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