A parallel memory-efficient epistemic logic program solver: harder, better, faster
DOI10.1007/S10472-019-09621-1zbMath1485.68036arXiv1608.06910OpenAlexW2963072635WikidataQ128002986 ScholiaQ128002986MaRDI QIDQ2317970
Son Cao Tran, Anthony P. Leclerc, Patrick Thor Kahl
Publication date: 13 August 2019
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.06910
epistemic specificationsanswer-set programming extensionsepistemic logic program solverlogic programming toolssolver algorithms
Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42) Logic programming (68N17)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Evaluating epistemic negation in answer set programming
- Logic programming, knowledge representation, and nonmonotonic reasoning. Essays dedicated to Michael Gelfond on the occasion of his 65th birthday
- Nonmonotonic logic and temporal projection
- Conflict-driven answer set solving: from theory to practice
- Logic programming and reasoning with incomplete information
- Nested expressions in logic programs
- Autoepistemic equilibrium logic and epistemic specifications
- Manifold Answer-Set Programs and Their Applications
- Revisiting Epistemic Specifications
- New Semantics for Epistemic Specifications
- The language of epistemic specifications (refined) including a prototype solver
- Logic Programming with Graded Modality
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Logic Programming with Graded Introspection
- selp: A Single-Shot Epistemic Logic Program Solver
- Multi-shot ASP solving with clingo
This page was built for publication: A parallel memory-efficient epistemic logic program solver: harder, better, faster
