Performance tuning in answer set programming

DOI10.1007/978-3-319-23264-5_17MaRDI QIDQ3449203zbMATH OpenOpenAlexFDO

Authors Matthew Buddenhagen, Yuliya Lierler

Publication date 4 November 2015

Published in Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-23264-5_17

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Complex optimization in answer set programming
• Logic Programming and Nonmonotonic Reasoning
• Prolog and ASP inference under one roof
• Design and results of the Fifth Answer Set Programming Competition
• The Significance of Memory Costs in Answer Set Solver Implementation

Cites work

• Conflict-Driven Answer Set Enumeration
• scientific article; zbMATH DE number 1368933 (Why is no real title available?)
• Logic Programming
• Logic programs with stable model semantics as a constraint programming paradigm
• Paramils: an automatic algorithm configuration framework
• Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming

Cited in

(9)

• Estimating grounding sizes of logic programs under answer set semantics
• Arguing correctness of ASP programs with aggregates
• First-order modular logic programs and their conservative extensions
• scientific article; zbMATH DE number 7453125 (Why is no real title available?)
• scientific article; zbMATH DE number 7455711 (Why is no real title available?)
• Modular answer set programming as a formal specification language
• Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs
• System predictor: grounding size estimator for logic programs under answer set semantics
• External behavior of a logic program and verification of refactoring

This page was built for publication: Performance tuning in answer set programming

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