IASCAR: incremental answer set counting by anytime refinement

DOI10.1007/978-3-031-15707-3_17MaRDI QIDQ2694570zbMATH OpenOpenAlexFDO

Authors Johannes K. Fichte, Sarah Alice Gaggl, Markus Hecher, Dominik Rusovac

Publication date 4 April 2023

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

zbMATH Keywords

answer set countingASPknowledge compilation

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cites work

• Conflict-driven answer set solving: from theory to practice
• scientific article; zbMATH DE number 1946853 (Why is no real title available?)
• scientific article; zbMATH DE number 1368933 (Why is no real title available?)
• 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?

Cited in

(1)

• IASCAR: incremental answer set counting by anytime refinement

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

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