We compare the expressive power on finite models of two extensions of first order logic L with equality. L(Ct) is formed by adding an operator count{x : ϕ}, which builds a term ...
This paper proposes an optimal approach to infinite-state action planning exploiting automata theory. State sets and actions are characterized by Presburger formulas and represent...
Probabilistic logic programming is a powerful technique to represent and reason with imprecise probabilistic knowledge. A probabilistic logic program (PLP) is a knowledge base whi...
This paper introduces a real rational module framework in the context of Prediction Error Identification using Box-Jenkins model structures. This module framework, which can easily...
Tzvetan Ivanov, Pierre-Antoine Absil, Brian D. O. ...
The Paper presents multimedia system for accessible distant education which consists of multimedia browser accessible for visually impaired people and content distribution streamin...