Sciweavers

4767 search results - page 21 / 954
» Structures for Abstract Rewriting
Sort
View
SAC
2009
ACM
14 years 2 months ago
Origami fold as algebraic graph rewriting
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
Tetsuo Ida, Hidekazu Takahashi
CLEF
2005
Springer
14 years 1 months ago
A Logic Programming Based Approach to QA@CLEF05 Track
Abstract. In this paper the methodology followed to build a questionanswering system for the Portuguese language is described. The system modules are built using computational ling...
Paulo Quaresma, Irene Pimenta Rodrigues
FQAS
2006
Springer
136views Database» more  FQAS 2006»
13 years 11 months ago
Robust Query Processing for Personalized Information Access on the Semantic Web
Abstract. Research in Cooperative Query answering is triggered by the observation that users are often not able to correctly formulate queries to databases that return the intended...
Peter Dolog, Heiner Stuckenschmidt, Holger Wache
ER
2010
Springer
164views Database» more  ER 2010»
13 years 5 months ago
Querying Databases with Taxonomies
Traditional information search in which queries are posed against a known and rigid schema over a structured database is shifting towards a Web scenario in which exposed schemas ar...
Davide Martinenghi, Riccardo Torlone
SIGMOD
2001
ACM
158views Database» more  SIGMOD 2001»
14 years 7 months ago
Generating Efficient Plans for Queries Using Views
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
Foto N. Afrati, Chen Li, Jeffrey D. Ullman