Distributed Answer Set Coloring: Stable Models Computation via Graph Coloring

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Abstract

Answer Set Programming (ASP) is a famous logic language for knowledge representation, which has been really successful in the last years, as witnessed by the great interest into the development of efficient solvers for ASP. Yet, the great request of resources for certain types of problems, as the planning ones, still constitutes a big limitation for problem solving. Particularly, in the case the program is grounded before the resolving phase, an exponential blow up of the grounding can generate a huge ground file, infeasible for single machines with limited resources, thus preventing even the discovering of a single non-optimal solution. To address this problem, in this paper we present a distributed approach to ASP solving, exploiting distributed computation benefits in order to overcome the just explained limitations. The here presented tool, which is called Distributed Answer Set Coloring (DASC), is a pure solver based on the well-known Graph Coloring algorithm. DASC is part of a bigger project aiming to bring logic programming into a distributed system, started in 2017 by Federico Igne with mASPreduce and continued in 2018 by Pietro Totis with a distributed grounder. In this paper we present a low level implementation of the Graph Coloring algorithm, via the Boost and MPI libraries for C++. Finally, we provide a few results of the very first working version of our tool, at the moment without any strong optimization or heuristic.
Original languageEnglish
Title of host publicationProceedings 35th International Conference on Logic Programming (Technical Communications) (ICLP 2019)
Subtitle of host publicationDoctoral Consortium
Pages441-451
DOIs
Publication statusPublished - 2019
Event35th International Conference on Logic Programming - Las Cruces, United States
Duration: 20 Sep 201925 Sep 2019

Conference

Conference35th International Conference on Logic Programming
Abbreviated titleICLP 2019
CountryUnited States
CityLas Cruces
Period20/09/1925/09/19

Fingerprint

Coloring
Logic programming
Antenna grounds
Knowledge representation
Electric grounding
Planning

ASJC Scopus subject areas

  • Artificial Intelligence

Fields of Expertise

  • Information, Communication & Computing

Treatment code (Nähere Zuordnung)

  • Basic - Fundamental (Grundlagenforschung)

Cite this

De Bortoli, M. (2019). Distributed Answer Set Coloring: Stable Models Computation via Graph Coloring. In Proceedings 35th International Conference on Logic Programming (Technical Communications) (ICLP 2019): Doctoral Consortium (pp. 441-451) https://doi.org/10.4204/EPTCS.306.60

Distributed Answer Set Coloring: Stable Models Computation via Graph Coloring. / De Bortoli, Marco.

Proceedings 35th International Conference on Logic Programming (Technical Communications) (ICLP 2019): Doctoral Consortium. 2019. p. 441-451.

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

De Bortoli, M 2019, Distributed Answer Set Coloring: Stable Models Computation via Graph Coloring. in Proceedings 35th International Conference on Logic Programming (Technical Communications) (ICLP 2019): Doctoral Consortium. pp. 441-451, 35th International Conference on Logic Programming, Las Cruces, United States, 20/09/19. https://doi.org/10.4204/EPTCS.306.60
De Bortoli M. Distributed Answer Set Coloring: Stable Models Computation via Graph Coloring. In Proceedings 35th International Conference on Logic Programming (Technical Communications) (ICLP 2019): Doctoral Consortium. 2019. p. 441-451 https://doi.org/10.4204/EPTCS.306.60
De Bortoli, Marco. / Distributed Answer Set Coloring: Stable Models Computation via Graph Coloring. Proceedings 35th International Conference on Logic Programming (Technical Communications) (ICLP 2019): Doctoral Consortium. 2019. pp. 441-451
@inproceedings{e74577af0a7549b7b3edf29f287d3f1e,
title = "Distributed Answer Set Coloring: Stable Models Computation via Graph Coloring",
abstract = "Answer Set Programming (ASP) is a famous logic language for knowledge representation, which has been really successful in the last years, as witnessed by the great interest into the development of efficient solvers for ASP. Yet, the great request of resources for certain types of problems, as the planning ones, still constitutes a big limitation for problem solving. Particularly, in the case the program is grounded before the resolving phase, an exponential blow up of the grounding can generate a huge ground file, infeasible for single machines with limited resources, thus preventing even the discovering of a single non-optimal solution. To address this problem, in this paper we present a distributed approach to ASP solving, exploiting distributed computation benefits in order to overcome the just explained limitations. The here presented tool, which is called Distributed Answer Set Coloring (DASC), is a pure solver based on the well-known Graph Coloring algorithm. DASC is part of a bigger project aiming to bring logic programming into a distributed system, started in 2017 by Federico Igne with mASPreduce and continued in 2018 by Pietro Totis with a distributed grounder. In this paper we present a low level implementation of the Graph Coloring algorithm, via the Boost and MPI libraries for C++. Finally, we provide a few results of the very first working version of our tool, at the moment without any strong optimization or heuristic.",
author = "{De Bortoli}, Marco",
year = "2019",
doi = "10.4204/EPTCS.306.60",
language = "English",
pages = "441--451",
booktitle = "Proceedings 35th International Conference on Logic Programming (Technical Communications) (ICLP 2019)",

}

TY - GEN

T1 - Distributed Answer Set Coloring: Stable Models Computation via Graph Coloring

AU - De Bortoli, Marco

PY - 2019

Y1 - 2019

N2 - Answer Set Programming (ASP) is a famous logic language for knowledge representation, which has been really successful in the last years, as witnessed by the great interest into the development of efficient solvers for ASP. Yet, the great request of resources for certain types of problems, as the planning ones, still constitutes a big limitation for problem solving. Particularly, in the case the program is grounded before the resolving phase, an exponential blow up of the grounding can generate a huge ground file, infeasible for single machines with limited resources, thus preventing even the discovering of a single non-optimal solution. To address this problem, in this paper we present a distributed approach to ASP solving, exploiting distributed computation benefits in order to overcome the just explained limitations. The here presented tool, which is called Distributed Answer Set Coloring (DASC), is a pure solver based on the well-known Graph Coloring algorithm. DASC is part of a bigger project aiming to bring logic programming into a distributed system, started in 2017 by Federico Igne with mASPreduce and continued in 2018 by Pietro Totis with a distributed grounder. In this paper we present a low level implementation of the Graph Coloring algorithm, via the Boost and MPI libraries for C++. Finally, we provide a few results of the very first working version of our tool, at the moment without any strong optimization or heuristic.

AB - Answer Set Programming (ASP) is a famous logic language for knowledge representation, which has been really successful in the last years, as witnessed by the great interest into the development of efficient solvers for ASP. Yet, the great request of resources for certain types of problems, as the planning ones, still constitutes a big limitation for problem solving. Particularly, in the case the program is grounded before the resolving phase, an exponential blow up of the grounding can generate a huge ground file, infeasible for single machines with limited resources, thus preventing even the discovering of a single non-optimal solution. To address this problem, in this paper we present a distributed approach to ASP solving, exploiting distributed computation benefits in order to overcome the just explained limitations. The here presented tool, which is called Distributed Answer Set Coloring (DASC), is a pure solver based on the well-known Graph Coloring algorithm. DASC is part of a bigger project aiming to bring logic programming into a distributed system, started in 2017 by Federico Igne with mASPreduce and continued in 2018 by Pietro Totis with a distributed grounder. In this paper we present a low level implementation of the Graph Coloring algorithm, via the Boost and MPI libraries for C++. Finally, we provide a few results of the very first working version of our tool, at the moment without any strong optimization or heuristic.

U2 - 10.4204/EPTCS.306.60

DO - 10.4204/EPTCS.306.60

M3 - Conference contribution

SP - 441

EP - 451

BT - Proceedings 35th International Conference on Logic Programming (Technical Communications) (ICLP 2019)

ER -