Sciweavers

503 search results - page 79 / 101
» Combining Description Logics, Description Graphs, and Rules
Sort
View
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 8 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
AINA
2007
IEEE
14 years 2 months ago
OWL-Based Context-Dependent Task Modeling and Deducing
In the near future, homes are envisioned to be equipped with numerous intelligent communicating devices. Such smart home needs to exhibit highly adaptive behavior to meet the inha...
Hongbo Ni, Xingshe Zhou, Zhiwen Yu, Kejian Miao
LOGCOM
2007
130views more  LOGCOM 2007»
13 years 7 months ago
A Logic for Concepts and Similarity
Categorisation of objects into classes is currently supported by (at least) two ‘orthogonal’ methods. In logic-based approaches, classifications are defined through ontologi...
Mikhail Sheremet, Dmitry Tishkovsky, Frank Wolter,...
IEEESCC
2005
IEEE
14 years 1 months ago
Web Services Composition: A Story of Models, Automata, and Logics
eal world”, represented abstractly using (time-varying) first-order logic predicates and terms. A representative composition result [11] here uses a translation into Petri nets. ...
Richard Hull
FLOPS
2008
Springer
13 years 9 months ago
Declarative Diagnosis of Missing Answers in Constraint Functional-Logic Programming
Abstract. We present a declarative method for diagnosing missing computed answers in CFLP(D), a generic scheme for lazy Constraint Functional-Logic Programming which can be instant...
Rafael Caballero, Mario Rodríguez-Artalejo,...