Journal of the ACM (JACM)
Modal logic
ASSAT: computing answer sets of a logic program by SAT solvers
Artificial Intelligence - Special issue on nonmonotonic reasoning
Why are there so many loop formulas?
ACM Transactions on Computational Logic (TOCL)
Modeling epistemic knowledge about users
ACS'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Applied Computer Science - Volume 7
A Knowledge Based Formal Language for Securing Information Systems
KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part I
Answer set modules for logical agents
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
A modal logic for information system security
AISC '11 Proceedings of the Ninth Australasian Information Security Conference - Volume 116
International Journal of Approximate Reasoning
Hi-index | 0.00 |
Although epistemic logic programming has an enhanced capacity to handle complex incomplete information reasoning and represent agents' epistemic behaviours, it embeds a significantly higher computational complexity than non-disjunctive and disjunctive answer set programming. In this paper, we investigate some important properties of epistemic logic programs. In particular, we show that Lee and Lifschitz's result on loop formulas for disjunctive logic programs can be extended to a special class of epistemic logic programs. We also study the polysize model property for epistemic logic programs. Based on these discoveries, we identify two non-trivial classes of epistemic logic programs whose consistency checking complexity is reduced from PSPACE-complete to NP-complete and Σ2P -complete respectively. We observe that many important applications on epistemic representation fall into these two classes of epistemic logic programs.