Amanote Research

Amanote Research

    RegisterSign In

Decidable Containment of Recursive Queries

Theoretical Computer Science - Netherlands
doi 10.1016/j.tcs.2004.10.031
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

May 1, 2005

Authors
Diego CalvaneseGiuseppe De GiacomoMoshe Y. Vardi
Publisher

Elsevier BV


Related search

On the Expected Size of Recursive Datalog Queries

1991English

Decidable Description Logics of Context With Rigid Roles

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

A Decidable Analysis of Security Protocols

English

Queries

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1945English

Queries

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1948English

Queries

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1948English

Absolute Convergence of Rational Series Is Semi-Decidable

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Decidable Reasoning in Terminological Knowledge Representation Systems

Journal of Artificial Intelligence Research
Artificial Intelligence
1993English

Ensuring Correctness of Model Transformations While Remaining Decidable

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy