Experimenting with Look-Back Heuristics for Hard ASP Programs

DOI10.1007/978-3-540-72200-7_11MaRDI QIDQ5425402zbMATH OpenOpenAlexFDO

Authors Wolfgang Faber, N. Leone, Marco Maratea, F. Ricca

Publication date 13 November 2007

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

Full work available at URL https://doi.org/10.1007/978-3-540-72200-7_11

Mathematics Subject Classification ID

Logic programming (68N17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers
• On look-ahead heuristics in disjunctive logic programming
• scientific article; zbMATH DE number 1890620
• Look-back techniques for ASP programs with aggregates
• Logic Programming and Nonmonotonic Reasoning

Cited in

(10)

• ASP programs with groundings of small treewidth
• On look-ahead heuristics in disjunctive logic programming
• Learning domain-specific heuristics for answer set solvers
• Look-back techniques for ASP programs with aggregates
• Learning and using domain-specific heuristics in ASP solvers
• Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers
• scientific article; zbMATH DE number 1890620 (Why is no real title available?)
• scientific article; zbMATH DE number 7453100 (Why is no real title available?)
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning

Describes a project that uses

Uses Software

• GNT
• BerkMin

This page was built for publication: Experimenting with Look-Back Heuristics for Hard ASP Programs

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