Mutex Graphs and Multicliques: Reducing Grounding Size for Planning

09/18/2019
by   David Spies, et al.
0

We present an approach to representing large sets of mutual exclusions, also known as mutexes or mutex constraints. These are the types of constraints that specify the exclusion of some properties, events, processes, and so on. They are ubiquitous in many areas of applications. The size of these constraints for a given problem can be overwhelming enough to present a bottleneck for the solving efficiency of the underlying solver. In this paper, we propose a novel graph-theoretic technique based on multicliques for a compact representation of mutex constraints and apply it to domain-independent planning in ASP. As computing a minimum multiclique covering from a mutex graph is NP-hard, we propose an efficient approximation algorithm for multiclique covering and show experimentally that it generates substantially smaller grounding size for mutex constraints in ASP than the previously known work in SAT.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/02/2021

grASP: A Graph Based ASP-Solver and Justification System

Answer set programming (ASP) is a popular nonmonotonic-logic based parad...
research
09/17/2021

Compilation of Aggregates in ASP

Answer Set Programming (ASP) is a well-known problem-solving formalism i...
research
04/30/2018

Constraint Answer Set Programming without Grounding

Extending ASP with constraints (CASP) enhances its expressiveness and pe...
research
07/13/2017

Constraints, Lazy Constraints, or Propagators in ASP Solving: An Empirical Analysis

Answer Set Programming (ASP) is a well-established declarative paradigm....
research
07/31/2019

Domain-Independent Cost-Optimal Planning in ASP

We investigate the problem of cost-optimal planning in ASP. Current ASP ...
research
09/18/2019

Exploiting Partial Knowledge in Declarative Domain-Specific Heuristics for ASP

Domain-specific heuristics are an important technique for solving combin...
research
06/18/2021

Classical Planning as QBF without Grounding (extended version)

Most classical planners use grounding as a preprocessing step, reducing ...

Please sign up or login with your details

Forgot password? Click here to reset