[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article

On the expressive power of database queries with intermediate types

Published: 01 August 1991 Publication History

Abstract

No abstract available.

Cited By

View all
  • (2018)Formalization of the classification patternSoftware and Systems Modeling (SoSyM)10.1007/s10270-016-0521-517:1(167-203)Online publication date: 1-Feb-2018
  • (2011)The Descriptive Complexity of the Deterministic Exponential Time HierarchyElectronic Notes in Theoretical Computer Science (ENTCS)10.5555/2952797.2952921269:C(71-82)Online publication date: 22-Apr-2011
  • (2006)Fixed-Point Quantifiers in Higher Order LogicsProceedings of the 2006 conference on Information Modelling and Knowledge Bases XVII10.5555/1565027.1565045(237-244)Online publication date: 17-May-2006
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Journal of Computer and System Sciences
Journal of Computer and System Sciences  Volume 43, Issue 1
Aug. 1991
266 pages
ISSN:0022-0000
  • Editor:
  • E. K. Blum
Issue’s Table of Contents

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 August 1991

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 31 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2018)Formalization of the classification patternSoftware and Systems Modeling (SoSyM)10.1007/s10270-016-0521-517:1(167-203)Online publication date: 1-Feb-2018
  • (2011)The Descriptive Complexity of the Deterministic Exponential Time HierarchyElectronic Notes in Theoretical Computer Science (ENTCS)10.5555/2952797.2952921269:C(71-82)Online publication date: 22-Apr-2011
  • (2006)Fixed-Point Quantifiers in Higher Order LogicsProceedings of the 2006 conference on Information Modelling and Knowledge Bases XVII10.5555/1565027.1565045(237-244)Online publication date: 17-May-2006
  • (2006)Computing queries with higher-order logicsTheoretical Computer Science10.1016/j.tcs.2006.01.009355:2(197-214)Online publication date: 11-Apr-2006
  • (2006)Complete problems for higher order logicsProceedings of the 20th international conference on Computer Science Logic10.1007/11874683_25(380-394)Online publication date: 25-Sep-2006
  • (2004)The most nonelementary theoryInformation and Computation10.1016/j.ic.2004.02.002190:2(196-219)Online publication date: 1-May-2004
  • (2000)Relational queries over interpreted structuresJournal of the ACM10.1145/347476.34747747:4(644-680)Online publication date: 1-Jul-2000
  • (1998)Complexity of nonrecursive logic programs with complex valuesProceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems10.1145/275487.275515(244-253)Online publication date: 1-May-1998
  • (1997)Languages for relational databases over interpreted structuresProceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems10.1145/263661.263672(87-98)Online publication date: 1-May-1997
  • (1997)The Complexity of the Evaluation of Complex Algebra ExpressionsJournal of Computer and System Sciences10.1006/jcss.1997.152655:2(322-343)Online publication date: 1-Oct-1997
  • Show More Cited By

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media