eclingo : A Solver for Epistemic Logic Programs

DOI10.1017/S1471068420000228zbMath1468.68053arXiv2008.02018OpenAlexW3088535933MaRDI QIDQ5140019

Javier Romero, Javier Garea, Torsten Schaub, Jorge Fandinno, Pedro Cabalar

Publication date: 13 December 2020

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.02018

zbMATH Keywords

nonmonotonic reasoninganswer-set programmingconformant planningepistemic logic programs

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items (5)

Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? ⋮ Thirty years of Epistemic Specifications ⋮ Autoepistemic answer set programming ⋮ eclingo ⋮ Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs

Uses Software

• Gringo
• Clingo
• Wviews

Cites Work

• Unnamed Item
• Logic programming and reasoning with incomplete information
• Splitting epistemic logic programs
• Founded world views with autoepistemic equilibrium logic
• Logic programming and nonmonotonic reasoning. 15th international conference, LPNMR 2019, Philadelphia, PA, USA, June 3--7, 2019. Proceedings
• Revisiting Epistemic Specifications
• The language of epistemic specifications (refined) including a prototype solver
• Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting
• Multi-shot ASP solving with clingo

This page was built for publication: eclingo : A Solver for Epistemic Logic Programs