Estimating grounding sizes of logic programs under answer set semantics

DOI10.1007/978-3-030-75775-5_23OpenAlexW3036025663MaRDI QIDQ2055808

Nicholas Hippen, Yuliya Lierler

Publication date: 1 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-75775-5_23

zbMATH Keywords

answer set programminglanguage optimization

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (1)

Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs

Cites Work

• Unnamed Item
• Unnamed Item
• Design and results of the Fifth Answer Set Programming Competition
• Lpopt: a rule optimization tool for answer set programming
• The Intelligent Grounder of DLV
• Performance Tuning in Answer Set Programming
• Optimizing Answer Set Computation via Heuristic-Based Decomposition

This page was built for publication: Estimating grounding sizes of logic programs under answer set semantics