Abstract
We present the design of a system for making sense of conflicting rules expressed in a fragment of the prominent controlled natural language ACE, yet extended with means of expressing defeasible rules in the form of normality assumptions. The approach we describe is ultimately based on answer-set-programming (ASP); simulating existential quantification by using skolemization in a manner resembling a translation for ASP recently formalized in the context of ∃-ASP. We discuss the advantages of this approach to building on the existing ACE interface to rule-systems, ACERules.- Anthology ID:
- W19-0505
- Volume:
- Proceedings of the 13th International Conference on Computational Semantics - Short Papers
- Month:
- May
- Year:
- 2019
- Address:
- Gothenburg, Sweden
- Editors:
- Simon Dobnik, Stergios Chatzikyriakidis, Vera Demberg
- Venue:
- IWCS
- SIG:
- SIGSEM
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 32–37
- Language:
- URL:
- https://aclanthology.org/W19-0505
- DOI:
- 10.18653/v1/W19-0505
- Cite (ACL):
- Martin Diller, Adam Wyner, and Hannes Strass. 2019. Making Sense of Conflicting (Defeasible) Rules in the Controlled Natural Language ACE: Design of a System with Support for Existential Quantification Using Skolemization. In Proceedings of the 13th International Conference on Computational Semantics - Short Papers, pages 32–37, Gothenburg, Sweden. Association for Computational Linguistics.
- Cite (Informal):
- Making Sense of Conflicting (Defeasible) Rules in the Controlled Natural Language ACE: Design of a System with Support for Existential Quantification Using Skolemization (Diller et al., IWCS 2019)
- PDF:
- https://preview.aclanthology.org/nschneid-patch-4/W19-0505.pdf