zbMATH — the first resource for mathematics

Prolog and ASP inference under one roof. (English) Zbl 1405.68043
Cabalar, Pedro (ed.) et al., Logic programming and nonmonotonic reasoning. 12th international conference, LPNMR 2013, Corunna, Spain, September 15–19, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40563-1/pbk). Lecture Notes in Computer Science 8148. Lecture Notes in Artificial Intelligence, 148-160 (2013).
Summary: Answer set programming (ASP) is a declarative programming paradigm stemming from logic programming that has been successfully applied in various domains. Despite amazing advancements in ASP solving, many applications still pose a challenge that is commonly referred to as grounding bottleneck. Devising, implementing, and evaluating a method that alleviates this problem for certain application domains is the focus of this paper. The proposed method is based on combining backtracking-based search algorithms employed in answer set solvers with SLDNF resolution from Prolog. Using Prolog inference on non-ground portions of a given program, both grounding time and the size of the ground program can be substantially reduced.
For the entire collection see [Zbl 1272.68012].

68N17 Logic programming
68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
DLVHEX; aspcud; ezcsp
Full Text: DOI