Reflective Relational Machines of Bounded Variable Complexity.
Jose Maria Turull Torres:
Reflective Relational Machines of Bounded Variable Complexity.
ADBIS (Short Papers) 1999: 193-199@inproceedings{DBLP:conf/adbis/Torres99,
author = {Jose Maria Turull Torres},
editor = {Johann Eder and
Ivan Rozman and
Tatjana Welzer},
title = {Reflective Relational Machines of Bounded Variable Complexity},
booktitle = {Advances in Databases and Information Systems, Third East European
Conference, ADBIS'99, Maribor, Slovenia, September 13-16, 1999,
Proceedings of Short Papers},
publisher = {Institute of Informatics, Faculty of Electrical Engineering and
Computer Science, Smetanova 17, IS-2000 Maribor, Slovenia},
year = {1999},
isbn = {86-435-0285-5},
pages = {193-199},
ee = {db/conf/adbis/Torres99.html},
crossref = {DBLP:conf/adbis/99s},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
BibTeX
References
- [1]
- Serge Abiteboul, Christos H. Papadimitriou, Victor Vianu:
The Power of Reflective Relational Machines.
LICS 1994: 230-240 BibTeX
- [2]
- Serge Abiteboul, Victor Vianu:
Generic Computation and Its Complexity.
STOC 1991: 209-219 BibTeX
- [3]
- Serge Abiteboul, Victor Vianu:
Computing with First-Order Logic.
J. Comput. Syst. Sci. 50(2): 309-335(1995) BibTeX
- [4]
- Serge Abiteboul, Moshe Y. Vardi, Victor Vianu:
Computing with Infinitary Logic.
ICDT 1992: 113-123 BibTeX
- [5]
- Ashok K. Chandra, David Harel:
Computable Queries for Relational Data Bases.
J. Comput. Syst. Sci. 21(2): 156-178(1980) BibTeX
- [6]
- ...
- [7]
- ...
- [8]
- Anil Seth:
When Do Fixed Point Logics Capture Complexity Classes?
LICS 1995: 353-363 BibTeX
- [9]
- ...
- [10]
- ...
BibTeX
Copyright © Sat May 16 22:56:43 2009
by Michael Ley (ley@uni-trier.de)