Reactive Answer Set Programming

TL;DR

This paper introduces a systematic way to translate a reactive logic programming framework, KELPS, into answer set programming, enabling richer reactive and proactive behaviors and integrating both paradigms.

Contribution

It provides a formal mapping from KELPS to ASP, introduces a finite model variant called n-distance KELPS, and proposes a hybrid framework combining KELPS and ASP.

Findings

Formal sound and complete mapping from KELPS to ASP.

Enhanced reactive behaviors including proactive and preemptive actions.

A hybrid KELPS-ASP framework combining strengths of both paradigms.

Abstract

Logic Production System (LPS) is a logic-based framework for modelling reactive behaviour. Based on abductive logic programming, it combines reactive rules with logic programs, a database and a causal theory that specifies transitions between the states of the database. This paper proposes a systematic mapping of the Kernel of this framework (called KELPS) into an answer set program (ASP). For this purpose a new variant of KELPS with finite models, called $n$-distance KELPS, is introduced. A formal definition of the mapping from this $n$-distance KELPS to ASP is given and proven sound and complete. The Answer Set Programming paradigm allows to capture additional behaviours to the basic reactivity of KELPS, in particular proactive, preemptive and prospective behaviours. These are all discussed and illustrated with examples. Then a hybrid framework is proposed that integrates KELPS and ASP, allowing to combine the strengths of both paradigms. Under consideration in Theory and Practice of Logic Programming (TPLP).