Picture for Jorge Fandinno

Jorge Fandinno

Omaha State University, USA, University of Potsdam, Germany

Recursive Aggregates as Intensional Functions in Answer Set Programming: Semantics and Strong Equivalence

Add code
Dec 14, 2024
Viaarxiv icon

Solving Epistemic Logic Programs using Generate-and-Test with Propagation

Add code
Oct 29, 2024
Viaarxiv icon

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

Add code
Jun 06, 2023
Viaarxiv icon

Positive Dependency Graphs Revisited

Add code
Jul 18, 2022
Viaarxiv icon

Verification of Locally Tight Programs

Add code
Apr 18, 2022
Viaarxiv icon

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

Add code
Mar 27, 2022
Viaarxiv icon

Answer Set Programming Made Easy

Add code
Nov 24, 2021
Viaarxiv icon

Thirty years of Epistemic Specifications

Add code
Aug 17, 2021
Figure 1 for Thirty years of Epistemic Specifications
Figure 2 for Thirty years of Epistemic Specifications
Figure 3 for Thirty years of Epistemic Specifications
Figure 4 for Thirty years of Epistemic Specifications
Viaarxiv icon

Planning with Incomplete Information in Quantified Answer Set Programming

Add code
Aug 13, 2021
Figure 1 for Planning with Incomplete Information in Quantified Answer Set Programming
Figure 2 for Planning with Incomplete Information in Quantified Answer Set Programming
Viaarxiv icon

Towards a Semantics for Hybrid ASP systems

Add code
Aug 06, 2021
Viaarxiv icon