Performance Tuning in Answer Set Programming

DOI10.1007/978-3-319-23264-5_17zbMath1467.68023OpenAlexW2215047634MaRDI QIDQ3449203

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)

Related Items (7)

Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs ⋮ First-order modular logic programs and their conservative extensions ⋮ Arguing correctness of ASP programs with aggregates ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Modular Answer Set Programming as a Formal Specification Language ⋮ Estimating grounding sizes of logic programs under answer set semantics

Cites Work

• Unnamed Item
• Logic programs with stable model semantics as a constraint programming paradigm
• Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming
• ParamILS: An Automatic Algorithm Configuration Framework
• Logic Programming
• Conflict-Driven Answer Set Enumeration

This page was built for publication: Performance Tuning in Answer Set Programming