Zobrazeno 1 - 10
of 176
pro vyhledávání: '"Alviano, Mario"'
In this paper we propose a many-valued temporal conditional logic. We start from a many-valued logic with typicality, and extend it with the temporal operators of the Linear Time Temporal Logic (LTL), thus providing a formalism which is able to captu
Externí odkaz:
http://arxiv.org/abs/2409.09069
Publikováno v:
EPTCS 385, 2023, pp. 27-40
The paper presents an enhancement of xASP, a system that generates explanation graphs for Answer Set Programming (ASP). Different from xASP, the new system, xASP2, supports different clingo constructs like the choice rules, the constraints, and the a
Externí odkaz:
http://arxiv.org/abs/2308.15879
In imperative programming, the Domain-Driven Design methodology helps in coping with the complexity of software development by materializing in code the invariants of a domain of interest. Code is cleaner and more secure because any implicit assumpti
Externí odkaz:
http://arxiv.org/abs/2307.06382
Autor:
Alviano, Mario, Bartoli, Francesco, Botta, Marco, Esposito, Roberto, Giordano, Laura, Dupré, Daniele Theseider
In this paper we investigate the relationships between a multipreferential semantics for defeasible reasoning in knowledge representation and a multilayer neural network model. Weighted knowledge bases for a simple description logic with typicality a
Externí odkaz:
http://arxiv.org/abs/2305.00304
Weighted knowledge bases for description logics with typicality under a "concept-wise" multi-preferential semantics provide a logical interpretation of MultiLayer Perceptrons. In this context, Answer Set Programming (ASP) has been shown to be suitabl
Externí odkaz:
http://arxiv.org/abs/2303.04534
In this paper we propose a general approach to define a many-valued preferential interpretation of gradual argumentation semantics. The approach allows for conditional reasoning over arguments and boolean combination of arguments, with respect to a c
Externí odkaz:
http://arxiv.org/abs/2212.07523
Extending programming languages with stochastic behaviour such as probabilistic choices or random sampling has a long tradition in computer science. A recent development in this direction is a declarative probabilistic programming language, proposed
Externí odkaz:
http://arxiv.org/abs/2206.12247
The development of complex software requires tools promoting fail-fast approaches, so that bugs and unexpected behavior can be quickly identified and fixed. Tools for data validation may save the day of computer programmers. In fact, processing inval
Externí odkaz:
http://arxiv.org/abs/2202.09626
Autor:
Alviano, Mario1 (AUTHOR) mario.alviano@unical.it, Gabriele, Giada1 (AUTHOR)
Publikováno v:
Cryptography (2410-387X). Sep2024, Vol. 8 Issue 3, p30. 16p.
