ASP programs with groundings of small treewidth

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

Authors: Bernhard Bliem 

Publication date: 26 June 2018

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

Recommendations

• The impact of treewidth on grounding and solving of answer set programs
• Debugging non-ground ASP programs with choice rules, cardinality and weight constraints
• scientific article; zbMATH DE number 4041306
• ASP with non-herbrand partial functions: a language and system for practical use
• Logic Programming and Nonmonotonic Reasoning
• Arguing correctness of ASP programs with aggregates
• Experimenting with Look-Back Heuristics for Hard ASP Programs
• Generalized structured programs and loop trees
• scientific article; zbMATH DE number 1107741

Mathematics Subject Classification ID

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

Cited In (2)

• The impact of treewidth on grounding and solving of answer set 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)