Delta-Languages for Sets and sub-PTIME Graphs Transformers.

@inproceedings{DBLP:conf/icdt/YuL95,
  author    = {Vladimir Yu. Sazonov and
               Alexei Lisitsa},
  editor    = {Georg Gottlob and
               Moshe Y. Vardi},
  title     = {Delta-Languages for Sets and sub-PTIME Graphs Transformers},
  booktitle = {Database Theory - ICDT'95, 5th International Conference, Prague,
               Czech Republic, January 11-13, 1995, Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {893},
  year      = {1995},
  isbn      = {3-540-58907-4},
  pages     = {125-138},
  ee        = {http://dx.doi.org/10.1007/3-540-58907-4_11},
  crossref  = {DBLP:conf/icdt/95},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An2-2 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

References

[1]

Serge Abiteboul, Catriel Beeri: The Power of Languages for the Manipulation of Complex Values. VLDB J. 4(4): 727-794(1995)

[2]

...

[3]

José A. Blakeley, Per-Åke Larson, Frank Wm. Tompa: Efficiently Updating Materialized Views. SIGMOD Conference 1986: 61-71

[4]

...

[5]

Elias Dahlhaus, Johann A. Makowsky: The Choice of Programming Primitives for SETL-Like Programming Languages. ESOP 1986: 160-172

[6]

Elias Dahlhaus: Is SETL a Suitable Language for Parallel Programming - A Theoretical Approach. CSL 1987: 56-63

[7]

...

[8]

...

[9]

...

[10]

Stéphane Grumbach, Victor Vianu: Tractable Query Languages for Complex Object Databases. PODS 1991: 315-327

[11]

Yuri Gurevich: Algebras of Feasible Functions. FOCS 1983: 210-214

[12]

...

[13]

Neil Immerman: Languages that Capture Complexity Classes. SIAM J. Comput. 16(4): 760-778(1987)

[14]

...

[15]

Neil Immerman, Sushant Patnaik, David W. Stemple: The Expressiveness of a Family of Finite Set Languages. PODS 1991: 37-52

[16]

...

[17]

...

[18]

Gabriel M. Kuper, Moshe Y. Vardi: A New Approach to Database Logic. PODS 1984: 86-96

[19]

...

[20]

...

[21]

...

[22]

Vladimir Yu. Sazonov: A Logical Approach to the Problem "P=NP?". MFCS 1980: 562-575

[23]

Vladimir Yu. Sazonov: On Existence of Complete Predicate Calculus in Metamathematics without Exponentiation. MFCS 1981: 483-490

[24]

...

[25]

...

[26]

...

[27]

Vladimir Yu. Sazonov: Hereditarily-Finite Sets, Data Bases and Polynomial-Time Computability. Theor. Comput. Sci. 119(1): 187-214(1993)

[28]

Vladimir Yu. Sazonov: A Bounded Set Theory with Anti-Foundation Axiom and Inductive Definability. CSL 1994: 527-541

[29]

...