We show that maximal S-free convex sets are polyhedra when S is the set of integral points in some rational polyhedron of Rn . This result extends a theorem of Lov
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
In this paper, we present initial experiments in the recognition of deceptive language. We introduce three data sets of true and lying texts collected for this purpose, and we sho...
on of abstract strategies which is extensional in the sense that a strategy is defined explicitly of derivations of an abstract reduction system. We then move to a more intensional...
Tony Bourdier, Horatiu Cirstea, Daniel J. Doughert...
Abstract. A useful ability for search engines is to be able to rank objects with novelty and diversity: the top k documents retrieved should cover possible interpretations of a que...