Sciweavers

ICALP
2009
Springer
13 years 10 months ago
Decidability of the Guarded Fragment with the Transitive Closure
We consider an extension of the guarded fragment in which one can guard quantiers using the transitive closure of some binary relations. The obtained logic captures the guarded fr...
Jakub Michaliszyn
INLG
2004
Springer
13 years 10 months ago
Generating Referring Expressions Using Perceptual Groups
Past work of generating referring expressions mainly utilized attributes of objects and binary relations between objects to distinguish the referent from other objects. However, su...
Kotaro Funakoshi, Satoru Watanabe, Naoko Kuriyama,...
RELMICS
2005
Springer
13 years 10 months ago
Relational Correspondences for Lattices with Operators
In this paper we present some examples of relational correspondences for not necessarily distributive lattices with modal-like operators of possibility (normal and additive operato...
Jouni Järvinen, Ewa Orlowska
ISMIS
2005
Springer
13 years 10 months ago
Subsystem Based Generalizations of Rough Set Approximations
Abstract. Subsystem based generalizations of rough set approximations are investigated. Instead of using an equivalence relation, an arbitrary binary relation is used to construct ...
Yiyu Yao, Yaohua Chen
SYNASC
2008
IEEE
284views Algorithms» more  SYNASC 2008»
13 years 11 months ago
Graph Rewriting in Computational Origami
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
Tetsuo Ida
LATIN
2010
Springer
14 years 4 days ago
Compact Rich-Functional Binary Relation Representations
Binary relations are an important abstraction arising in a number of data representation problems. Each existing data structure specializes in the few basic operations required by ...
Jérémy Barbay, Francisco Claude, Gon...