Buscar
Mostrando ítems 1-10 de 18
Minish HAT: A Tool for the Minimization of Here-and-There Logic Programs and Theories in Answer Set Programming
(M D P I AG, 2019-07-31)
[Abstract] When it comes to the writing of a new logic program or theory, it is of great importance to obtain a concise and minimal representation, for simplicity and ease of interpretation reasons. There are already a few ...
Predicting pharmaceutical inkjet printing outcomes using machine learning
(Elsevier B.V., 2023)
[Abstract]: 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 ...
Linear-Time Temporal Answer Set Programming
(Cambridge University Press, 2023)
[Abstract]: 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 ...
aspBEEF: Explaining Predictions Through Optimal Clustering
(MDPI AG, 2020-08-28)
[Abstract]
In this paper we introduce aspBEEF, a tool for generating explanations for the outcome of an arbitrary machine learning classifier. This is done using Grover’s et al. framework known as Balanced English ...
Model Explanation via Support Graphs
(Cambridge Univeristy Press, 2024-02)
[Absctract]: 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 ...
Syntactic ASP forgetting with forks
(Elsevier, 2024-01)
[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 ...
Revisiting Explicit Negation in Answer Set Programming
(Cambridge University Press, 2019-09)
[Abstract] 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. This explicit negation is normally used in ...
A Polynomial Reduction of Forks Into Logic Programs
(Elsevier, 2022)
[Abstract] In this research note we present additional results for an earlier published paper [1]. There, we studied the problem of projective strong equivalence (PSE) of logic programs, that is, checking whether two logic ...
Accelerating 3D printing of pharmaceutical products using machine learning
(Elsevier, 2022)
[Abstract] 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 ...
Machine learning predicts 3D printing performance of over 900 drug delivery systems
(Elsevier B.V., 2021-09)
[Abstract]: Three-dimensional printing (3DP) is a transformative technology that is advancing pharmaceutical research by producing personalized drug products. However, advances made via 3DP have been slow due to the lengthy ...