Deolingo: un sistema de resolución de lógica deóntica basado en Answer Set Programming

Abstract

[Abstract]: This work introduces Deolingo, a tool for reasoning about Deontic Logic based on Answer Set Programming (ASP). The deontic logic solver is built upon Clingo as the ASP solver, and is provided as a Python library, command-line application and it is available on a web page editor for demonstration purposes. Deolingo implements the theoretical foundation of Deontic Equilibrium Logic with eXplicit negation (DELX) described in the paper by Pedro Cabalar, Agata Ciabatonni and Leendert van der Torre. DELX extends Equilibrium Logic for normative reasoning and establishes that any theories in DELX can be reduced to ASP. Apart from producing the answer sets for the input deontic logic theories as Clingo, Deolingo provides explainability of the answers by integrating with Xclingo. The deontic logic programs can also be annotated with Xclingo trace rules to produce the human-readable explanations which also reveal the structure of the implications that derived the atoms in the answer sets. As part of this work, the first public release of Deolingo was designed and implemented, support for Clingo variables and complex formulas was added, the system was optimized to reduce the grounding and a benchmark was created, a real case of normative reasoning was encoded and analyzed, and other integrations were explored such as Telingo for temporal deontic logic programs and generative AI to generate deontic logic programs from natural language texts.