DocumentCode
3286879
Title
Controlled natural language can replace first-order logic
Author
Fuchs, Norbert E. ; Schwertel, Uta ; Torge, Sunna
Author_Institution
Dept. of Comput. Sci., Zurich Univ., Switzerland
fYear
1999
fDate
36434
Firstpage
295
Lastpage
298
Abstract
Many domain specialists are not familiar or comfortable with formal notations and formal tools like theorem provers or model generators. To address this problem, we developed Attempto Controlled English (ACE), a subset of English that can be unambiguously translated into first-order logic and thus can conveniently replace first-order logic as a formal notation. We describe how ACE has been used as a front-end to EP Tableaux, a model generation method complete for unsatisfiability and for finite satisfiability. We specified in ACE, a database example that was previously expressed in the EP Tableaux language PRQ, automatically translated the ACE specification into PRQ, and with the help of EP Tableaux reproduced the previously found results
Keywords
computability; database management systems; formal languages; formal specification; ACE specification; Attempto Controlled English; EP Tableaux; PRQ; controlled natural language; domain specialists; finite satisfiability; first-order logic; formal notation; formal notations; formal tools; front-end; model generation method; model generators; theorem provers; unsatisfiability; Automation; Computer science; Constraint theory; Databases; Electronic switching systems; Formal specifications; Logic; Natural languages; Programming; Software quality;
fLanguage
English
Publisher
ieee
Conference_Titel
Automated Software Engineering, 1999. 14th IEEE International Conference on.
Conference_Location
Cocoa Beach, FL
Print_ISBN
0-7695-0415-9
Type
conf
DOI
10.1109/ASE.1999.802325
Filename
802325
Link To Document