Jorge Fandinno

research

∙ 06/06/2023

Embracing Background Knowledge in the Analysis of Actual Causality: An Answer Set Programming Approach

This paper presents a rich knowledge representation language aimed at fo...

0 Michael Gelfond, et al. ∙

research

∙ 05/27/2023

External Behavior of a Logic Program and Verification of Refactoring

Refactoring is modifying a program without changing its external behavio...

0 Jorge Fandinno, et al. ∙

research

∙ 07/18/2022

Positive Dependency Graphs Revisited

Theory of stable models is the mathematical basis of answer set programm...

0 Jorge Fandinno, et al. ∙

research

∙ 04/18/2022

Verification of Locally Tight Programs

ANTHEM is a proof assistant that can be used for verifying the correctne...

0 Jorge Fandinno, et al. ∙

research

∙ 03/27/2022

Abstract argumentation and answer set programming: two faces of Nelson's logic

In this work, we show that both logic programming and abstract argumenta...

0 Jorge Fandinno, et al. ∙

research

∙ 11/11/2021

Answer Set Programming Made Easy

We take up an idea from the folklore of Answer Set Programming, namely t...

0 Jorge Fandinno, et al. ∙

research

∙ 08/17/2021

Thirty years of Epistemic Specifications

The language of epistemic specifications and epistemic logic programs ex...

4 Jorge Fandinno, et al. ∙

research

∙ 08/13/2021

Planning with Incomplete Information in Quantified Answer Set Programming

We present a general approach to planning with incomplete information in...

0 Jorge Fandinno, et al. ∙

research

∙ 08/06/2021

Towards a Semantics for Hybrid ASP systems

Over the last decades the development of ASP has brought about an expres...

0 Pedro Cabalar, et al. ∙

research

∙ 09/22/2020

A System for Explainable Answer Set Programming

We present xclingo, a tool for generating explanations from ASP programs...

0 Pedro Cabalar, et al. ∙

research

∙ 08/05/2020

Verifying Tight Logic Programs with anthem and Vampire

This paper continues the line of research aimed at investigating the rel...

1 Jorge Fandinno, et al. ∙

research

∙ 08/05/2020

eclingo: A solver for Epistemic Logic Programs

We describe eclingo, a solver for epistemic logic programs under Gelfond...

9 Pedro Cabalar, et al. ∙

research

∙ 08/05/2020

Modular Answer Set Programming as a Formal Specification Language

In this paper, we study the problem of formal verification for Answer Se...

0 Pedro Cabalar, et al. ∙

research

∙ 07/09/2020

Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard

It is well-know that deciding consistency for normal answer set programs...

0 Markus Hecher, et al. ∙

research

∙ 03/09/2020

A Uniform Treatment of Aggregates and Constraints in Hybrid ASP

Characterizing hybrid ASP solving in a generic way is difficult since on...

8 Pedro Cabalar, et al. ∙

research

∙ 02/17/2020

An ASP semantics for Constraints involving Conditional Aggregates

We elaborate upon the formal foundations of hybrid Answer Set Programmin...

3 Pedro Cabalar, et al. ∙

research

∙ 10/16/2019

On the Relation between Weak Completion Semantics and Answer Set Semantics

The Weak Completion Semantics (WCS) is a computational cognitive theory ...

0 Emmanuelle-Anna Dietz Saldanha, et al. ∙

research

∙ 09/18/2019

A Rule-Based System for Explainable Donor-Patient Matching in Liver Transplantation

In this paper we present web-liver, a rule-based system for decision sup...

0 Felicidad Aguado, et al. ∙

research

∙ 07/26/2019

Revisiting Explicit Negation in Answer Set Programming

A common feature in Answer Set Programming is the use of a second negati...

0 Felicidad Aguado, et al. ∙

research

∙ 07/22/2019

Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting

In a recent line of research, two familiar concepts from logic programmi...

0 Jorge Fandinno, et al. ∙

research

∙ 05/25/2019

Dynamic Epistemic Logic with ASP Updates: Application to Conditional Planning

Dynamic Epistemic Logic (DEL) is a family of multimodal logics that has ...

0 Pedro Cabalar, et al. ∙

research

∙ 02/20/2019

Founded World Views with Autoepistemic Equilibrium Logic

Defined by Gelfond in 1991 (G91), epistemic specifications (or programs)...

0 Pedro Cabalar, et al. ∙

research

∙ 12/20/2018

Splitting Epistemic Logic Programs

Epistemic logic programs constitute an extension of the stable models se...

0 Pedro Cabalar, et al. ∙

research

∙ 12/09/2018

Proceedings of the eleventh Workshop on Answer Set Programming and Other Computing Paradigms 2018

This is the Proceedings of the elevent Workshop on Answer Set Programmin...

0 Jorge Fandinno, et al. ∙

research

∙ 12/09/2018

Proceedings of the elevent Workshop on Answer Set Programming and Other Computing Paradigms 2018

This is the Proceedings of the elevent Workshop on Answer Set Programmin...

0 Jorge Fandinno, et al. ∙

research

∙ 09/21/2018

Answering the "why" in Answer Set Programming - A Survey of Explanation Approaches

Artificial Intelligence (AI) approaches to problem-solving and decision-...

0 Jorge Fandinno, et al. ∙

research

∙ 05/02/2018

Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates

In this paper, we propose a variant of Answer Set Programming (ASP) with...

0 Pedro Cabalar, et al. ∙

research

∙ 02/22/2016

Enablers and Inhibitors in Causal Justifications of Logic Programs

To appear in Theory and Practice of Logic Programming (TPLP). In this pa...

0 Pedro Cabalar, et al. ∙

research

∙ 09/25/2014

Causal Graph Justifications of Logic Programs

In this work we propose a multi-valued extension of logic programs under...

0 Pedro Cabalar, et al. ∙

research

∙ 12/20/2013

An Algebra of Causal Chains

In this work we propose a multi-valued extension of logic programs under...

0 Pedro Cabalar, et al. ∙

Jorge Fandinno

Featured Co-authors