IASCAR: incremental answer set counting by anytime refinement

DOI10.1007/978-3-031-15707-3_17OpenAlexW4293180278MaRDI QIDQ2694570

Markus Hecher, Dominik Rusovac, Sarah A. Gaggl, Johannes K. Fichte

Publication date: 4 April 2023

Full work available at URL: https://doi.org/10.1007/978-3-031-15707-3_17

zbMATH Keywords

knowledge compilationASPanswer set counting

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cites Work

• Unnamed Item
• Unnamed Item
• Conflict-driven answer set solving: from theory to practice
• Inference and learning in probabilistic logic programs using weighted Boolean formulas
• Knowledge compilation of logic programs using approximation fixpoint theory
• Why are there so many loop formulas?

This page was built for publication: IASCAR: incremental answer set counting by anytime refinement