First-Order reasoning for attempto controlled english

Authors:
Norbert E. Fuchs
Affiliations:
Department of Informatics & Institute of Computational Linguistics, University of Zurich, Switzerland
Venue:
CNL'10 Proceedings of the Second international conference on Controlled Natural Language
Year:
2010

Citing 4
Cited 1

Labelled deduction

Labelled deduction
Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation

Journal of Automated Reasoning
SATCHMO: A Theorem Prover Implemented in Prolog

Proceedings of the 9th International Conference on Automated Deduction
Computational Semantics in Discourse: Underspecification, Resolution, and Inference

Journal of Logic, Language and Information

Sorry, i don't speak SPARQL: translating SPARQL queries into natural language

Proceedings of the 22nd international conference on World Wide Web

Quantified Score

Hi-index	0.00

Visualization

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.