Optimizing the computation of heuristics for answer set programming systems

DOI10.1007/3-540-45402-0_22MaRDI QIDQ4800163zbMATH OpenFDO

Authors Wolfgang Faber, N. Leone, Gerald Pfeifer

Publication date 2 April 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45402-0_22

Mathematics Subject Classification ID

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

Recommendations

• Experimenting with Look-Back Heuristics for Hard ASP Programs
• Optimizing answer set computation via heuristic-based decomposition
• On look-ahead heuristics in disjunctive logic programming
• AI*IA 2005: Advances in Artificial Intelligence
• Logic Programming and Nonmonotonic Reasoning

Cited in

(17)

• Extending and implementing the stable model semantics
• Optimizing personal computer configurations with heuristic-based search methods
• On look-ahead heuristics in disjunctive logic programming
• Deep learning for the generation of heuristics in answer set programming: a case study of graph coloring
• Learning domain-specific heuristics for answer set solvers
• Combining Heuristics for Configuration Problems Using Answer Set Programming
• Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers
• Evaluating search heuristics and optimization techniques in propositional satisfiability
• Optimizing answer set computation via heuristic-based decomposition
• scientific article; zbMATH DE number 7453100 (Why is no real title available?)
• Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More
• Logic Programming and Nonmonotonic Reasoning
• Experimenting with Look-Back Heuristics for Hard ASP Programs
• TOAST: Applying Answer Set Programming to Superoptimisation
• AI*IA 2005: Advances in Artificial Intelligence
• Domain-Specific Heuristics in Answer Set Programming: A Declarative Non-Monotonic Approach
• Answer set programming based on propositional satisfiability

This page was built for publication: Optimizing the computation of heuristics for answer set programming systems

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