Towards Abstraction in ASP with an Application on Reasoning about Agent Policies

09/18/2018
by   Zeynep G. Saribatur, et al.
0

ASP programs are a convenient tool for problem solving, whereas with large problem instances the size of the state space can be prohibitive. We consider abstraction as a means of over-approximation and introduce a method to automatically abstract (possibly non-ground) ASP programs that preserves their structure, while reducing the size of the problem. One particular application case is the problem of defining declarative policies for reactive agents and reasoning about them, which we illustrate on examples.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/03/2020

Omission-based Abstraction for Answer Set Programs

Abstraction is a well-known approach to simplify a complex problem by ov...
research
01/16/2020

Adversarially Guided Self-Play for Adopting Social Conventions

Robotic agents must adopt existing social conventions in order to be eff...
research
07/10/2020

COBRA: Compression via Abstraction of Provenance for Hypothetical Reasoning

Data analytics often involves hypothetical reasoning: repeatedly modifyi...
research
07/28/2013

ROSoClingo: A ROS package for ASP-based robot control

Knowledge representation and reasoning capacities are vital to cognitive...
research
09/11/2019

Abstraction for Zooming-In to Unsolvability Reasons of Grid-Cell Problems

Humans are capable of abstracting away irrelevant details when studying ...
research
03/17/2023

Clingraph: A System for ASP-based Visualization

We present the ASP-based visualization tool clingraph which aims at visu...
research
05/06/2014

An ASP-Based Architecture for Autonomous UAVs in Dynamic Environments: Progress Report

Traditional AI reasoning techniques have been used successfully in many ...

Please sign up or login with your details

Forgot password? Click here to reset