This paper reviews algorithms for local computation with imprecise probabilities. These algorithms try to solve problems of inference calculation of conditional or unconditional p...
We show that rigid reachability, the non-symmetric form of rigid E-unification, is undecidable already in the case of a single constraint. From this we infer the undecidability of ...
Harald Ganzinger, Florent Jacquemard, Margus Veane...
Theorem provers based on model elimination have exhibited extremely high inference rates but have lacked a redundancy control mechanism such as subsumption. In this paper we repor...
A trigger system in High Energy Physics Experiments (HEPE) has to decide, in few µs, if the data related to a nuclear event have to be stored or not. Normally, these data, are co...
Abstract. In this paper, we present an argumentation-based approach to dealing with inconsistency occurring in knowledge bases. We investigate several important logical properties ...