Exploiting partial assignments for efficient evaluation of answer set programs with external source access
From MaRDI portal
Publication:4580278
zbMATH Open1448.68398MaRDI QIDQ4580278FDOQ4580278
Authors: Thomas Eiter, Tobias Kaminski, Christoph Redl, Antonius Weinzierl
Publication date: 14 August 2018
Full work available at URL: https://www.jair.org/index.php/jair/article/view/11221
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic in artificial intelligence (68T27)
Cited In (11)
- Domain expansion for ASP-programs with external sources
- A model building framework for answer set programming with external computations
- Answer set programming with external sources
- Logic Programming and Nonmonotonic Reasoning
- Inlining external sources in answer set programs
- Answer set programming with external source access
- Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More
- Pruning external minimality checking for answer set programs using semantic dependencies
- Exploiting answer set programming with external sources for meta-interpretive learning
- Exploiting unfounded sets for HEX-program evaluation
- Conflict-driven ASP solving with external sources
This page was built for publication: Exploiting partial assignments for efficient evaluation of answer set programs with external source access
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580278)