Blending lazy-grounding and CDNL search for answer-set solving

DOI10.1007/978-3-319-61660-5_17zbMath1491.68262OpenAlexW2729610333MaRDI QIDQ2401934

Antonius Weinzierl

Publication date: 5 September 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-61660-5_17

Mathematics Subject Classification ID

Logic programming (68N17) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (10)

Partial Compilation of ASP Programs ⋮ Incremental Answer Set Programming with Overgrounding ⋮ Unnamed Item ⋮ Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More ⋮ Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints ⋮ Optimizing Answer Set Computation via Heuristic-Based Decomposition ⋮ Efficiently Coupling the I-DLV Grounder with ASP Solvers ⋮ Abstraction for non-ground answer set programs ⋮ Learning programs by learning from failures ⋮ Knowledge representation analysis of graph mining

This page was built for publication: Blending lazy-grounding and CDNL search for answer-set solving