Automated aggregator - Rewriting with the counting aggregate

Michael Dingeß, Miroslaw Truszczynski

Research output: Contribution to journalConference articlepeer-review

1 Scopus citations

Abstract

Answer set programming is a leading declarative constraint programming paradigm with wide use for complex knowledge-intensive applications. Modern answer set programming languages support many equivalent ways to model constraints and specifications in a program. However, so far answer set programming has failed to develop systematic methodologies for building representations that would uniformly lend well to automated proceßing. This suggests that encoding selection, in the same way as algorithm selection and portfolio solving, may be a viable direction for improving performance of answer-set solving. The neceßary precondition is automating the proceß of generating poßible alternative encodings. Here we present an automated rewriting system, the Automated Ag- gregator or AAgg, that given a non-ground logic program, produces a family of equivalent programs with complementary performance when run under modern answer set programming solvers. We demonstrate this behavior through experimental analysis and propose the system's use in automated answer set programming solver selection tools.

Original languageEnglish
Pages (from-to)96-109
Number of pages14
JournalElectronic Proceedings in Theoretical Computer Science, EPTCS
Volume325
DOIs
StatePublished - Sep 19 2020
Event36th International Conference on Logic Programming, ICLP 2020 - Virtual, Rende, Italy
Duration: Sep 18 2020Sep 24 2020

Bibliographical note

Funding Information:
∗Research supported by National Science Foundation grant 1707371

Publisher Copyright:
© 2020 Open Publishing Association. All rights reserved.

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Automated aggregator - Rewriting with the counting aggregate'. Together they form a unique fingerprint.

Cite this