![](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
5. DDLP 1997: Leuven, Belgium
- Ulrich Geske, Carolina Ruiz, Dietmar Seipel:
Proceedings of the Fifth International Workshop on Deductive Databases and Logic Programming, DDLP'97, Leuven, Belgium, July 1997. Accepted Papers. GMD - German National Research Center for Information Technology 1997, ISBN 3-88457-317-9
Accepted Papers
- Andreas Fordan:
Linear Constraint Projection - Top-Down and Bottom-Up. DDLP 1997 - Foto N. Afrati, Francesca Toni:
On the Relationship Between Chain Queries and Linear Datalog Programs. DDLP 1997 - Mohand-Said Hacid, Patrick Marcel, Christophe Rigotti:
Extending Datalog for Ordered Multidimensional Databases. DDLP 1997 - Chiemi Kamakura, Yuka Shimajiri, Hirohisa Seki, Hidenori Itoh:
Efficient Transformation for Bottom-up Computation of Stable Models. DDLP 1997 - Troels Andreasen, Henning Christiansen:
Hypothetical Queries to Deductive Databases. DDLP 1997 - Yunming Wang, Chun Tao, Yonggang Zhao, Yang Yang:
CRD: A New Data Mining Method in Deductive Databases. DDLP 1997 - Sarah Mallet, Mireille Ducassé:
An Informal Presentation of DDB Trees: A Basis for Deductive Database Explanations. DDLP 1997 - Hasan M. Jamil:
Inheritance with Overriding Without Non-monotonic Reasoning in Datalog++. DDLP 1997 - Koichi Furukawa, Tomonobu Ozaki, Tomoko Murakami, Ken Ueno, Keiko Shimazu:
Query Evaluation of Deductive Database by MGTP and its Application to Data Mining. DDLP 1997
![](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.