Domain-Specific Heuristics in Answer Set Programming: A Declarative Non-Monotonic Approach

DOI10.1613/JAIR.1.14091MaRDI QIDQ5870535OpenAlexWikidataFDO

Authors Richard Comploi-Taupe, Gerhard Friedrich, Konstantin Schekotihin, Antonius Weinzierl

Publication date 9 January 2023

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.1.14091

zbMATH Keywords

heuristicsnonmonotonic reasoninglogic programming

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Recommendations

• scientific article; zbMATH DE number 1890620
• Combining answer set programming and domain heuristics for solving hard industrial problems (application paper)
• Learning domain-specific heuristics for answer set solvers
• AI*IA 2005: Advances in Artificial Intelligence
• Optimizing answer set computation via heuristic-based decomposition
• Logic Programming and Nonmonotonic Reasoning
• Answer Set Programming: A Declarative Approach to Solving Search Problems
• Learning and using domain-specific heuristics in ASP solvers
• The power of non-ground rules in Answer Set Programming
• Combining Heuristics for Configuration Problems Using Answer Set Programming

Cited in

(1)

• scientific article; zbMATH DE number 7453100 (Why is no real title available?)

This page was built for publication: Domain-Specific Heuristics in Answer Set Programming: A Declarative Non-Monotonic Approach

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