198 citations found. Retrieving documents...
Chandra and Harel 1982 Ashok Chandra and David Harel, "Structure and Complexity of Relational Queries", J. Comput. and System Sciences 25 (1982), 99--128.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:

First 50 documents  Next 50

Choiceless Polynomial Time - Andreas Blass Yuri (1997)   (4 citations)  (Correct)

No context found.

Chandra and Harel 1982 Ashok Chandra and David Harel, "Structure and Complexity of Relational Queries", J. Comput. and System Sciences 25 (1982), 99--128.


Toward Logic Tailored for Computational Complexity - Yuri Gurevich Computer (1984)   (59 citations)  (Correct)

No context found.

A.K. Chandra and D. Harel, "Structure and Complexity of Relational Queries", Journal of Computer and System Sciences 25 (1982), 99-128.


Query Languages for Bags and Aggregate Functions - Libkin, Wong (1997)   (7 citations)  (Correct)

No context found.

A. Chandra, D. Harel, Structure and complexity of relational queries, Journal of Computer and System Sciences 25 (1982), 99--128.


Definability on Finite Structures and the - Existence Of One-Way   (Correct)

No context found.

A. Chandra and D. Harel, Structure and Complexity of Relational Queries, J. Comp. Syst. Sciences 25 (1982), 99--128.


Some Relationships between the FOIES and Σ11 Arity.. - Dong, Wong (1996)   (Correct)

No context found.

A. K. Chandra and D. Harel. Structure and complexity of relational queries. Journal of Computer and System Sciences, 25(1):99--128, 1982.


Constraint Query Algebras - Goldin (1997)   (17 citations)  (Correct)

No context found.

A. K. Chandra and D. Harel. Structure and Complexity of Relational Queries. J. Comp. System Sci., 25:99--128, 1982.


Modelling the Future with Event Choice DATALOG - Guzzo, Sacca (2002)   (Correct)

No context found.

Chandra, A., and Harel, D., Structure and Complexity of Relational Queries. In Journal of Computer and System Science, Vol. 25, n1, pp. 99--128, 1982.


Adding for-Loops to First-Order Logic - Neven, Otto, Tyszkiewicz, Van den .. (2000)   (1 citation)  (Correct)

No context found.

A. Chandra and D. Harel. Structure and complexity of relational queries. Journal of Computer and System Sciences, 25(1):99-128, 1982.


Semi-Inflationary DATALOG: A Declarative Database Language.. - Guzzo, Sacca   (Correct)

No context found.

Chandra, A., and Harel, D., Structure and Complexity of Relational Queries. In Journal of Computer and System Science, Vol. 25, n1, pp. 99--128, 1982.


Fixed Point vs.First-Order Logic on Finite Ordered.. - Kfoury, Wymann-Böni (1993)   (Correct)

No context found.

A. Chandra and D. Harel, Structure and complexity of relational queries, Journal of Computer and System Sciences 25 (1982), 99--128.


A Characterization of First-Order Definable Subsets on.. - Kfoury, Wymann-Böni (1993)   (Correct)

No context found.

A. Chandra and D. Harel, Structure and complexity of relational queries, Journal of Computer and System Sciences 25 (1982), 99--128.


Managing Database Incompleteness with the Guarded Fragment - Minock   (Correct)

No context found.

A. Chandra and D. Harel. Structure and complexity of relational queries. Journal of Computer Systems and Sciences, 25(1):99--128, 1982.


Unknown -   (Correct)

No context found.

A. Chandra and D. Harel. Structure and complexity of relational queries. Journal of Computer Systems and Sciences, 25(1):99--128, 1982.


Expressiveness and Complexity of - Concurrent Constraint Programming   (Correct)

No context found.

A. Chandra and D. Harel. Structure and complexity of relational queries. Journal of Computer and System Sciences, 25:99-- 128, 1982.


Data Integration under the Schema Tuple Query Assumption - Hedlund (2003)   (Correct)

No context found.

A. Chandra and D. Harel. Structure and complexity of relational queries. Journal of Computer Systems and Sciences, 25(1):99--128, 1982.


On the Expressive Power of Logics on Finite Models - Kolaitis (2003)   (Correct)

No context found.

A. Chandra and D. Harel. Structure and complexity of relational queries. Journal of Computer and System Sciences, 25:99--128, 1982.


Infinitary Logics and 0-1 Laws - Kolaitis, Vardi (1992)   (5 citations)  (Correct)

No context found.

A. Chandra and D. Harel. Structure and complexity of relational queries. Journal of Computer and System Sciences, 25:99-128, 1982.


Fixed-Point Logics, Descriptive Complexity, And Random.. - Atserias (2002)   (Correct)

No context found.

A. Chandra and D. Harel. Structure and complexity of relational queries. Journal of Computer and System Sciences, 25:99--128, 1982.


Knowledge Representation Using Schema Tuple Queries - Minock (2003)   (1 citation)  (Correct)

No context found.

A. Chandra and D. Harel. Structure and complexity of relational queries. Journal of Computer Systems and Sciences, 25(1):99--128, 1982.


Composing Schema Mappings: Second-Order Dependencies to.. - Fagin, Kolaitis, Popa.. (2004)   (4 citations)  (Correct)

No context found.

A. K. Chandra and D. Harel. Structure and Complexity of Relational Queries. Journal of Computer and System Sciences, 25(1):99--128, 1982.


On Sufficient Conditions for Unsatisfiability of Random Formulas - Atserias (2003)   (Correct)

No context found.

A. Chandra and D. Harel. Structure and complexity of relational queries. Journal of Computer and System Sciences, 25:99--128, 1982.


Disjunctive Logic Programming: A Survey And Assessment - Minker, Seipel   (Correct)

No context found.

A. Chandra and D. Harel. Structure and complexity of relational queries. Journal of Computer System Sci., 25: pp. 99-128, 1982.


The Structure of - Fixed--Point Logics Martin   (Correct)

No context found.

A. Chandra and D. Harel. Structure and complexity of relational queries. Journal of Computer and System Sciences, 25:99--128, 1982.


The Bulletin of Symbolic Logic - Volume Number March   (Correct)

No context found.

A. Chandra and D. Harel, Structure and complexity of relational queries, Journal of Computer and System Sciences, vol. 25 (1982), pp. 99--128.


Easy Instances for Model Checking - Frick (2001)   (Correct)

No context found.

A. Chandra and D. Harel. Structure and complexity of relational queries. Journal of Computer and System Sciences, 1982.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC