Abstract
Attempto Controlled English (AGE) - 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. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Fuchs, N. E., & Schwertel, U. (2003). Reasoning in Attempto Controlled English. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2901, 174–188. https://doi.org/10.1007/978-3-540-24572-8_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
