Making sense of conflicting defeasible rules in the controlled natural language ACE: design of a system with support for existential quantification using skolemization
From International Center for Computational Logic
Making sense of conflicting defeasible rules in the controlled natural language ACE: design of a system with support for existential quantification using skolemization
Talk by Martin Diller
- Location: APB 3027
- Start: 4. April 2019 at 1:00 pm
- End: 4. April 2019 at 2:00 pm
- Research group: Computational Logic
- Research group: Automata Theory
- Research group: Knowledge-Based Systems
- Event series: KBS Seminar
- iCal
Abstract: We motivate and present the design of a system implementing what we (joint work with Hannes Strass previously at the University of Leipzig as well as Adam Z. Wyner at Swansea University) have dubbed the "EMIL" (acronym for "extracting meaning out of inconsistent language") pipeline. The pipeline in question takes potentially conflicting rules expressed in a fragment of a prominent controlled natural language, ACE, yet extended with means of expressing defeasible rules in the form of normality assumptions. It makes sense of such rules using a recently formulated argumentation-inspired semantics, verbalising possible points of view that can plausibly be held based on the rules in ACE. The approach we describe is ultimately based on reductions to answer-set-programming (ASP); simulating existential quantification by using skolemization in a manner resembling a translation for ASP formalized in the context of ∃-ASP. We discuss the advantages of this approach to building on the existing ACE interface to rule-systems, ACERules.