Search Results for author:
Found 29 papers, 2 papers with code
Embracing Background Knowledge in the Analysis of Actual Causality: An Answer Set Programming Approach
This paper presents a rich knowledge representation language aimed at formalizing causal knowledge.
Positive Dependency Graphs Revisited
Several results in that theory refer to the concept of the positive dependency graph of a logic program.
Verification of Locally Tight Programs
For tight programs, that generalization of completion is known to match the stable model semantics, which is the basis of answer set programming.
Abstract argumentation and answer set programming: two faces of Nelson's logic
In this work, we show that both logic programming and abstract argumentation frameworks can be interpreted in terms of Nelson's constructive logic N4.
Answer Set Programming Made Easy
We take up an idea from the folklore of Answer Set Programming, namely that choices, integrity constraints along with a restricted rule format is sufficient for Answer Set Programming.
Thirty years of Epistemic Specifications
The language of epistemic specifications and epistemic logic programs extends disjunctive logic programs under the stable model semantics with modal constructs called subjective literals.
Planning with Incomplete Information in Quantified Answer Set Programming
We present a general approach to planning with incomplete information in Answer Set Programming (ASP).
Towards a Semantics for Hybrid ASP systems
Over the last decades the development of ASP has brought about an expressive modeling language powered by highly performant systems.
A System for Explainable Answer Set Programming
We present xclingo, a tool for generating explanations from ASP programs annotated with text and labels.
Modular Answer Set Programming as a Formal Specification Language
In this paper, we study the problem of formal verification for Answer Set Programming (ASP), namely, obtaining a formal proof showing that the answer sets of a given (non-ground) logic program P correctly correspond to the solutions to the problem encoded by P, regardless of the problem instance.
eclingo: A solver for Epistemic Logic Programs
The input language of eclingo uses the syntax extension capabilities of clingo to define subjective literals that, as usual in epistemic logic programs, allow for checking the truth of a regular literal in all or in some of the answer sets of a program.
Verifying Tight Logic Programs with anthem and Vampire
This paper continues the line of research aimed at investigating the relationship between logic programs and first-order theories.
Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard
The exponential time hypothesis (ETH) implies that this result is tight for SAT, that is, SAT cannot be solved in subexponential time.
A Uniform Treatment of Aggregates and Constraints in Hybrid ASP
Characterizing hybrid ASP solving in a generic way is difficult since one needs to abstract from specific theories.
An ASP semantics for Constraints involving Conditional Aggregates
We elaborate upon the formal foundations of hybrid Answer Set Programming (ASP) and extend its underlying logical framework with aggregate functions over constraint values and variables.
Proceedings of the twelfth Workshop on Answer Set Programming and Other Computing Paradigms 2019
This is the Proceedings of the twelfth Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP) 2019, which was held in Philadelphia, USA, June 3rd , 2019.
On the Relation between Weak Completion Semantics and Answer Set Semantics
In particular, we will show that logic programs under the WCS can be represented as logic programs under the ASP by means of a definition completion, where all defined atoms in a program must be false when their definitions are false.
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 support in the medical domain, focusing on its application in a liver transplantation unit for implementing policies for donor-patient matching.
Revisiting Explicit Negation in Answer Set Programming
A common feature in Answer Set Programming is the use of a second negation, stronger than default negation and sometimes called explicit, strong or classical negation.
Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting
To prove this result, we provide an alternative characterisation of FAEEL as a combination of G91 with a simpler logic we called Founded Epistemic Equilibrium Logic (FEEL), which is somehow an extrapolation of the stable model semantics to the modal logic S5.
Dynamic Epistemic Logic with ASP Updates: Application to Conditional Planning
Dynamic Epistemic Logic (DEL) is a family of multimodal logics that has proved to be very successful for epistemic reasoning in planning tasks.
Founded World Views with Autoepistemic Equilibrium Logic
We define when a world view is founded with respect to some program and propose the foundedness property for any semantics whose world views are always founded.
Splitting Epistemic Logic Programs
In this paper, we propose an extension of the well-known splitting property for logic programs to the epistemic case.
Proceedings of the eleventh Workshop on Answer Set Programming and Other Computing Paradigms 2018
This is the Proceedings of the eleventh Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP) 2018, which was held in Oxford, UK, July 18th, 2018.
Answering the "why" in Answer Set Programming - A Survey of Explanation Approaches
Artificial Intelligence (AI) approaches to problem-solving and decision-making are becoming more and more complex, leading to a decrease in the understandability of solutions.
Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates
First, while other semantics for aggregates depend on some syntactic transformation (either via a reduct or a formula translation), the QELF interpretation treats them as regular evaluable functions, providing a compositional semantics and avoiding any kind of syntactic restriction.
Enablers and Inhibitors in Causal Justifications of Logic Programs
The most important result is a formal comparison to the recent algebraic approaches for justifications in LP: "Why-not Provenance" (WnP) and "Causal Graphs" (CG).
Causal Graph Justifications of Logic Programs
Finally, for programs with negation, we define the concept of causal stable model by introducing an analogous transformation to Gelfond and Lifschitz's program reduct.
An Algebra of Causal Chains
In this work we propose a multi-valued extension of logic programs under the stable models semantics where each true atom in a model is associated with a set of justifications, in a similar spirit than a set of proof trees.
