The aim of this work is to study an essential property in the framework of fuzzy preference structures, which is the transitivity. In particular, we discuss the relationship betwe...
Wc develop a l)ata-Oricntcd Parsing (DOP) model based on the syntactic representations of Lexicalf;unctional Grammar (LFG). We start by summarizing the original DOP model for tree...
A graph G is loosely-c-connected, or -c-connected, if there exists a number d depending on G such that the deletion of fewer than c vertices from G leaves precisely one infinite co...
abstraction and quantum computation Alessandra Di Pierro1 Dipartimento di Informatica University of Pisa Pisa, Italy Herbert Wiklicky2 Department of Computing Imperial College Lond...
We introduce a novel representation for visibility in three dimensions and describe an efficient algorithm to construct it. The data structure is a spherical map that consists of...