Reasoning in Attempto Controlled English: Non-monotonicity
RACE is a first-order reasoner with equality for Attempto Controlled English (ACE) that can show the consistency of a set of ACE axioms and deduce ACE theorems and ACE queries from ACE axioms. This paper presents various forms of non-monotonic reasoning.
KeywordsControlled natural language Attempto Controlled English ACE RACE Monotonic reasoning Non-monotonic reasoning Abduction
I would like to thank the three anonymous reviewers of the first version of this paper for their constructive comments. Many thanks go to the Department of Informatics and the Institute of Computational Linguistics, University of Zurich, for their hospitality.
- 3.Bos, J.: Computational semantics in discourse: underspecification, resolution, and inference. J. Logic Lang. Inf. 13, 139–157 (2004). 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)CrossRefzbMATHGoogle Scholar
- 5.Grosof, B.N.: Courteous logic programs: prioritized conflict handling for rules. IBM Research Report RC 20836. IBM T. J. Watson Research Center (1997)Google Scholar