Bart Bogaerts & Antonius Weinzierl (2018):
Exploiting Justifications for Lazy Grounding of Answer Set Programs.
In: Jérôme Lang: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, July 13-19, 2018, Stockholm, Sweden..
ijcai.org,
pp. 1737–1745,
doi:10.24963/ijcai.2018/240.
Marc Denecker (1993):
Knowledge representation and reasoning in incomplete logic programming.
K.U.Leuven,
Leuven, Belgium.
Marc Denecker, Gerhard Brewka & Hannes Strass (2015):
A Formal Theory of Justifications.
In: Francesco Calimeri, Giovambattista Ianni & Mirosław Truszczyński: Logic Programming and Nonmonotonic Reasoning - 13th International Conference, LPNMR 2015, Lexington, KY, USA, September 27-30, 2015. Proceedings,
Lecture Notes in Computer Science 9345.
Springer,
pp. 250–264,
doi:10.1007/978-3-319-23264-5_22.
Phan Minh Dung (1995):
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games.
Artif. Intell. 77(2),
pp. 321 – 357,
doi:10.1016/0004-3702(94)00041-X.
Martin Gebser, Roland Kaminski, Benjamin Kaufmann & Torsten Schaub (2009):
On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers.
In: Patricia M. Hill & David Scott Warren: ICLP,
LNCS 5649.
Springer,
pp. 250–264,
doi:10.1007/978-3-642-02846-5.
Michael Gelfond & Vladimir Lifschitz (1988):
The Stable Model Semantics for Logic Programming.
In: Robert A. Kowalski & Kenneth A. Bowen: ICLP/SLP.
MIT Press,
pp. 1070–1080.
Available at http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.6050.
Hugo Gimbert & Wieslaw Zielonka (2005):
Games Where You Can Play Optimally Without Any Memory.
In: Martín Abadi & Luca de Alfaro: CONCUR 2005 - Concurrency Theory, 16th International Conference, CONCUR 2005, San Francisco, CA, USA, August 23-26, 2005, Proceedings,
Lecture Notes in Computer Science 3653.
Springer,
pp. 428–442,
doi:10.1007/11539452_33.
Ping Hou, Broes De Cat & Marc Denecker (2010):
FO(FD): Extending classical logic with rule-based fixpoint definitions.
TPLP 10(4-6),
pp. 581–596,
doi:10.1017/S1471068410000293.
Ruben Lapauw, Maurice Bruynooghe & Marc Denecker (2020):
Improving Parity Game Solvers with Justifications.
In: Dirk Beyer & Damien Zufferey: Verification, Model Checking, and Abstract Interpretation - 21st International Conference, VMCAI 2020, New Orleans, LA, USA, January 16-21, 2020, Proceedings,
Lecture Notes in Computer Science 11990.
Springer,
pp. 449–470,
doi:10.1007/978-3-030-39322-9_21.
Simon Marynissen (2022):
Advances in Justification Theory.
Department of Computer Science, KU Leuven.
Available at https://lirias.kuleuven.be/3646147.
Denecker, Marc and Bart Bogaerts (supervisors).
Simon Marynissen, Bart Bogaerts & Marc Denecker (2020):
Exploiting Game Theory for Analysing Justifications.
Theory Pract. Log. Program. 20(6),
pp. 880–894,
doi:10.1017/S1471068420000186.
Simon Marynissen, Bart Bogaerts & Marc Denecker (2021):
On the Relation Between Approximation Fixpoint Theory and Justification Theory.
In: Zhi-Hua Zhou: Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021.
ijcai.org,
pp. 1973–1980,
doi:10.24963/ijcai.2021/272.
Simon Marynissen, Bart Bogaerts, Marc Denecker & Jesse Heyninck (2022):
On Nested Justification Systems.
Theory Pract. Log. Program. 22.
To appear (Accepted for ICLP 2022 special issue in TPLP).
Simon Marynissen, Niko Passchyn, Bart Bogaerts & Marc Denecker (2018):
Consistency in Justification Theory.
In: Proceedings of 17th International Workshop on Non-Monotonic Reasoning (NMR 2018), Tempe, Arizona, USA, Oct. 27-29, 2018.
AAAI Press 2018,
pp. 41–52.
Available at http://www4.uma.pt/nmr2018/NMR2018Proceedings.pdf.
Allen Van Gelder, Kenneth A. Ross & John S. Schlipf (1991):
The Well-Founded Semantics for General Logic Programs.
J. ACM 38(3),
pp. 620–650,
doi:10.1145/116825.116838.
eptcs@eptcs.org