An Algebra of Causal Chains. - Pedro Cabalar; Jorge Fandinno (CoRR, 2013)

Algebraic Approach to Causal Logic Programs. - Jorge Fandinno (Theory Pract. Log. Program., 2013)

A Complexity Assessment for Queries Involving Sufficient and Necessary Causes. - Pedro Cabalar; Jorge Fandiño; Michael Fink 001 (JELIA, 2014)

Causal Graph Justifications of Logic Programs. - Pedro Cabalar; Jorge Fandinno; Michael Fink 001 (Theory Pract. Log. Program., 2014)

Explaining Preferences and Preferring Explanations. - Pedro Cabalar; Jorge Fandiño (Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation, 2015)

Towards Deriving Conclusions from Cause-effect Relations. - Jorge Fandinno (Fundam. Informaticae, 2016)

Justifications for programs with disjunctive and causal-choice rules. - Pedro Cabalar; Jorge Fandinno (Theory Pract. Log. Program., 2016)

Deriving conclusions from non-monotonic cause-effect relations. - Jorge Fandinno (Theory Pract. Log. Program., 2016)

On the Properties of Atom Definability and Well-Supportedness in Logic Programming. - Pedro Cabalar; Jorge Fandinno; Luis Fariñas del Cerro; David Pearce 001; Agustín Valverde (EPIA, 2017)

Enablers and inhibitors in causal justifications of logic programs. - Pedro Cabalar; Jorge Fandinno (Theory Pract. Log. Program., 2017)

Structure-Based Semantics of Argumentation Frameworks with Higher-Order Attacks and Supports. - Claudette Cayrol; Jorge Fandinno; Luis Fariñas del Cerro; Marie-Christine Lagasquie-Schiex (COMMA, 2018)

Argumentation Frameworks with Recursive Attacks and Evidence-Based Supports. - Claudette Cayrol; Jorge Fandinno; Luis Fariñas del Cerro; Marie-Christine Lagasquie-Schiex (FoIKS, 2018)

Constructive Logic Covers Argumentation and Logic Programming. - Jorge Fandinno; Luis Fariñas del Cerro (KR, 2018)

Proceedings of the elevent Workshop on Answer Set Programming and Other Computing Paradigms 2018. - Jorge Fandinno; Johannes Klaus Fichte (CoRR, 2018)

Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates. - Pedro Cabalar; Jorge Fandinno; Luis Fariñas del Cerro; David Pearce 001 (Theory Pract. Log. Program., 2018)

Lower Bound Founded Logic of Here-and-There. - Pedro Cabalar; Jorge Fandinno; Torsten Schaub; Sebastian Schellhorn (JELIA, 2019)

Founded World Views with Autoepistemic Equilibrium Logic. - Pedro Cabalar; Jorge Fandinno; Luis Fariñas del Cerro (LPNMR, 2019)

Forgetting auxiliary atoms in forks. - Felicidad Aguado; Pedro Cabalar; Jorge Fandinno; David Pearce 001; Gilberto Pérez 001; Concepción Vidal (Artif. Intell., 2019)

Gelfond-Zhang aggregates as propositional formulas. - Pedro Cabalar; Jorge Fandinno; Torsten Schaub; Sebastian Schellhorn (Artif. Intell., 2019)

On the expressive power of collective attacks. - Wolfgang Dvorák; Jorge Fandinno; Stefan Woltran (Argument Comput., 2019)

A Rule-Based System for Explainable Donor-Patient Matching in Liver Transplantation. - Felicidad Aguado; Pedro Cabalar; Jorge Fandinno; Brais Muñiz; Gilberto Pérez 001; Francisco Suárez (ICLP Technical Communications, 2019)

On the Relation between Weak Completion Semantics and Answer Set Semantics. - Emmanuelle-Anna Dietz Saldanha; Jorge Fandinno (CoRR, 2019)

Proceedings of the twelfth Workshop on Answer Set Programming and Other Computing Paradigms 2019. - Jorge Fandinno; Johannes Klaus Fichte (CoRR, 2019)

Revisiting Explicit Negation in Answer Set Programming. - Felicidad Aguado; Pedro Cabalar; Jorge Fandinno; David Pearce 001; Gilberto Pérez 001; Concepción Vidal (Theory Pract. Log. Program., 2019)

Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting. - Jorge Fandinno (Theory Pract. Log. Program., 2019)

Answering the "why" in answer set programming - A survey of explanation approaches. - Jorge Fandinno; Claudia Schulz 001 (Theory Pract. Log. Program., 2019)

Explicit Negation in Linear-Dynamic Equilibrium Logic. - Felicidad Aguado; Pedro Cabalar; Jorge Fandinno; Gilberto Pérez 001; Concepción Vidal (ECAI, 2020)

An ASP Semantics for Constraints Involving Conditional Aggregates. - Pedro Cabalar; Jorge Fandinno; Torsten Schaub; Philipp Wanko (ECAI, 2020)

Dynamic Epistemic Logic with ASP Updates: Application to Conditional Planning. - Pedro Cabalar; Jorge Fandinno; Luis Fariñas del Cerro (ICLP Workshops, 2020)

Forgetting Auxiliary Atoms in Forks (Extended Abstract). - Felicidad Aguado; Pedro Cabalar; Jorge Fandinno; David Pearce 001; Gilberto Pérez 001; Concepción Vidal (IJCAI, 2020)

On the Splitting Property for Epistemic Logic Programs (Extended Abstract). - Pedro Cabalar; Jorge Fandinno; Luis Fariñas del Cerro (IJCAI, 2020)

A Uniform Treatment of Aggregates and Constraints in Hybrid ASP. - Pedro Cabalar; Jorge Fandinno; Torsten Schaub; Philipp Wanko (KR, 2020)

Autoepistemic answer set programming. - Pedro Cabalar; Jorge Fandinno; Luis Fariñas del Cerro (Artif. Intell., 2020)

A System for Explainable Answer Set Programming. - Pedro Cabalar; Jorge Fandinno; Brais Muñiz (ICLP Technical Communications, 2020)

eclingo : A Solver for Epistemic Logic Programs. - Pedro Cabalar; Jorge Fandinno; Javier Garea; Javier Romero 003; Torsten Schaub (Theory Pract. Log. Program., 2020)

Modular Answer Set Programming as a Formal Specification Language. - Pedro Cabalar; Jorge Fandinno; Yuliya Lierler (Theory Pract. Log. Program., 2020)

Verifying Tight Logic Programs with anthem and vampire. - Jorge Fandinno; Vladimir Lifschitz; Patrick Lühne; Torsten Schaub (Theory Pract. Log. Program., 2020)

Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard. - Jorge Fandinno; Markus Hecher (AAAI, 2021)

Valid attacks in argumentation frameworks with recursive attacks. - Claudette Cayrol; Jorge Fandinno; Luis Fariñas del Cerro; Marie-Christine Lagasquie-Schiex (Ann. Math. Artif. Intell., 2021)

Towards a Semantics for Hybrid ASP systems. - Pedro Cabalar; Jorge Fandinno; Torsten Schaub; Philipp Wanko (CoRR, 2021)

Splitting Epistemic Logic Programs. - Pedro Cabalar; Jorge Fandinno; Luis Fariñas del Cerro (Theory Pract. Log. Program., 2021)

Planning with Incomplete Information in Quantified Answer Set Programming. - Jorge Fandinno; François Laferrière; Javier Romero 003; Torsten Schaub; Tran Cao Son (Theory Pract. Log. Program., 2021)

Axiomatization of Aggregates in Answer Set Programming. - Jorge Fandinno; Zachary Hansen; Yuliya Lierler (AAAI, 2022)

Arguing Correctness of ASP Programs with Aggregates. - Jorge Fandinno; Zachary Hansen; Yuliya Lierler (LPNMR, 2022)

A polynomial reduction of forks into logic programs. - Felicidad Aguado; Pedro Cabalar; Jorge Fandinno; David Pearce 001; Gilberto Pérez 001; Concepción Vidal (Artif. Intell., 2022)

Comparing the Reasoning Capabilities of Equilibrium Theories and Answer Set Programs. - Jorge Fandinno; David Pearce 001; Concepción Vidal; Stefan Woltran (Algorithms, 2022)

Verification of Locally Tight Programs. - Jorge Fandinno; Vladimir Lifschitz (CoRR, 2022)

Thirty years of Epistemic Specifications. - Jorge Fandinno; Wolfgang Faber 001; Michael Gelfond (Theory Pract. Log. Program., 2022)

Splitting Answer Set Programs with Respect to Intensionality Statements. - Jorge Fandinno; Yuliya Lierler (AAAI, 2023)

Answer Set Programming Made Easy. - Jorge Fandinno; Seemran Mishra; Javier Romero 003; Torsten Schaub (Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems, 2023)

Recursive Aggregates as Intensional Functions. - Jorge Fandinno; Zachary Hansen (ICLP Workshops, 2023)

Treewidth-Aware Complexity for Evaluating Epistemic Logic Programs. - Jorge Fandinno; Markus Hecher (IJCAI, 2023)

On Heuer's Procedure for Verifying Strong Equivalence. - Jorge Fandinno; Vladimir Lifschitz (JELIA, 2023)

Omega-Completeness of the Logic of Here-and-There and Strong Equivalence of Logic Programs. - Jorge Fandinno; Vladimir Lifschitz (KR, 2023)

Abstract Argumentation and Answer Set Programming: Two Faces of Nelson's Logic. - Jorge Fandinno; Luis Fariñas del Cerro (Theory Pract. Log. Program., 2023)

On the Semantics of Hybrid ASP Systems Based on Clingo. - Pedro Cabalar; Jorge Fandinno; Torsten Schaub; Philipp Wanko (Algorithms, 2023)

External Behavior of a Logic Program and Verification of Refactoring. - Jorge Fandinno; Zachary Hansen; Yuliya Lierler; Vladimir Lifschitz; Nathan Temple (Theory Pract. Log. Program., 2023)

Embracing Background Knowledge in the Analysis of Actual Causality: An Answer Set Programming Approach. - Michael Gelfond; Jorge Fandinno; Evgenii Balai (Theory Pract. Log. Program., 2023)

Positive Dependency Graphs Revisited. - Jorge Fandinno; Vladimir Lifschitz (Theory Pract. Log. Program., 2023)

tExplain: Information Extraction with Explanations. - Pedro Cabalar; Adrian Dorsey; Jorge Fandinno; Yuliya Lierler; Brais Muñiz; Joel Sare (LPNMR, 2024)

Deductive Systems for Logic Programs with Counting: Preliminary Report. - Jorge Fandinno; Vladimir Lifschitz (LPNMR, 2024)

Axiomatization of Non-Recursive Aggregates in First-Order Answer Set Programming. - Jorge Fandinno; Zachary Hansen; Yuliya Lierler (J. Artif. Intell. Res., 2024)

Locally Tight Programs. - Jorge Fandinno; Vladimir Lifschitz; Nathan Temple (Theory Pract. Log. Program., 2024)

Syntactic ASP forgetting with forks. - Felicidad Aguado; Pedro Cabalar; Jorge Fandinno; David Pearce 001; Gilberto Pérez 001; Concepción Vidal (Artif. Intell., 2024)

Recursive Aggregates as Intensional Functions in Answer Set Programming: Semantics and Strong Equivalence. - Jorge Fandinno; Zachary Hansen (AAAI, 2025)

Solving Epistemic Logic Programs Using Generate-and-Test with Propagation. - Jorge Fandinno; Lute Lillo (AAAI, 2025)

Strong Equivalence in Answer Set Programming with Constraints. - Pedro Cabalar; Jorge Fandinno; Torsten Schaub; Philipp Wanko (CoRR, 2025)

Splitting Answer Set Programs with respect to Intensionality Statements (Extended Version). - Jorge Fandinno; Yuliya Lierler (CoRR, 2025)

Anthem 2.0: Automated Reasoning for Answer Set Programming. - Jorge Fandinno; Christoph Glinzer; Zachary Hansen; Jan Heuer; Yuliya Lierler; Vladimir Lifschitz; Torsten Schaub; Tobias Stolzmann (CoRR, 2025)