![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
8. KRDB 2001: Rome, Italy
- Maurizio Lenzerini, Daniele Nardi, Werner Nutt, Dan Suciu:
Proceedings of the 8th International Workshop on Knowledge Representation meets Databases (KRDB 2001), Rome, Italy, September 15, 2001. CEUR Workshop Proceedings 45, CEUR-WS.org 2001 - Maurizio Lenzerini, Daniele Nardi, Werner Nutt, Dan Suciu:
Preface. - Alin Deutsch, Val Tannen:
Containment and Integrity Constraints for XPath. - Natasha Alechina, Stéphane Demri, Maarten de Rijke:
Path Constraints from a Modal Logic Point of View. - Gösta Grahne, Alex Thomo
:
Approximate Reasoning in Semistructured Data. - Boris Chidlovskii:
Schema Extraction from XML: A Grammatical Inference Approach. - Mario Cannataro, Gianluca Carelli, Andrea Pugliese, Domenico Saccà:
Semantic Lossy Compression of XML Data. - Men Hin Yan, Ada Wai-Chee Fu:
From XML to Relational Databases. - Youakim Badr, M. Sayah, Frédérique Laforest, André Flory:
Capturing Data using XML Paragraph-centric Document. - Wolfgang May:
A Framework for Generic Integration of XML Sources. - Diego Calvanese, Silvana Castano, Francesco Guerra, Domenico Lembo, Michele Melchiori, Giorgio Terracina, Domenico Ursino, Maurizio Vincini:
Towards a Comprehensive Methodological Framework for Integration. - Iluju Kiringa:
Towards a General Theory of Advanced Transaction Models in the Situation Calculus.
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.