Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

University of Nebraska at Omaha

2013

Computer Science Faculty Proceedings & Presentations

Grounding Bottleneck

Articles 1 - 1 of 1

Full-Text Articles in Physical Sciences and Mathematics

Prolog And Asp Inference Under One Roof, Marcello Balduccini, Yuliya Lierler, Peter Schüller Jan 2013

Prolog And Asp Inference Under One Roof, Marcello Balduccini, Yuliya Lierler, Peter Schüller

Computer Science Faculty Proceedings & Presentations

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 …