Search Results for author:
Found 12 papers, 1 papers with code
Exploiting Uncertainty for Querying Inconsistent Description Logics Knowledge Bases
The necessity to manage inconsistency in Description Logics Knowledge Bases~(KBs) has come to the fore with the increasing importance gained by the Semantic Web, where information comes from different sources that constantly change their content and may contain contradictory descriptions when considered either alone or together.
Syntactic Requirements for Well-defined Hybrid Probabilistic Logic Programs
Hybrid probabilistic logic programs can represent several scenarios thanks to the expressivity of Logic Programming extended with facts representing discrete and continuous distributions.
Nonground Abductive Logic Programming with Probabilistic Integrity Constraints
Uncertain information is being taken into account in an increasing number of application fields.
A Framework for Reasoning on Probabilistic Description Logics
We provide a comparison of the different reasoning settings on several datasets.
Proceedings 36th International Conference on Logic Programming (Technical Communications)
Since the first conference held in Marseille in 1982, ICLP has been the premier international event for presenting research in logic programming.
MAP Inference for Probabilistic Logic Programming
In Probabilistic Logic Programming (PLP) the most commonly studied inference task is to compute the marginal probability of a query given a program.
Automatic Setting of DNN Hyper-Parameters by Mixing Bayesian Optimization and Tuning Rules
The state-of-the-art hyper-parameters tuning methods are grid search, random search, and Bayesian Optimization.
Probabilistic DL Reasoning with Pinpointing Formulas: A Prolog-based Approach
TRILL and TRILLP are systems offering a Prolog implementation of the tableau algorithm.
Introduzione all'Intelligenza Artificiale
The last part of the paper is devoted to the discussion ongoing among experts in the field and the public at large about on the advantages and disadvantages of AI and in particular on the possible dangers.
SWISH: SWI-Prolog for Sharing
Recently, we see a new type of interfaces for programmers based on web technology.
Lifted Variable Elimination for Probabilistic Logic Programming
Lifted inference has been proposed for various probabilistic logical frameworks in order to compute the probability of queries in a time that depends on the size of the domains of the random variables rather than the number of instances.
Structure Learning of Probabilistic Logic Programs by Searching the Clause Space
It performs a beam search in the space of probabilistic clauses and a greedy search in the space of theories, using the log likelihood of the data as the guiding heuristics.
