Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
1017
search results - page 204 / 204
»
Higher-Order Logic Programming Languages with Constraints: A...
Sort
relevance
views
votes
recent
update
View
thumb
title
12
click to vote
FOCS
1998
IEEE
110
views
Theoretical Computer Science
»
more
FOCS 1998
»
The Complexity of Acyclic Conjunctive Queries
13 years 9 months ago
Download
www.mat.unical.it
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
claim paper
Read More »
26
click to vote
TFM
2009
Springer
252
views
Formal Methods
»
more
TFM 2009
»
Abstraction and Modelling: A Complementary Partnership
13 years 11 months ago
Download
www.irit.fr
action and Modelling - a complementary partnership” 10h30 – 11h 00 Coffee break 11h-12h30 Session 1 “Model Transformation: Foundations” Algebraic models for bidirectional m...
Jeffrey Kramer
claim paper
Read More »
« Prev
« First
page 204 / 204
Last »
Next »