The Return of xorro

Loading...
Thumbnail Image

Access rights

openAccess
acceptedVersion

URL

Journal Title

Journal ISSN

Volume Title

A4 Artikkeli konferenssijulkaisussa

Major/Subject

Mcode

Degree programme

Language

en

Pages

14

Series

Logic Programming and Nonmonotonic Reasoning - 15th International Conference, LPNMR 2019, Proceedings, pp. 284-297, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Volume 11481 LNAI

Abstract

Although parity constraints are at the heart of many relevant reasoning modes like sampling or model counting, little attention has so far been paid to their integration into ASP systems. We address this shortcoming and investigate a variety of alternative approaches to implementing parity constraints, ranging from rather basic ASP encodings to more sophisticated theory propagators (featuring Gauss-Jordan elimination). All of them are implemented in the xorro system by building on the theory reasoning capabilities of the ASP system clingo. Our comparative empirical study investigates the impact of the number and size of parity constraints on performance and indicates the merits of the respective implementation techniques. Finally, we benefit from parity constraints to equip xorro with means to sample answer sets, paving the way for new applications of ASP.

Description

Keywords

Other note

Citation

Everardo, F, Janhunen, T, Kaminski, R & Schaub, T 2019, The Return of xorro. in M Balduccini, Y Lierler & S Woltran (eds), Logic Programming and Nonmonotonic Reasoning - 15th International Conference, LPNMR 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11481 LNAI, Springer, pp. 284-297, International Conference on Logic Programming and Nonmonotonic Reasoning, Philadelphia, Pennsylvania, United States, 03/06/2019. https://doi.org/10.1007/978-3-030-20528-7_21