Evaluating Epistemic Logic Programs via Answer Set Programming with Quantifiers
Wolfgang Faber, Michael Morak
2023Year
4Citations
2Top-tier citations
Abstract
In this paper we introduce a simple way to evaluate epistemic logic programs by means of answer set programming with quantifiers, a recently proposed extension of answer set programming. The method can easily be adapted for most of the many semantics that were proposed for epistemic logic programs. We evaluate the proposed transformation on existing benchmarks using a recently proposed solver for answer set programming with quantifiers, which relies on QBF solvers.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 481897d3-790c-48c0-86d9-c880bfa56090Cited by top-tier papers2
- 2-ASP(Q) Solving Based on CEGARAndrea Cuteri, Giuseppe Mazzotta, Francesco RiccaAAAI 2026 · 1 citation
- Solving Epistemic Logic Programs Using Generate-and-Test with PropagationJorge Fandinno, Lute LilloAAAI 2025 · 1 citation
Related papers
- Structural Decompositions of Epistemic Logic ProgramsMarkus Hecher, Michael Morak, Stefan WoltranAAAI 2020 · 15 citations
- Automatically Verifying Expressive Epistemic Properties of ProgramsFrancesco Belardinelli, Ioana Boureanu, Vadim Malvone, Fortunat RajaonaAAAI 2023 · 1 citation
- Recursive Aggregates as Intensional Functions in Answer Set Programming: Semantics and Strong EquivalenceJorge Fandinno, Zachary HansenAAAI 2025 · 2 citations
- ApproxASP - a Scalable Approximate Answer Set CounterMohimenul Kabir, Flavio O. Everardo, Ankit K. Shukla, Markus Hecher et al.AAAI 2022 · 21 citations
- Program Semantics and Verification Technique for AI-Centred ProgramsSolofomampionona Fortunat Rajaona, Ioana Boureanu, Vadim Malvone, Francesco BelardinelliFM 2023 · 1 citation
