Pruning external minimality checking for ASP using semantic dependencies

DOI10.1007/978-3-030-20528-7_24MaRDI QIDQ2326745zbMATH OpenOpenAlexFDO

Authors Thomas Eiter, Tobias Kaminski

Publication date 10 October 2019

Full work available at URL http://hdl.handle.net/20.500.12708/16727

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• Pruning external minimality checking for answer set programs using semantic dependencies
• Verification for ASP denotational semantics: a case study using the PVS theorem prover
• Cautious reasoning in ASP via minimal models and unsatisfiable cores
• A theory of reduced and minimal procedural dependencies
• Debugging non-ground ASP programs with choice rules, cardinality and weight constraints
• scientific article; zbMATH DE number 7453100
• scientific article; zbMATH DE number 3943859
• scientific article; zbMATH DE number 812581

Cited in

(1)

• Pruning external minimality checking for answer set programs using semantic dependencies

This page was built for publication: Pruning external minimality checking for ASP using semantic dependencies

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