Distributed answer set coloring: stable models computation via graph coloring

MaRDI QIDQ5020596zbMATH OpenFDO

Authors Marco de Bortoli

Publication date 6 January 2022

Full work available at URL https://arxiv.org/abs/1909.08263, http://eptcs.web.cse.unsw.edu.au/paper.cgi?ICLP2019.60

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Experimental Analysis of Graph-based Answer Set Computation over Parallel and Distributed Architectures
• Solving distributed constraint optimization problems using logic programming
• Logic Programming and Nonmonotonic Reasoning
• Integrating grounding in the search process for answer set computing
• scientific article; zbMATH DE number 6747915

Cites work

• An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems
• Experimenting with parallelism for the instantiation of ASP programs
• GASP: Answer set programming with lazy grounding
• Graphs and colorings for answer set programming
• The Semantics of Predicate Logic as a Programming Language

Cited in

(1)

• A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems

Describes a project that uses

Uses Software

• MapReduce
• GASP
• Clingo

This page was built for publication: Distributed answer set coloring: stable models computation via graph coloring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5020596)