Sciweavers

555 search results - page 60 / 111
» Complexity of Operations on Cofinite Languages
Sort
View
ICLP
2009
Springer
14 years 8 months ago
Merging Logic Programs under Answer Set Semantics
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
James P. Delgrande, Torsten Schaub, Hans Tompits, ...
HOTOS
1999
IEEE
13 years 12 months ago
ISTORE: Introspective Storage for Data-Intensive Network Services
Today's fast-growing data-intensive network services place heavy demands on the backend servers that support them. This paper introduces ISTORE, an intelligent server archite...
Aaron B. Brown, David L. Oppenheimer, Kimberly Kee...
KRDB
2003
111views Database» more  KRDB 2003»
13 years 9 months ago
A Framework for Answering Queries using Multiple Representation and Inference Techniques
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...
Nicholas L. Cassimatis
OSDI
2004
ACM
14 years 8 months ago
FFPF: Fairly Fast Packet Filters
FFPF is a network monitoring framework designed for three things: speed (handling high link rates), scalability (ability to handle multiple applications) and flexibility. Multiple...
Herbert Bos, Willem de Bruijn, Mihai-Lucian Criste...
WWW
2003
ACM
14 years 8 months ago
?-Queries: enabling querying for semantic associations on the semantic web
This paper presents the notion of Semantic Associations as complex relationships between resource entities. These relationships capture both a connectivity of entities as well as ...
Kemafor Anyanwu, Amit P. Sheth