Sciweavers

391 search results - page 46 / 79
» Formal Universes
Sort
View
107
Voted
ECAI
1998
Springer
15 years 4 months ago
Description Logics with Concrete Domains and Aggregation
Abstract. We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min;max;count;sum), which...
Franz Baader, Ulrike Sattler
116
Voted
TE
2010
89views more  TE 2010»
14 years 7 months ago
An Electrical Engineering Summer Academy for Middle School and High School Students
The Electrical Engineering Summer Academy for Pre-College Students was held at the University of Tulsa from June 11th through June 15th , 2007. Of the 20 students accepted, 19 par...
Peter LoPresti, Theodore W. Manikas, Jeff Kohlbeck
85
Voted
TCS
2002
15 years 2 days ago
Restriction categories I: categories of partial maps
Given a category with a stable system of monics, one can form the corresponding category of partial maps. To each map in this category there is, on the domain of the map, an assoc...
J. Robin B. Cockett, Stephen Lack
ACM
1995
15 years 4 months ago
Rough Sets
We study properties of rough sets, that is, approximations to sets of records in a database or, more formally, to subsets of the universe of an information system. A rough set is a...
Zdzislaw Pawlak
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
15 years 9 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...