In this paper a learning based local search approach for propositional satisfiability is presented. It is based on an original adaptation of the conflict driven clause learning ...
Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazu...
Schema heterogeneity issues often represent an obstacle for discovering coreference links between individuals in semantic data repositories. In this paper we present an approach, w...
Andriy Nikolov, Victoria S. Uren, Enrico Motta, An...
An attractive mechanism to specify global constraints in rostering and other domains is via formal languages. For instance, the REGULAR and GRAMMAR constraints specify constraints ...
We suggest practical sub-linear size zero-knowledge arguments for statements involving linear algebra. Given commitments to matrices over a finite field, we give a sub-linear siz...
Abstract. Utilizing context information—e.g. location, user aspects, or hardware capabilities—enables the presented generic framework to automatically control the selection and...