Pedro Cabalar
YOU?
Author Swipe
View article: Comparing Non-Minimal Semantics for Disjunction in Answer Set Programming
Comparing Non-Minimal Semantics for Disjunction in Answer Set Programming Open
In this paper, we compare four different semantics for disjunction in Answer Set Programming that, unlike stable models, do not adhere to the principle of model minimality. Two of these approaches, Cabalar and Muñiz’ Justified Models and D…
View article: Towards Constraint Temporal Answer Set Programming
Towards Constraint Temporal Answer Set Programming Open
Reasoning about dynamic systems with a fine-grained temporal and numeric resolution presents significant challenges for logic-based approaches like Answer Set Programming (ASP). To address this, we introduce and elaborate upon a novel temp…
View article: Compiling Metric Temporal Answer Set Programming
Compiling Metric Temporal Answer Set Programming Open
We develop a computational approach to Metric Answer Set Programming (ASP) to allow for expressing quantitative temporal constrains, like durations and deadlines. A central challenge is to maintain scalability when dealing with fine-graine…
View article: Proceedings 40th International Conference on Logic Programming
Proceedings 40th International Conference on Logic Programming Open
Since the first conference In Marseille in 1982, the International Conference on Logic Programming (ICLP) has been the premier international event for presenting research in logic programming. These proceedings include technical communicat…
View article: Strong Equivalence in Answer Set Programming with Constraints
Strong Equivalence in Answer Set Programming with Constraints Open
We investigate the concept of strong equivalence within the extended framework of Answer Set Programming with constraints. Two groups of rules are considered strongly equivalent if, informally speaking, they have the same meaning in any co…
View article: Contracted Temporal Equilibrium Logic
Contracted Temporal Equilibrium Logic Open
The stable model semantics of logic programs has been characterized by Equilibrium Logic, which is a non-monotonic formalism that selects models from the (monotonic) intermediate logic of Here-and-There. It provides stable models for arbit…
View article: Representing and solving spatial problems
Representing and solving spatial problems Open
Everyday life unfolds in both space and time, with our spatial experiences playing a central role in our interactions with the world. To grasp human cognition, it s essential to understand how we perceive spatial relationships and tackle s…
View article: Metric Temporal Equilibrium Logic over Timed Traces
Metric Temporal Equilibrium Logic over Timed Traces Open
In temporal extensions of answer set programming (ASP) based on linear time, the behavior of dynamic systems is captured by sequences of states. While this representation reflects their relative order, it abstracts away the specific times …
View article: Model Explanation via Support Graphs
Model Explanation via Support Graphs Open
In this note, we introduce the notion of support graph to define explanations for any model of a logic program. An explanation is an acyclic support graph that, for each true atom in the model, induces a proof in terms of program rules rep…
View article: Metric Dynamic Equilibrium Logic
Metric Dynamic Equilibrium Logic Open
In temporal extensions of Answer Set Programming (ASP) based on linear-time, the behavior of dynamic systems is captured by sequences of states. While this representation reflects their relative order, it abstracts away the specific times …
View article: Syntactic ASP forgetting with forks
Syntactic ASP forgetting with forks Open
[Abstract]: Answer Set Programming (ASP) constitutes nowadays one of the most successful paradigms for practical Knowledge Representation and declarative problem solving. The formal analysis of ASP programs is essential for a rigorous trea…
View article: Model Explanation via Support Graphs
Model Explanation via Support Graphs Open
In this note, we introduce the notion of support graph to define explanations for any model of a logic program. An explanation is an acyclic support graph that, for each true atom in the model, induces a proof in terms of program rules rep…
View article: Metric dynamic equilibrium logic
Metric dynamic equilibrium logic Open
[Abstract]: In temporal extensions of Answer Set Programming (ASP) based on linear-time, the behaviour of dynamic systems is captured by sequences of states. While this representation reflects their relative order, it abstracts away the sp…
View article: Past-present temporal programs over finite traces
Past-present temporal programs over finite traces Open
Extensions of Answer Set Programming with language constructs from temporal logics, such as temporal equilibrium logic over finite traces (TELf), provide an expressive computational framework for modeling dynamic applications. In this pape…
View article: Metric Temporal Equilibrium Logic over Timed Traces
Metric Temporal Equilibrium Logic over Timed Traces Open
In temporal extensions of Answer Set Programming (ASP) based on linear-time, the behavior of dynamic systems is captured by sequences of states. While this representation reflects their relative order, it abstracts away the specific times …
View article: Predicting pharmaceutical inkjet printing outcomes using machine learning
Predicting pharmaceutical inkjet printing outcomes using machine learning Open
Inkjet printing has been extensively explored in recent years to produce personalised medicines due to its low cost and versatility. Pharmaceutical applications have ranged from orodispersible films to complex polydrug implants. However, t…
View article: On the Semantics of Hybrid ASP Systems Based on Clingo
On the Semantics of Hybrid ASP Systems Based on Clingo Open
Over the last decades, the development of Answer Set Programming (ASP) has brought about an expressive modeling language powered by highly performant systems. At the same time, it gets more and more difficult to provide semantic underpinni…
View article: Accelerating 3D printing of pharmaceutical products using machine learning
Accelerating 3D printing of pharmaceutical products using machine learning Open
Three-dimensional printing (3DP) has seen growing interest within the healthcare industry for its ability to fabricate personalized medicines and medical devices. However, it may be burdened by the lengthy empirical process of formulation …
View article: Linear-Time Temporal Answer Set Programming
Linear-Time Temporal Answer Set Programming Open
In this survey, we present an overview on (Modal) Temporal Logic Programming in view of its application to Knowledge Representation and Declarative Problem Solving. The syntax of this extension of logic programs is the result of combining …
View article: Explainable Machine Larning for liver transplantation
Explainable Machine Larning for liver transplantation Open
In this work, we present a flexible method for explaining, in human readable terms, the predictions made by decision trees used as decision support in liver transplantation. The decision trees have been obtained through machine learning ap…
View article: Automata for dynamic answer set solving: Preliminary report
Automata for dynamic answer set solving: Preliminary report Open
We explore different ways of implementing temporal constraints expressed in an extension of Answer Set Programming (ASP) with language constructs from dynamic logic. Foremost, we investigate how automata can be used for enforcing such cons…
View article: Towards a Semantics for Hybrid ASP systems
Towards a Semantics for Hybrid ASP systems Open
Over the last decades the development of ASP has brought about an expressive modeling language powered by highly performant systems. At the same time, it gets more and more difficult to provide semantic underpinnings capturing the resultin…
View article: Multi-Context Systems: Dynamics and Evolution (Pre-Print of "Multi-context systems in dynamic environments")
Multi-Context Systems: Dynamics and Evolution (Pre-Print of "Multi-context systems in dynamic environments") Open
Multi-Context Systems (MCS) model in Computational Logic distributed systems composed of heterogeneous sources, or "contexts", interacting via special rules called "bridge rules". In this paper, we consider how to enhance flexibility and g…