Sciweavers

2228 search results - page 419 / 446
» On Database Theory and XML
Sort
View
ENTCS
2008
120views more  ENTCS 2008»
14 years 9 months ago
Reasoning about B+ Trees with Operational Semantics and Separation Logic
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
Alan P. Sexton, Hayo Thielecke
JAPLL
2008
121views more  JAPLL 2008»
14 years 9 months ago
Reasoning with prioritized information by iterative aggregation of distance functions
We introduce a general framework for reasoning with prioritized propositional data by aggregation of distance functions. Our formalism is based on a possible world semantics, wher...
Ofer Arieli
JASIS
2000
120views more  JASIS 2000»
14 years 9 months ago
Probabilistic datalog: Implementing logical information retrieval for advanced applications
In the logical approach to information retrieval (IR), retrieval is considered as uncertain inference. Whereas classical IR models are based on propositional logic, we combine Dat...
Norbert Fuhr
TALG
2010
110views more  TALG 2010»
14 years 8 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx
PPDP
2010
Springer
14 years 7 months ago
Tabling for transaction logic
Transaction Logic is a logic for representing declarative and procedural knowledge in logic programming, databases, and AI. It has been successful in areas as diverse as workflows...
Paul Fodor, Michael Kifer