Giora Slutzki

Learn More
! " # # $ &% ' )(* + , ! . + /0 1 2 3# 4 .5 /$ 0 +6 !7 8 +9: ; 0 + ! < 2 3 '=?> $ 49: ! 8 .@"A 2 8 8 ; * B ! 3% DC .54 ! 7E F + , G# &H1IJCLK.ML 8 5 $/ 5 % < $ N * ! B4 ! 1/. O6* /$ + .5'6 B1 1P$,Q . ? /< $ .7 51 R 47:/ ! S # /$ T + /0 /0 54, # !@VU )W! $BT 5 . + & F & ! + G / #X54 " 4 0 + / .5 89: 6 YB 6 S # /$ ! Z54 [ + 0 + \ + X5] ^5 / 8 * ! , _ 854 [ +(More)
This extended abstract is a condensed version of the results presented in two technical reports ([16] and [13]). In [16] a systematic treatment of the relationships between parallel rewriting systems (top-down tree transducer, ETOL system) and two-way machines (2-way gsm, tree-walking automaton, checking stack automaton) is given. Particular attention is(More)
We present the syntax and semantics of a modular ontology language SHOIQP to support context-specific reuse of knowledge from multiple ontologies. A SHOIQP ontology consists of multiple ontology modules (each of which can be viewed as a SHOIQ ontology) and concept, role and nominal names can be shared by "importing'' relations among modules. SHOIQP supports(More)
Bibliography 85 ii Acknowledgments My foremost thanks go to my advisor Jack Lutz. Jack brought me into research in 1999 while I was still an undergraduate. In the four years since he has provided me with excellent research advice and I have thoroughly enjoyed working with him. thank them for collaborating with me. I also thank Pavan Aduri, Cliff Bergman,(More)
We present the syntax and semantics of a modular ontology language SHOIQP to support context-specific reuse of knowledge from multiple ontologies. A SHOIQP ontology consists of multiple ontology modules (each of which can be viewed as a SHOIQ ontology) and concept, role and nominal names can be shared by “importing” relations among modules. SHOIQP supports(More)
Consider the problem of ranking social alternatives based on the number of voters that prefer one alternative to the other. Or consider the problem of ranking chess players by their past performance. A wide variety of ranking methods have been proposed to deal with these problems. Using six independent axioms, we characterize the fair-bets ranking method(More)
Information integration and retrieval have been important problems for many information systems - it is hard to combine multidimensional and parallel information and make them available for application queries. In our previous work [12], we have shown how to use ontologies to facilitate integrating and querying parallel but single dimensional information.(More)
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B satisfy precisely the same identities? (2) Do they satisfy the same quasi-identities? (3) Do A and B have the same set of term operations? In addition to the general case in which(More)