Backdoors to Tractable Answer-Set Programming

04/14/2011
by   Johannes Klaus Fichte, et al.
0

Answer Set Programming (ASP) is an increasingly popular framework for declarative programming that admits the description of problems by means of rules and constraints that form a disjunctive logic program. In particular, many AI problems such as reasoning in a nonmonotonic setting can be directly formulated in ASP. Although the main problems of ASP are of high computational complexity, located at the second level of the Polynomial Hierarchy, several restrictions of ASP have been identified in the literature, under which ASP problems become tractable. In this paper we use the concept of backdoors to identify new restrictions that make ASP problems tractable. Small backdoors are sets of atoms that represent "clever reasoning shortcuts" through the search space and represent a hidden structure in the problem input. The concept of backdoors is widely used in the areas of propositional satisfiability and constraint satisfaction. We show that it can be fruitfully adapted to ASP. We demonstrate how backdoors can serve as a unifying framework that accommodates several tractable restrictions of ASP known from the literature. Furthermore, we show how backdoors allow us to deploy recent algorithmic results from parameterized complexity theory to the domain of answer set programming.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/30/2013

Characterizing and Extending Answer Set Semantics using Possibility Theory

Answer Set Programming (ASP) is a popular framework for modeling combina...
research
01/15/2014

A Unifying Framework for Structural Properties of CSPs: Definitions, Complexity, Tractability

Literature on Constraint Satisfaction exhibits the definition of several...
research
01/08/2013

Backdoors to Normality for Disjunctive Logic Programs

Over the last two decades, propositional satisfiability (SAT) has become...
research
08/30/2023

Deontic Paradoxes in ASP with Weak Constraints

The rise of powerful AI technology for a range of applications that are ...
research
09/26/2018

Results in Workflow Resiliency: Complexity, New Formulation, and ASP Encoding

First proposed by Wang and Li in 2007, workflow resiliency is a policy a...
research
07/15/2014

Controlled Natural Language Processing as Answer Set Programming: an Experiment

Most controlled natural languages (CNLs) are processed with the help of ...
research
03/24/2000

DATALOG with constraints - an answer-set programming system

Answer-set programming (ASP) has emerged recently as a viable programmin...

Please sign up or login with your details

Forgot password? Click here to reset