Dr. Jorge Fandinno

University of Potsdam
Institute of Computer Science
August-Bebel-Str. 89
D-14482 Potsdam

Office complex III, House 4, Room 02.11
directly at the Griebnitzsee S-Bahn station

Phone   +49-331-977-3091
Fax   +49-331-977-3122
Email  jorgefandinno@gmail.com

Publications

2020

  1. Cabalar, P., Fandinno, J., Schaub, T., & Wanko, P. (2020). A Uniform Treatment of Aggregates and Constraints in Hybrid ASP. CoRR, abs/2003.04176. [pdf] [bib]
  2. Cabalar, P., Fandinno, J., Schaub, T., & Wanko, P. (2020). An ASP Semantics for Constraints Involving Conditional Aggregates. In ECAI (Vol. 325, pp. 664–671). IOS Press. [pdf] [bib]
  3. Cabalar, P., Fandinno, J., Schaub, T., & Wanko, P. (2020). An ASP semantics for Constraints involving Conditional Aggregates. CoRR, abs/2002.06911. [pdf] [bib]
  4. Cabalar, P., Fandinno, J., Garea, J., Romero, J., & Schaub, T. (2020). eclingo: A solver for Epistemic Logic Programs. CoRR, abs/2008.02018. [pdf] [bib]
  5. Aguado, F., Cabalar, P., Fandinno, J., Pérez, G., & Vidal, C. (2020). Explicit Negation in Linear-Dynamic Equilibrium Logic. In ECAI (Vol. 325, pp. 569–576). IOS Press. [pdf] [bib]
  6. Aguado, F., Cabalar, P., Fandinno, J., Pearce, D., Pérez, G., & Vidal, C. (2020). Forgetting Auxiliary Atoms in Forks (Extended Abstract). In IJCAI (pp. 5005–5009). ijcai.org. [bib]
  7. Cabalar, P., Fandinno, J., & Lierler, Y. (2020). Modular Answer Set Programming as a Formal Specification Language. CoRR, abs/2008.02015. [bib]
  8. Cabalar, P., Fandinno, J., & del Cerro, L. F. (2020). On the Splitting Property for Epistemic Logic Programs (Extended Abstract). In IJCAI (pp. 4721–4725). ijcai.org. [bib]
  9. Hecher, M., & Fandinno, J. (2020). Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard. CoRR, abs/2007.04620. [bib]
  10. Fandinno, J., Lifschitz, V., Lühne, P., & Schaub, T. (2020). Verifying Tight Logic Programs with anthem and Vampire. CoRR, abs/2008.02025. [pdf] [bib]

2019

  1. Aguado, F., Cabalar, P., Fandinno, J., Muñiz, B., Pérez, G., & Suárez, F. (2019). A Rule-Based System for Explainable Donor-Patient Matching in Liver Transplantation. In ICLP Technical Communications (Vol. 306, pp. 266–272). [pdf] [bib]
  2. Fandinno, J., & Schulz, C. (2019). Answering the "why" in answer set programming - A survey of explanation approaches. TPLP, 19(2), 114–203. [pdf] [bib]
  3. Cabalar, P., Fandinno, J., & del Cerro, L. F. (2019). Dynamic Epistemic Logic with ASP Updates: Application to Conditional Planning. CoRR, abs/1905.10621. [pdf] [bib]
  4. Aguado, F., Cabalar, P., Fandinno, J., Pearce, D., Pérez, G., & Vidal, C. (2019). Forgetting auxiliary atoms in forks. Artif. Intell., 275, 575–601. [pdf] [bib]
  5. Fandinno, J. (2019). Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting. CoRR, abs/1907.09247. [bib]
  6. Fandinno, J. (2019). Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting. TPLP, 19(5-6), 671–687. [pdf] [bib]
  7. Cabalar, P., Fandinno, J., & del Cerro, L. F. (2019). Founded World Views with Autoepistemic Equilibrium Logic. In LPNMR (Vol. 11481, pp. 134–147). Springer. [pdf] [bib]
  8. Cabalar, P., Fandinno, J., & del Cerro, L. F. (2019). Founded World Views with Autoepistemic Equilibrium Logic. CoRR, abs/1902.07741. [bib]
  9. Cabalar, P., Fandinno, J., Schaub, T., & Schellhorn, S. (2019). Gelfond-Zhang aggregates as propositional formulas. Artif. Intell., 274, 26–43. [pdf] [bib]
  10. Cabalar, P., Fandinno, J., Schaub, T., & Schellhorn, S. (2019). Lower Bound Founded Logic of Here-and-There. In JELIA (Vol. 11468, pp. 509–525). Springer. [pdf] [bib]
  11. Dvorák, W., Fandinno, J., & Woltran, S. (2019). On the expressive power of collective attacks. Argument & Computation, 10(2), 191–230. [bib]
  12. Saldanha, E.-A. D., & Fandinno, J. (2019). On the Relation between Weak Completion Semantics and Answer Set Semantics. CoRR, abs/1910.07278. [pdf] [bib]
  13. Fandinno, J., & Fichte, J. K. (2019). Proceedings of the twelfth Workshop on Answer Set Programming and Other Computing Paradigms 2019. CoRR, abs/1912.09211. [bib]
  14. Aguado, F., Cabalar, P., Fandinno, J., Pearce, D., Pérez, G., & Vidal, C. (2019). Revisiting Explicit Negation in Answer Set Programming. CoRR, abs/1907.11467. [bib]
  15. Aguado, F., Cabalar, P., Fandinno, J., Pearce, D., Pérez, G., & Vidal, C. (2019). Revisiting Explicit Negation in Answer Set Programming. TPLP, 19(5-6), 908–924. [pdf] [bib]
  16. Cabalar, P., Fandinno, J., & del Cerro, L. F. (2019). Splitting Epistemic Logic Programs. In LPNMR (Vol. 11481, pp. 120–133). Springer. [pdf] [bib]

2018

  1. Fandinno, J., & Schulz, C. (2018). Answering the "why" in Answer Set Programming - A Survey of Explanation Approaches. CoRR, abs/1809.08034. [bib]
  2. Cayrol, C., Fandinno, J., del Cerro, L. F., & Lagasquie-Schiex, M.-C. (2018). Argumentation Frameworks with Recursive Attacks and Evidence-Based Supports. In FoIKS (Vol. 10833, pp. 150–169). Springer. [bib]
  3. Fandinno, J., & del Cerro, L. F. (2018). Constructive Logic Covers Argumentation and Logic Programming. In KR (pp. 128–137). AAAI Press. [pdf] [bib]
  4. Cabalar, P., Fandinno, J., del Cerro, L. F., & Pearce, D. (2018). Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates. CoRR, abs/1805.00660. [bib]
  5. Cabalar, P., Fandinno, J., del Cerro, L. F., & Pearce, D. (2018). Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates. TPLP, 18(3-4), 390–405. [pdf] [bib]
  6. Cabalar, P., Fandinno, J., Schaub, T., & Schellhorn, S. (2018). Lower Bound Founded Logic of Here-and-There: A Preliminary Report. In NMR@KR (pp. 31–41). [pdf] [bib]
  7. Dvorák, W., Fandinno, J., & Woltran, S. (2018). On the Expressive Power of Collective Attacks. In COMMA (Vol. 305, pp. 49–60). IOS Press. [bib]
  8. Fandinno, J., & Fichte, J. K. (2018). Proceedings of the elevent Workshop on Answer Set Programming and Other Computing Paradigms 2018. CoRR, abs/1812.03508. [bib]
  9. Cabalar, P., Fandinno, J., & del Cerro, L. F. (2018). Splitting Epistemic Logic Programs. CoRR, abs/1812.08763. [bib]
  10. Cayrol, C., Fandinno, J., del Cerro, L. F., & Lagasquie-Schiex, M.-C. (2018). Structure-Based Semantics of Argumentation Frameworks with Higher-Order Attacks and Supports. In COMMA (Vol. 305, pp. 29–36). IOS Press. [bib]

2017

  1. Cabalar, P., & Fandinno, J. (2017). Enablers and inhibitors in causal justifications of logic programs. TPLP, 17(1), 49–74. [pdf] [bib]
  2. Aguado, F., Cabalar, P., Fandinno, J., Pearce, D., Pérez, G., & Vidal, C. (2017). Forgetting Auxiliary Atoms in Forks. In ASPOCP@LPNMR (Vol. 1868). CEUR-WS.org. [bib]
  3. Cabalar, P., Fandinno, J., Schaub, T., & Schellhorn, S. (2017). Gelfond-Zhang Aggregates as Propositional Formulas. In LPNMR (Vol. 10377, pp. 117–131). Springer. [pdf] [bib]
  4. Cabalar, P., Fandinno, J., del Cerro, L. F., Pearce, D., & Valverde Agustı́n. (2017). On the Properties of Atom Definability and Well-Supportedness in Logic Programming. In EPIA (Vol. 10423, pp. 624–636). Springer. [pdf] [bib]
  5. Cayrol, C., Fandinno, J., del Cerro, L. F., & Lagasquie-Schiex, M.-C. (2017). Valid Attacks in Argumentation Frameworks with Recursive Attacks. In COMMONSENSE (Vol. 2052). CEUR-WS.org. [bib]

2016

  1. Fandinno, J. (2016). Deriving Conclusions From Non-Monotonic Cause-Effect Relations. CoRR, abs/1608.00867. [bib]
  2. Fandinno, J. (2016). Deriving conclusions from non-monotonic cause-effect relations. TPLP, 16(5-6), 670–687. [pdf] [bib]
  3. Cabalar, P., & Fandinno, J. (2016). Enablers and Inhibitors in Causal Justifications of Logic Programs. CoRR, abs/1602.06897. [bib]
  4. Cabalar, P., & Fandinno, J. (2016). Justifications for Programs with Disjunctive and Causal-choice Rules. CoRR, abs/1608.00870. [bib]
  5. Cabalar, P., & Fandinno, J. (2016). Justifications for programs with disjunctive and causal-choice rules. TPLP, 16(5-6), 587–603. [pdf] [bib]
  6. Fandinno, J. (2016). Towards Deriving Conclusions from Cause-effect Relations. Fundam. Inform., 147(1), 93–131. [bib]

2015

  1. Cabalar, P., & Fandinno, J. (2015). Enablers and Inhibitors in Causal Justifications of Logic Programs. In LPNMR (Vol. 9345, pp. 199–212). Springer. [pdf] [bib]

2014

  1. Cabalar, P., Fandinno, J., & Fink, M. (2014). Causal Graph Justifications of Logic Programs. CoRR, abs/1409.7281. [bib]
  2. Cabalar, P., Fandinno, J., & Fink, M. (2014). Causal Graph Justifications of Logic Programs. TPLP, 14(4-5), 603–618. [pdf] [bib]

2013

  1. Fandinno, J. (2013). Algebraic Approach to Causal Logic Programs. TPLP, 13(4-5-Online-Supplement). [bib]
  2. Cabalar, P., & Fandinno, J. (2013). An Algebra of Causal Chains. CoRR, abs/1312.6134. [bib]