Evaluating Epistemic Logic Programs via Answer Set Programming with Quantifiers
Wolfgang Faber, Michael Morak
2023年份
4被引次数
2顶会引用
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- 2-ASP(Q) Solving Based on CEGARAndrea Cuteri, Giuseppe Mazzotta, Francesco RiccaAAAI 2026 · 被引用 1 次
- Solving Epistemic Logic Programs Using Generate-and-Test with PropagationJorge Fandinno, Lute LilloAAAI 2025 · 被引用 1 次
相关 Paper
- Structural Decompositions of Epistemic Logic ProgramsMarkus Hecher, Michael Morak, Stefan WoltranAAAI 2020 · 被引用 15 次
- Automatically Verifying Expressive Epistemic Properties of ProgramsFrancesco Belardinelli, Ioana Boureanu, Vadim Malvone, Fortunat RajaonaAAAI 2023 · 被引用 1 次
- Recursive Aggregates as Intensional Functions in Answer Set Programming: Semantics and Strong EquivalenceJorge Fandinno, Zachary HansenAAAI 2025 · 被引用 2 次
- ApproxASP - a Scalable Approximate Answer Set CounterMohimenul Kabir, Flavio O. Everardo, Ankit K. Shukla, Markus Hecher 等AAAI 2022 · 被引用 21 次
- Program Semantics and Verification Technique for AI-Centred ProgramsSolofomampionona Fortunat Rajaona, Ioana Boureanu, Vadim Malvone, Francesco BelardinelliFM 2023 · 被引用 1 次
