Manuel Bichler, Michael Morak & Stefan Woltran (2018):
Single-Shot Epistemic Logic Program Solving.
In: Proc. IJCAI,
pp. 1714–1720,
doi:10.24963/ijcai.2018/237.
Gerhard Brewka, Thomas Eiter & Miroslaw Truszczynski (2011):
Answer set programming at a glance.
Commun. ACM 54(12),
pp. 92–103,
doi:10.1145/2043174.2043195.
Pedro Cabalar, David Pearce & Agustín Valverde (2007):
Minimal Logic Programs.
In: Proc. ICLP,
LNCS 4670.
Springer,
pp. 104–118,
doi:10.1007/978-3-540-74610-2_8.
Thomas Eiter, Michael Fink, Jörg Pührer, Hans Tompits & Stefan Woltran (2013):
Model-based recasting in answer-set programming.
Journal of Applied Non-Classical Logics 23(1-2),
pp. 75–104,
doi:10.1080/11663081.2013.799318.
Thomas Eiter & Georg Gottlob (1995):
On the Computational Cost of Disjunctive Logic Programming: Propositional Case.
Ann. Math. Artif. Intell. 15(3-4),
pp. 289–323,
doi:10.1007/BF01536399.
Wolfgang Faber, Michael Morak & Stefan Woltran (2019):
Strong Equivalence for Epistemic Logic Programs Made Easy.
In: Proc. AAAI.
Luis Fariñas del Cerro, Andreas Herzig & Ezgi Iraz Su (2015):
Epistemic Equilibrium Logic.
In: Proc. IJCAI,
pp. 2964–2970.
Available at http://ijcai.org/Abstract/15/419.
Michael Gelfond (1994):
Logic Programming and Reasoning with Incomplete Information.
Ann. Math. Artif. Intell. 12(1-2),
pp. 89–116,
doi:10.1007/BF01530762.
Michael Gelfond (2011):
New Semantics for Epistemic Specifications.
In: Proc. LPNMR,
LNCS 6645.
Springer,
pp. 260–265,
doi:10.1007/978-3-642-20895-9_29.
Michael Gelfond & Vladimir Lifschitz (1988):
The Stable Model Semantics for Logic Programming.
In: Proc. ICLP.
MIT Press,
pp. 1070–1080.
Michael Gelfond & Vladimir Lifschitz (1991):
Classical Negation in Logic Programs and Disjunctive Databases.
New Generation Comput. 9(3/4),
pp. 365–386,
doi:10.1007/BF03037169.
Patrick Thor Kahl (2014):
Refining the Semantics for Epistemic Logic Programs.
Texas Tech University,
Texas, USA.
Patrick Thor Kahl & Anthony P. Leclerc (2018):
Epistemic Logic Programs with World View Constraints.
In: Proc. ICLP (Technical Communications),
pp. 1:1–1:17,
doi:10.4230/OASIcs.ICLP.2018.1.
Patrick Thor Kahl, Richard Watson, Evgenii Balai, Michael Gelfond & Yuanlin Zhang (2015):
The Language of Epistemic Specifications (Refined) Including a Prototype Solver.
J. Log. Comput. 25.
Vladimir Lifschitz, David Pearce & Agustín Valverde (2001):
Strongly equivalent logic programs.
ACM Trans. Comput. Log. 2(4),
pp. 526–541,
doi:10.1145/502166.502170.
Vladimir Lifschitz, Lappoon R. Tang & Hudson Turner (1999):
Nested Expressions in Logic Programs.
Ann. Math. Artif. Intell. 25(3-4),
pp. 369–389,
doi:10.1023/A:1018978005636.
Fangzhen Lin & Yin Chen (2007):
Discovering Classes of Strongly Equivalent Logic Programs.
J. Artif. Intell. Res. 28,
pp. 431–451,
doi:10.1613/jair.2131.
David Pearce, Hans Tompits & Stefan Woltran (2009):
Characterising equilibrium logic and nested logic programs: Reductions and Complexity.
TPLP 9(5),
pp. 565–616,
doi:10.1017/S147106840999010X.
Torsten Schaub & Stefan Woltran (2018):
Special Issue on Answer Set Programming.
KI 32(2-3),
doi:10.1007/s13218-018-0554-8.
Yi-Dong Shen & Thomas Eiter (2016):
Evaluating epistemic negation in answer set programming.
Artif. Intell. 237,
pp. 115–135,
doi:10.1016/j.artint.2016.04.004.
Tran Cao Son, Tiep Le, Patrick Thor Kahl & Anthony P. Leclerc (2017):
On Computing World Views of Epistemic Logic Programs.
In: Proc. IJCAI,
pp. 1269–1275,
doi:10.24963/ijcai.2017/176.
Miroslaw Truszczynski (2011):
Revisiting Epistemic Specifications.
In: Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning - Essays Dedicated to Michael Gelfond on the Occasion of His 65th Birthday,
pp. 315–333,
doi:10.1007/978-3-642-20832-4_20.
Hudson Turner (2003):
Strong equivalence made easy: nested expressions and weight constraints.
TPLP 3(4-5),
pp. 609–622,
doi:10.1017/S1471068403001819.
Kewen Wang & Yan Zhang (2005):
Nested Epistemic Logic Programs.
In: Proc. LPNMR,
LNCS 3662.
Springer,
pp. 279–290,
doi:10.1007/11546207_22.
eptcs@eptcs.org