Ontologies and rules are usually loosely coupled in knowledge representation formalisms. In fact, ontologies use open-world reasoning while the leading semantics for rules use non...
Two algorithms based upon a tree-cotree decomposition, called in this paper spanning tree technique (STT) and generalized spanning tree technique (GSTT), have been shown to be usef...
d abstract; full version begins on page 13) Ryan O’Donnell∗ John Wright† November 2, 2011 We show that distinguishing 1 2 -satisfiable Unique-Games instances from (3 8 + )-...
We consider the question of the stability of evolutionary algorithms to gradual changes, or drift, in the target concept. We define an algorithm to be resistant to drift if, for s...
Varun Kanade, Leslie G. Valiant, Jennifer Wortman ...
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...