Debugging Non-ground ASP Programs with Choice Rules, Cardinality and Weight Constraints

DOI10.1007/978-3-642-40564-8_45zbMATH Open1405.68050DBLPconf/lpnmr/PolleresFSF13OpenAlexW2274394000WikidataQ58049421 ScholiaQ58049421MaRDI QIDQ2851274FDOQ2851274

Melanie Frühstück, Gerhard Friedrich, Gottfried Schenner, Axel Polleres

Publication date: 10 October 2013

Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40564-8_45

Mathematics Subject Classification ID

Logic programming (68N17)

Cited In (9)

• Pruning external minimality checking for ASP using semantic dependencies
• Interactive Debugging of Non-ground ASP Programs
• Stepwise debugging of answer-set programs
• Debugging Non-ground ASP Programs: Technique and Graphical Tools
• Answering the “why” in answer set programming – A survey of explanation approaches
• Abstract Solvers for Computing Cautious Consequences of ASP programs
• Witnesses for Answer Sets of Logic Programs
• ASP programs with groundings of small treewidth
• Title not available (Why is that?)

This page was built for publication: Debugging Non-ground ASP Programs with Choice Rules, Cardinality and Weight Constraints

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