default search action
Jorge Fandinno
Jorge Fandiño
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j30]Felicidad Aguado, Pedro Cabalar
, Jorge Fandinno, David Pearce, Gilberto Pérez, Concepción Vidal:
Syntactic ASP forgetting with forks. Artif. Intell. 326: 104033 (2024) - [j29]Jorge Fandinno, Zachary Hansen, Yuliya Lierler:
Axiomatization of Non-Recursive Aggregates in First-Order Answer Set Programming. J. Artif. Intell. Res. 80: 977-1031 (2024) - [c34]Jorge Fandinno
Deductive Systems for Logic Programs with Counting: Preliminary Report. LPNMR 2024: 1-14 - [c33]Pedro Cabalar, Adrian Dorsey, Jorge Fandinno, Yuliya Lierler, Brais Muñiz, Joel Sare:
tExplain: Information Extraction with Explanations. LPNMR 2024: 43-56 - [i31]Jorge Fandinno, Lute Lillo:
Solving Epistemic Logic Programs using Generate-and-Test with Propagation. CoRR abs/2410.22130 (2024) - 2023
- [j28]Pedro Cabalar
On the Semantics of Hybrid ASP Systems Based on Clingo. Algorithms 16(4): 185 (2023) - [j27]Jorge Fandinno
Abstract Argumentation and Answer Set Programming: Two Faces of Nelson's Logic. Theory Pract. Log. Program. 23(2): 444-467 (2023) - [j26]Michael Gelfond
Embracing Background Knowledge in the Analysis of Actual Causality: An Answer Set Programming Approach. Theory Pract. Log. Program. 23(4): 715-729 (2023) - [j25]Jorge Fandinno
External Behavior of a Logic Program and Verification of Refactoring. Theory Pract. Log. Program. 23(4): 933-947 (2023) - [j24]Jorge Fandinno
Positive Dependency Graphs Revisited. Theory Pract. Log. Program. 23(5): 1128-1137 (2023) - [c32]Jorge Fandinno, Yuliya Lierler:
Splitting Answer Set Programs with Respect to Intensionality Statements. AAAI 2023: 6338-6345 - [c31]Jorge Fandinno
Answer Set Programming Made Easy. Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems 2023: 133-150 - [c30]Jorge Fandinno, Zachary Hansen:
Recursive Aggregates as Intensional Functions. ICLP Workshops 2023 - [c29]Jorge Fandinno, Markus Hecher:
Treewidth-Aware Complexity for Evaluating Epistemic Logic Programs. IJCAI 2023: 3203-3211 - [c28]Jorge Fandinno, Vladimir Lifschitz:
On Heuer's Procedure for Verifying Strong Equivalence. JELIA 2023: 253-261 - [c27]Jorge Fandinno, Vladimir Lifschitz:
Omega-Completeness of the Logic of Here-and-There and Strong Equivalence of Logic Programs. KR 2023: 240-251 - [i30]Jorge Fandinno, Zachary Hansen, Yuliya Lierler, Vladimir Lifschitz, Nathan Temple:
External Behavior of a Logic Program and Verification of Refactoring. CoRR abs/2305.17485 (2023) - [i29]Michael Gelfond, Jorge Fandinno, Evgenii Balai:
Embracing Background Knowledge in the Analysis of Actual Causality: An Answer Set Programming Approach. CoRR abs/2306.03874 (2023) - 2022
- [j23]Felicidad Aguado, Pedro Cabalar, Jorge Fandinno, David Pearce, Gilberto Pérez, Concepción Vidal
A polynomial reduction of forks into logic programs. Artif. Intell. 308: 103712 (2022) - [j22]Jorge Fandinno
Comparing the Reasoning Capabilities of Equilibrium Theories and Answer Set Programs. Algorithms 15(6): 201 (2022) - [j21]Jorge Fandinno
Thirty years of Epistemic Specifications. Theory Pract. Log. Program. 22(6): 1043-1083 (2022) - [c26]Jorge Fandinno, Zachary Hansen
Axiomatization of Aggregates in Answer Set Programming. AAAI 2022: 5634-5641 - [c25]Felicidad Aguado
Syntactic ASP Forgetting with Forks. LPNMR 2022: 3-15 - [c24]Jorge Fandinno
Arguing Correctness of ASP Programs with Aggregates. LPNMR 2022: 190-202 - [e2]Joaquín Arias, Roberta Calegari, Luke Dickens, Wolfgang Faber, Jorge Fandinno, Gopal Gupta, Markus Hecher, Daniela Inclezan, Emily LeBlanc, Michael Morak, Elmer Salazar, Jessica Zangari:
Proceedings of the International Conference on Logic Programming 2022 Workshops co-located with the 38th International Conference on Logic Programming (ICLP 2022), Haifa, Israel, July 31st - August 1st, 2022. CEUR Workshop Proceedings 3193, CEUR-WS.org 2022 [contents] - [i28]Jorge Fandinno, Luis Fariñas del Cerro:
Abstract argumentation and answer set programming: two faces of Nelson's logic. CoRR abs/2203.14405 (2022) - [i27]Jorge Fandinno, Vladimir Lifschitz:
Verification of Locally Tight Programs. CoRR abs/2204.10789 (2022) - [i26]Jorge Fandinno, Vladimir Lifschitz:
Positive Dependency Graphs Revisited. CoRR abs/2207.08579 (2022) - 2021
- [j20]Claudette Cayrol, Jorge Fandinno, Luis Fariñas del Cerro, Marie-Christine Lagasquie-Schiex
Valid attacks in argumentation frameworks with recursive attacks. Ann. Math. Artif. Intell. 89(1-2): 53-101 (2021) - [j19]Pedro Cabalar, Jorge Fandinno
Splitting Epistemic Logic Programs. Theory Pract. Log. Program. 21(3): 296-316 (2021) - [j18]Jorge Fandinno
Planning with Incomplete Information in Quantified Answer Set Programming. Theory Pract. Log. Program. 21(5): 663-679 (2021) - [c23]Jorge Fandinno, Markus Hecher:
Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard. AAAI 2021: 6312-6320 - [i25]Pedro Cabalar, Jorge Fandinno, Torsten Schaub, Philipp Wanko:
Towards a Semantics for Hybrid ASP systems. CoRR abs/2108.03061 (2021) - [i24]Jorge Fandinno, François Laferrière, Javier Romero, Torsten Schaub, Tran Cao Son:
Planning with Incomplete Information in Quantified Answer Set Programming. CoRR abs/2108.06405 (2021) - [i23]Jorge Fandinno, Wolfgang Faber, Michael Gelfond:
Thirty years of Epistemic Specifications. CoRR abs/2108.07669 (2021) - [i22]Jorge Fandinno, Seemran Mishra, Javier Romero, Torsten Schaub:
Answer Set Programming Made Easy. CoRR abs/2111.06366 (2021) - 2020
- [j17]Pedro Cabalar, Jorge Fandinno, Luis Fariñas del Cerro:
Autoepistemic answer set programming. Artif. Intell. 289: 103382 (2020) - [j16]Jorge Fandinno
Verifying Tight Logic Programs with anthem and vampire. Theory Pract. Log. Program. 20(5): 735-750 (2020) - [j15]Pedro Cabalar
Modular Answer Set Programming as a Formal Specification Language. Theory Pract. Log. Program. 20(5): 767-782 (2020) - [j14]Pedro Cabalar
eclingo : A Solver for Epistemic Logic Programs. Theory Pract. Log. Program. 20(6): 834-847 (2020) - [c22]Felicidad Aguado, Pedro Cabalar, Jorge Fandinno, Gilberto Pérez, Concepción Vidal
Explicit Negation in Linear-Dynamic Equilibrium Logic. ECAI 2020: 569-576 - [c21]Pedro Cabalar, Jorge Fandinno, Torsten Schaub
An ASP Semantics for Constraints Involving Conditional Aggregates. ECAI 2020: 664-671 - [c20]Pedro Cabalar, Jorge Fandinno, Luis Fariñas del Cerro:
Dynamic Epistemic Logic with ASP Updates: Application to Conditional Planning. ICLP Workshops 2020 - [c19]Pedro Cabalar, Jorge Fandinno, Luis Fariñas del Cerro:
On the Splitting Property for Epistemic Logic Programs (Extended Abstract). IJCAI 2020: 4721-4725 - [c18]Felicidad Aguado, Pedro Cabalar, Jorge Fandinno, David Pearce, Gilberto Pérez, Concepción Vidal:
Forgetting Auxiliary Atoms in Forks (Extended Abstract). IJCAI 2020: 5005-5009 - [c17]Pedro Cabalar, Jorge Fandinno, Torsten Schaub, Philipp Wanko:
A Uniform Treatment of Aggregates and Constraints in Hybrid ASP. KR 2020: 193-202 - [c16]Pedro Cabalar, Jorge Fandinno, Brais Muñiz:
A System for Explainable Answer Set Programming. ICLP Technical Communications 2020: 124-136 - [e1]Carmine Dodaro, George Aristidis Elder, Wolfgang Faber, Jorge Fandinno, Martin Gebser, Markus Hecher, Emily LeBlanc, Michael Morak, Jessica Zangari:
International Conference on Logic Programming 2020 Workshop Proceedings co-located with 36th International Conference on Logic Programming (ICLP 2020), Rende, Italy, September 18-19, 2020. CEUR Workshop Proceedings 2678, CEUR-WS.org 2020 [contents] - [i21]Pedro Cabalar, Jorge Fandinno, Torsten Schaub, Philipp Wanko:
An ASP semantics for Constraints involving Conditional Aggregates. CoRR abs/2002.06911 (2020) - [i20]Pedro Cabalar, Jorge Fandinno, Torsten Schaub, Philipp Wanko:
A Uniform Treatment of Aggregates and Constraints in Hybrid ASP. CoRR abs/2003.04176 (2020) - [i19]Markus Hecher, Jorge Fandinno:
Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard. CoRR abs/2007.04620 (2020) - [i18]Pedro Cabalar, Jorge Fandinno, Yuliya Lierler:
Modular Answer Set Programming as a Formal Specification Language. CoRR abs/2008.02015 (2020) - [i17]Pedro Cabalar, Jorge Fandinno, Javier Garea, Javier Romero, Torsten Schaub:
eclingo: A solver for Epistemic Logic Programs. CoRR abs/2008.02018 (2020) - [i16]Jorge Fandinno, Vladimir Lifschitz, Patrick Lühne, Torsten Schaub:
Verifying Tight Logic Programs with anthem and Vampire. CoRR abs/2008.02025 (2020)
2010 – 2019
- 2019
- [j13]Pedro Cabalar, Jorge Fandinno, Torsten Schaub
Gelfond-Zhang aggregates as propositional formulas. Artif. Intell. 274: 26-43 (2019) - [j12]Felicidad Aguado, Pedro Cabalar, Jorge Fandinno, David Pearce, Gilberto Pérez, Concepción Vidal
Forgetting auxiliary atoms in forks. Artif. Intell. 275: 575-601 (2019) - [j11]Wolfgang Dvorák, Jorge Fandinno, Stefan Woltran:
On the expressive power of collective attacks. Argument Comput. 10(2): 191-230 (2019) - [j10]Jorge Fandinno
Answering the "why" in answer set programming - A survey of explanation approaches. Theory Pract. Log. Program. 19(2): 114-203 (2019) - [j9]Jorge Fandinno
Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting. Theory Pract. Log. Program. 19(5-6): 671-687 (2019) - [j8]Felicidad Aguado, Pedro Cabalar, Jorge Fandinno
Revisiting Explicit Negation in Answer Set Programming. Theory Pract. Log. Program. 19(5-6): 908-924 (2019) - [c15]Pedro Cabalar
Lower Bound Founded Logic of Here-and-There. JELIA 2019: 509-525 - [c14]Pedro Cabalar, Jorge Fandinno, Luis Fariñas del Cerro:
Splitting Epistemic Logic Programs. LPNMR 2019: 120-133 - [c13]Pedro Cabalar, Jorge Fandinno, Luis Fariñas del Cerro:
Founded World Views with Autoepistemic Equilibrium Logic. LPNMR 2019: 134-147 - [c12]Felicidad Aguado, Pedro Cabalar, Jorge Fandinno, Brais Muñiz, Gilberto Pérez, Francisco Suárez:
A Rule-Based System for Explainable Donor-Patient Matching in Liver Transplantation. ICLP Technical Communications 2019: 266-272 - [i15]Pedro Cabalar, Jorge Fandinno, Luis Fariñas del Cerro:
Founded World Views with Autoepistemic Equilibrium Logic. CoRR abs/1902.07741 (2019) - [i14]Pedro Cabalar, Jorge Fandinno, Luis Fariñas del Cerro:
Dynamic Epistemic Logic with ASP Updates: Application to Conditional Planning. CoRR abs/1905.10621 (2019) - [i13]Jorge Fandinno:
Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting. CoRR abs/1907.09247 (2019) - [i12]Felicidad Aguado, Pedro Cabalar, Jorge Fandinno, David Pearce, Gilberto Pérez, Concepción Vidal:
Revisiting Explicit Negation in Answer Set Programming. CoRR abs/1907.11467 (2019) - [i11]Emmanuelle-Anna Dietz Saldanha, Jorge Fandinno:
On the Relation between Weak Completion Semantics and Answer Set Semantics. CoRR abs/1910.07278 (2019) - [i10]Jorge Fandinno, Johannes Klaus Fichte:
Proceedings of the twelfth Workshop on Answer Set Programming and Other Computing Paradigms 2019. CoRR abs/1912.09211 (2019) - 2018
- [j7]Pedro Cabalar, Jorge Fandinno
Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates. Theory Pract. Log. Program. 18(3-4): 390-405 (2018) - [c11]Claudette Cayrol, Jorge Fandinno, Luis Fariñas del Cerro, Marie-Christine Lagasquie-Schiex
Structure-Based Semantics of Argumentation Frameworks with Higher-Order Attacks and Supports. COMMA 2018: 29-36 - [c10]Wolfgang Dvorák, Jorge Fandinno, Stefan Woltran:
On the Expressive Power of Collective Attacks. COMMA 2018: 49-60 - [c9]Claudette Cayrol, Jorge Fandinno, Luis Fariñas del Cerro, Marie-Christine Lagasquie-Schiex
Argumentation Frameworks with Recursive Attacks and Evidence-Based Supports. FoIKS 2018: 150-169 - [c8]Jorge Fandinno, Luis Fariñas del Cerro:
Constructive Logic Covers Argumentation and Logic Programming. KR 2018: 128-137 - [i9]Pedro Cabalar, Jorge Fandinno, Luis Fariñas del Cerro, David Pearce:
Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates. CoRR abs/1805.00660 (2018) - [i8]Jorge Fandinno, Claudia Schulz:
Answering the "why" in Answer Set Programming - A Survey of Explanation Approaches. CoRR abs/1809.08034 (2018) - [i7]Jorge Fandinno, Johannes Klaus Fichte:
Proceedings of the elevent Workshop on Answer Set Programming and Other Computing Paradigms 2018. CoRR abs/1812.03508 (2018) - [i6]Pedro Cabalar, Jorge Fandinno, Luis Fariñas del Cerro:
Splitting Epistemic Logic Programs. CoRR abs/1812.08763 (2018) - 2017
- [j6]Pedro Cabalar, Jorge Fandinno:
Enablers and inhibitors in causal justifications of logic programs. Theory Pract. Log. Program. 17(1): 49-74 (2017) - [c7]Claudette Cayrol, Jorge Fandinno, Luis Fariñas del Cerro, Marie-Christine Lagasquie-Schiex:
Valid Attacks in Argumentation Frameworks with Recursive Attacks. COMMONSENSE 2017 - [c6]Pedro Cabalar, Jorge Fandinno, Luis Fariñas del Cerro, David Pearce, Agustín Valverde:
On the Properties of Atom Definability and Well-Supportedness in Logic Programming. EPIA 2017: 624-636 - [c5]Felicidad Aguado, Pedro Cabalar, Jorge Fandinno, David Pearce, Gilberto Pérez, Concepción Vidal:
Forgetting Auxiliary Atoms in Forks. ASPOCP@LPNMR 2017 - [c4]Pedro Cabalar, Jorge Fandinno, Torsten Schaub
Gelfond-Zhang Aggregates as Propositional Formulas. LPNMR 2017: 117-131 - 2016
- [j5]Jorge Fandinno:
Towards Deriving Conclusions from Cause-effect Relations. Fundam. Informaticae 147(1): 93-131 (2016) - [j4]Pedro Cabalar, Jorge Fandinno
Justifications for programs with disjunctive and causal-choice rules. Theory Pract. Log. Program. 16(5-6): 587-603 (2016) - [j3]Jorge Fandinno
Deriving conclusions from non-monotonic cause-effect relations. Theory Pract. Log. Program. 16(5-6): 670-687 (2016) - [i5]Pedro Cabalar, Jorge Fandinno:
Enablers and Inhibitors in Causal Justifications of Logic Programs. CoRR abs/1602.06897 (2016) - [i4]Jorge Fandinno:
Deriving Conclusions From Non-Monotonic Cause-Effect Relations. CoRR abs/1608.00867 (2016) - [i3]Pedro Cabalar, Jorge Fandinno:
Justifications for Programs with Disjunctive and Causal-choice Rules. CoRR abs/1608.00870 (2016) - 2015
- [c3]Pedro Cabalar, Jorge Fandiño
Explaining Preferences and Preferring Explanations. Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation 2015: 218-232 - [c2]Pedro Cabalar, Jorge Fandinno
Enablers and Inhibitors in Causal Justifications of Logic Programs. LPNMR 2015: 199-212 - 2014
- [j2]Pedro Cabalar, Jorge Fandinno
Causal Graph Justifications of Logic Programs. Theory Pract. Log. Program. 14(4-5): 603-618 (2014) - [c1]Pedro Cabalar, Jorge Fandiño
A Complexity Assessment for Queries Involving Sufficient and Necessary Causes. JELIA 2014: 297-310 - [i2]Pedro Cabalar, Jorge Fandinno, Michael Fink:
Causal Graph Justifications of Logic Programs. CoRR abs/1409.7281 (2014) - 2013
- [j1]Jorge Fandinno:
Algebraic Approach to Causal Logic Programs. Theory Pract. Log. Program. 13(4-5-Online-Supplement) (2013) - [i1]Pedro Cabalar, Jorge Fandinno:
An Algebra of Causal Chains. CoRR abs/1312.6134 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-01 00:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: