We consider a possible scenario of experimental analysis on heuristics for optimization: identifying the contribution of local search components when algorithms are evaluated on th...
In this paper, tabu search for SAT is investigated from an experimental point of view. To this end, TSAT, a basic tabu search algorithm for SAT, is introduced and compared with Se...
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs form the algebraic semanti...
This paper studies textual inference by investigating comma structures, which are highly frequent elements whose major role in the extraction of semantic relations has not been hi...
Vivek Srikumar, Roi Reichart, Mark Sammons, Ari Ra...