|
Theory and Practice of Logic Programming
Journal Prestige (SJR): 0.524  Citation Impact (citeScore): 2 Number of Followers: 3  Hybrid journal (It can contain Open Access articles)ISSN (Print) 1471-0684 - ISSN (Online) 1475-3081 Published by Cambridge University Press  [353 journals]
|
- Introduction to the Special Issue on Logic Rules and Reasoning: Selected
Papers from the 4th International Joint Conference on Rules and Reasoning
(RuleML+RR 2020)-
Free pre-print version: Loading...
Authors: KLIEGR; TOMÁŠ, GUTIERREZ-BASULTO, VICTOR, SOYLU, AHMET
Pages: 503 - 506
PubDate: 2023-04-24
DOI: 10.1017/S1471068423000042
-
- Swift Markov Logic for Probabilistic Reasoning on Knowledge Graphs
-
Free pre-print version: Loading...
Authors: BELLOMARINI; LUIGI, LAURENZA, ELEONORA, SALLINGER, EMANUEL, SHERKHONOV, EVGENY
Pages: 507 - 534
Abstract: We provide a framework for probabilistic reasoning in Vadalog-based Knowledge Graphs (KGs), satisfying the requirements of ontological reasoning: full recursion, powerful existential quantification, expression of inductive definitions. Vadalog is a Knowledge Representation and Reasoning (KRR) language based on Warded Datalog+/–, a logical core language of existential rules, with a good balance between computational complexity and expressive power. Handling uncertainty is essential for reasoning with KGs. Yet Vadalog and Warded Datalog+/– are not covered by the existing probabilistic logic programming and statistical relational learning approaches for several reasons, including insufficient support for recursion with existential quantification and the impossibility to express inductive definitions. In this work, we introduce Soft Vadalog, a probabilistic extension to Vadalog, satisfying these desiderata. A Soft Vadalog program induces what we call a Probabilistic Knowledge Graph (PKG), which consists of a probability distribution on a network of chase instances, structures obtained by grounding the rules over a database using the chase procedure. We exploit PKGs for probabilistic marginal inference. We discuss the theory and present MCMC-chase, a Monte Carlo method to use Soft Vadalog in practice. We apply our framework to solve data management and industrial problems and experimentally evaluate it in the Vadalog system.
PubDate: 2022-11-09
DOI: 10.1017/S1471068422000412
-
- Answering Fuzzy Queries over Fuzzy DL-Lite Ontologies
-
Free pre-print version: Loading...
Authors: PASI; GABRIELLA, PEÑALOZA, RAFAEL
Pages: 594 - 623
Abstract: A prominent problem in knowledge representation is how to answer queries taking into account also the implicit consequences of an ontology representing domain knowledge. While this problem has been widely studied within the realm of description logic ontologies, it has been surprisingly neglected within the context of vague or imprecise knowledge, particularly from the point of view of mathematical fuzzy logic. In this paper, we study the problem of answering conjunctive queries and threshold queries w.r.t. ontologies in fuzzy DL-Lite. Specifically, we show through a rewriting approach that threshold query answering w.r.t. consistent ontologies remains in
in data complexity, but that conjunctive query answering is highly dependent on the selected triangular norm, which has an impact on the underlying semantics. For the idempotent Gödel t-norm, we provide an effective method based on a reduction to the classical case.
PubDate: 2022-01-07
DOI: 10.1017/S1471068421000569
-
- Tackling the DM Challenges with cDMN: A Tight Integration of DMN and
Constraint Reasoning-
Free pre-print version: Loading...
Authors: VANDEVELDE; SIMON, AERTS, BRAM, VENNEKENS, JOOST
Pages: 535 - 558
Abstract: Knowledge-based AI typically depends on a knowledge engineer to construct a formal model of domain knowledge – but what if domain experts could do this themselves' This paper describes an extension to the Decision Model and Notation (DMN) standard, called Constraint Decision Model and Notation (cDMN). DMN is a user-friendly, table-based notation for decision logic, which allows domain experts to model simple decision procedures without the help of IT staff. cDMN aims to enlarge the expressiveness of DMN in order to model more complex domain knowledge, while retaining DMNs goal of being understandable by domain experts. We test cDMN by solving the most complex challenges posted on the DM Community website. We compare our own cDMN solutions to the solutions that have been submitted to the website and find that our approach is competitive. Moreover, cDMN is able to solve more challenges than any other approach.
PubDate: 2021-11-12
DOI: 10.1017/S1471068421000491
-
- Declarative Approaches to Counterfactual Explanations for Classification
-
Free pre-print version: Loading...
Authors: BERTOSSI; LEOPOLDO
Pages: 559 - 593
Abstract: We propose answer-set programs that specify and compute counterfactual interventions on entities that are input on a classification model. In relation to the outcome of the model, the resulting counterfactual entities serve as a basis for the definition and computation of causality-based explanation scores for the feature values in the entity under classification, namely responsibility scores. The approach and the programs can be applied with black-box models, and also with models that can be specified as logic programs, such as rule-based classifiers. The main focus of this study is on the specification and computation of best counterfactual entities, that is, those that lead to maximum responsibility scores. From them one can read off the explanations as maximum responsibility feature values in the original entity. We also extend the programs to bring into the picture semantic or domain knowledge. We show how the approach could be extended by means of probabilistic methods, and how the underlying probability distributions could be modified through the use of constraints. Several examples of programs written in the syntax of the DLV ASP-solver, and run with it, are shown.
PubDate: 2021-12-27
DOI: 10.1017/S1471068421000582
-
