Zobrazeno 1 - 10
of 239
pro vyhledávání: '"Riguzzi, Fabrizio"'
Parameter learning is a crucial task in the field of Statistical Relational Artificial Intelligence: given a probabilistic logic program and a set of observations in the form of interpretations, the goal is to learn the probabilities of the facts in
Externí odkaz:
http://arxiv.org/abs/2408.08732
Autor:
Azzolini, Damiano, Riguzzi, Fabrizio
When we want to compute the probability of a query from a Probabilistic Answer Set Program, some parts of a program may not influence the probability of a query, but they impact on the size of the grounding. Identifying and removing them is crucial t
Externí odkaz:
http://arxiv.org/abs/2408.07524
Autor:
Riguzzi, Fabrizio
We consider the problems of weighted constrained sampling and weighted model counting, where we are given a propositional formula and a weight for each world. The first problem consists of sampling worlds with a probability proportional to their weig
Externí odkaz:
http://arxiv.org/abs/2407.12816
The prevailing approaches in Network Intrusion Detection Systems (NIDS) are often hampered by issues such as high resource consumption, significant computational demands, and poor interpretability. Furthermore, these systems generally struggle to ide
Externí odkaz:
http://arxiv.org/abs/2406.00938
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
Externí odkaz:
http://arxiv.org/abs/2306.09138
Automatic differentiation (AD) is a range of algorithms to compute the numeric value of a function's (partial) derivative, where the function is typically given as a computer program or abstract syntax tree. AD has become immensely popular as part of
Externí odkaz:
http://arxiv.org/abs/2305.07878
Publikováno v:
EPTCS 364, 2022, pp. 65-78
Hybrid Knowledge Bases based on Lifschitz's logic of Minimal Knowledge with Negation as Failure are a successful approach to combine the expressivity of Description Logics and Logic Programming in a single language. Their syntax, defined by Motik and
Externí odkaz:
http://arxiv.org/abs/2208.03092