Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis-Reference-Cited by-同舟云学术

Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis

Published:2017-08-24 Issue:5-6 Volume:17 Page:780-799
ISSN:1471-0684
Container-title:Theory and Practice of Logic Programming
language:en
Short-container-title:Theory and Practice of Logic Programming

Author:

CUTERI BERNARDO,DODARO CARMINE^ORCID,RICCA FRANCESCO,SCHÜLLER PETER^ORCID

Abstract

AbstractAnswer set programming (ASP) is a well-established declarative paradigm. One of the successes of ASP is the availability of efficient systems. State-of-the-art systems are based on the ground+solve approach. In some applications, this approach is infeasible because the grounding of one or a few constraints is expensive. In this paper, we systematically compare alternative strategies to avoid the instantiation of problematic constraints, which are based on custom extensions of the solver. Results on real and synthetic benchmarks highlight some strengths and weaknesses of the different strategies.

Publisher

Cambridge University Press (CUP)

Subject

Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software

Reference38 articles.

1. Dao-Tran M. , Eiter T. , Fink M. , Weidinger G. and Weinzierl A. 2012. Omiga: An open minded grounding on-the-fly answer set solver. In Proc. of European Conference on Logics in Artificial Intelligence. Lecture Notes in Computer Science, vol. 7519. Springer, 480–483.

2. Nogueira M. , Balduccini M. , Gelfond M. , Watson R. and Barry M. 2001. An A-prolog decision support system for the space shuttle. In: PADL. 169–183.

3. Dodaro C. , Ricca F. and Schüller P. 2016b. External propagators in WASP: preliminary report. In Proc. of RCRA. CEUR Workshop Proceedings, vol. 1745. CEUR-WS.org, 1–9.

4. Susman B. and Lierler Y. 2016. SMT-based constraint answer set solver EZSMT (system description). In Proc. of Technical Communications of International Conference on Logic Programming. OASICS, vol. 52. Schloss Dagstuhl – Leibniz-Zentrum fuer Informatik, 1:1–1:15.

5. Classical negation in logic programs and disjunctive databases

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Extended High-Utility Pattern Mining: An Answer Set Programming-Based Framework and Applications;Theory and Practice of Logic Programming;2023-04-19

2. SLAS: Speed and Lane Advisory System for Highway Navigation;2022 IEEE 61st Conference on Decision and Control (CDC);2022-12-06

3. Compilation of Aggregates in ASP;Electronic Proceedings in Theoretical Computer Science;2021-09-17

4. DualGrounder: Lazy Instantiation via Clingo Multi-shot Framework;Logics in Artificial Intelligence;2021

5. Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search;Fundamenta Informaticae;2020-12-18