Making Sense of Conflicting (Defeasible) Rules in the Controlled Natural Language ACE: Design of a System with Support for Existential Quantification Using Skolemization

Martin DillerMartin Diller, Adam Zachary WynerAdam Zachary Wyner, Hannes StrassHannes Strass

Download

Martin Diller, Adam Zachary Wyner, Hannes Strass
Making Sense of Conflicting (Defeasible) Rules in the Controlled Natural Language ACE: Design of a System with Support for Existential Quantification Using Skolemization
Proceedings of the 13th International Conference on Computational Semantics, 32-37, 2019. Association for Computational Linguistics

Details
Bibtex

KurzfassungAbstract
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.
Weitere Informationen unter:Further Information: Link
Projekt:Project: CPEC
Forschungsgruppe:Research Group: Computational LogicComputational Logic, Logische Programmierung und ArgumentationLogic Programming and Argumentation

@inproceedings{DWS2019,
  author    = {Martin Diller and Adam Zachary Wyner and Hannes Strass},
  title     = {Making Sense of Conflicting (Defeasible) Rules in the Controlled
               Natural Language {ACE:} Design of a System with Support for
               Existential Quantification Using Skolemization},
  booktitle = {Proceedings of the 13th International Conference on Computational
                Semantics},
  publisher = {Association for Computational Linguistics},
  year      = {2019},
  pages     = {32-37}
}