Sciweavers

813 search results - page 4 / 163
» Languages for Relational Databases over Interpreted Structur...
Sort
View
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 6 months ago
Transforming structures by set interpretations
We consider a new kind of interpretation over relational structures: finite sets interpretations. Those interpretations are defined by weak monadic second-order (WMSO) formulas w...
Thomas Colcombet, Christof Löding
AIIA
2007
Springer
14 years 23 days ago
English Querying over Ontologies: E-QuOnto
Relational database (DB) management systems provide the standard means for structuring and querying large amounts of data. However, to access such data the exact structure of the D...
Raffaella Bernardi, Francesca Bonin, Diego Calvane...
INAP
2005
Springer
14 years 3 days ago
Using a Logic Programming Language with Persistence and Contexts
Abstract. This article merges two approaches: one dealing with persistence for logic programs, as provided by a relational database back-end and another which addresses the issues ...
Salvador Abreu, Vítor Nogueira
WWW
2007
ACM
14 years 7 months ago
Bridging the gap between OWL and relational databases
Schema statements in OWL are interpreted quite differently from analogous statements in relational databases. If these statements are meant to be interpreted as integrity constrai...
Boris Motik, Ian Horrocks, Ulrike Sattler
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 6 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei