ASP programs with groundings of small treewidth

DOI10.1007/978-3-319-90050-6_6OpenAlexW2800046293MaRDI QIDQ1647477

Bernhard Bliem

Publication date: 26 June 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-90050-6_6

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Generalized structured programs and loop trees 👍 👎
• Arguing correctness of ASP programs with aggregates 👍 👎
• Debugging Non-ground ASP Programs with Choice Rules, Cardinality and Weight Constraints 👍 👎
• The Impact of Treewidth on Grounding and Solving of Answer Set Programs 👍 👎
• ASP with non-herbrand partial functions: a language and system for practical use 👍 👎
• Experimenting with Look-Back Heuristics for Hard ASP Programs 👍 👎
• Logic Programming and Nonmonotonic Reasoning 👍 👎

This page was built for publication: ASP programs with groundings of small treewidth

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