Sciweavers

237 search results - page 32 / 48
» On the decidability and complexity of reasoning about only k...
Sort
View
SEMCO
2009
IEEE
14 years 3 months ago
LexPar: A Freely Available English Paraphrase Lexicon Automatically Extracted from FrameNet
—This is a paper about a new resource, namely an English paraphrase dictionary extracted from the FrameNet lexicon and its example data base. I. THE LEXPAR PARAPHRASE DICTIONARY ...
Bob Coyne, Owen Rambow
PVLDB
2008
160views more  PVLDB 2008»
13 years 7 months ago
BayesStore: managing large, uncertain data repositories with probabilistic graphical models
Several real-world applications need to effectively manage and reason about large amounts of data that are inherently uncertain. For instance, pervasive computing applications mus...
Daisy Zhe Wang, Eirinaios Michelakis, Minos N. Gar...
UML
2005
Springer
14 years 1 months ago
Enhancement of Development Technologies for Agent-Based Software Engineering
Abstract. Current trends in software development show a move towards supporting autonomous components (agents). The accurate timing of interactions between such components is growi...
Andre Karpistsenko
SEBD
2007
148views Database» more  SEBD 2007»
13 years 9 months ago
Containment of Conjunctive Object Meta-Queries
We consider the problem of query containment over an object data model derived from F-logic. F-logic has generated considerable interest commercially, in the academia, and within ...
Andrea Calì, Michael Kifer
LICS
2012
IEEE
11 years 10 months ago
An Automata Model for Trees with Ordered Data Values
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
Tony Tan