662 search results - page 53 / 133 » Trees, Automata and XML |
148
click to vote
FOIKS
2010
Springer
15 years 9 months ago
2010
Springer
Armstrong databases are a popular tool in example-based database design. An Armstrong database for a given constraint set from a fixed constraint class Z satisfies precisely those ...
134
click to vote
FUIN
2007
15 years 6 months ago
2007
We define a relative version of the logic NIL introduced by Orłowska, Pawlak and Vakarelov and we show that satisfiability is not only decidable but also EXPTIME-complete. Such ...
169
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
Axiom pinpointing has been introduced in description logics (DL) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base th...
159
click to vote
APLAS
2004
ACM
2004
ACM
Translation of Tree-Processing Programs into Stream-Processing Programs Based on Ordered Linear Type
15 years 11 months ago
There are two ways to write a program for manipulating tree-structured data such as XML documents: One is to write a tree-processing program focusing on the logical structure of t...
168
click to vote
SIGIR
2004
ACM
15 years 11 months ago
2004
ACM
Indexing and ranking are two key factors for efficient and effective XML information retrieval. Inappropriate indexing may result in false negatives and false positives, and impro...