We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
Developing customers’ initial trust in e-businesses is critical for many online vendors, especially for startup companies. As an effort to understand initial trust in the busine...
We present Scilog, an experimental knowledge base to facilitate scientific discovery and reasoning. Scilog extends Prolog by supporting (1) dedicated predicates for specifying and ...
False path analysis is an activity with applications in a variety of computer science and engineering domains like for instance high-level synthesis, worst case execution time est...
Traditional scenario of probabilistic modelling is directed at generating samples having a given probability distribution. We argue that this scenario is impracticable for image m...