Jörg Flum, Max Kubierschky, Bertram Ludäscher  Home/Search
Context Related
| logik.mathematik.unifre...flukublud.ps sdsc.edu/~ludaesch/Paper...icdt97.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: logik.mathematik.uni...preprints (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We show that the expressive power of well-founded Datalog does not decrease when restricted to total programs (it is known to decrease from \Pi 1 1 to \Delta 1 1 on infinite Herbrand structures) thereby affirmatively answering an open question posed by Abiteboul, Hull, and Vianu [AHV95]. In particular, we show that for every well-founded Datalog program there exists an equivalent total program whose only recursive rule is of the form win( X) / move( X; Y ); :win( Y ) where move is... (Update)
Context of citations to this paper: More
.... P , one can find another program whose well founded semantics is total on all inputs and that produces the same positive facts as P [FKL96] Research on well founded semantics, and the related notion of 3 stable model, has its roots in investigations of stable and default model...
...xed points (Theorem 12) We then turn to the question of complete problems. Other than for xedpoint logic without counting (see [2, 7, 5]) it is not easy to nd a complete problem for IFP C under rst order reductions. By adapting the proof of a general result of Dawar...
Cited by: More
Games and total Datalog ... Queries - Flum, Kubierschky, Ludäscher (2000) (Correct)
Games and Total Datalog-Neg Queries - Flum, Kubierschky, Ludäscher (2000) (Correct)
Complexity and Expressive Power of Logic Programming - Dantsin, Eiter, Gottlob.. (1997) (Correct)
Active bibliography (related documents): More All
0.5: An Approach On Semantic Query Optimization For Deductive Databases - Onet (2003) (Correct)
0.3: Incremental Model Checking for Fixed Point Properties on.. - Makowsky, Ravve (1995) (Correct)
0.2: Games, Kernels, and Antitone Operations - Flum (1998) (Correct)
Similar documents based on text: More All
0.3: Referential Actions as Logical Rules - Ludäscher, May (Correct)
0.2: An Extension of the Lemma of Rasiowa and Sikorski - Flum (1997) (Correct)
0.2: An Inductive Proof of the Wellfoundedness of the Multiset Order - Nipkow (1998) (Correct)
Related documents from co-citation: More All
6: Relational queries computable in polynomial time - Immerman - 1986
4: Foundations of databases (context) - Abiteboul, Hull et al. - 1995
4: The complexity of relational query languages (context) - Vardi - 1982
BibTeX entry: (Update)
J. Flum, M. Kubierschky, and B. Ludascher. Total and partial well-founded datalog coincide. In Proceedings of the 6th International Conference on Database Theory, volume 1186 in Lecture Notes in Computer Science, pages 113--124. Springer-Verlag, 1996. http://citeseer.ist.psu.edu/flum97total.html More
@inproceedings{ flum97total,
author = "Jorg Flum and Max Kubierschky and Bertram Ludascher",
title = "Total and Partial Well-Founded Datalog Coincide",
booktitle = "{ICDT}",
pages = "113-124",
year = "1997",
url = "citeseer.ist.psu.edu/flum97total.html" }
Citations (may not include all citations):775 Foundations of Databases (context) - Abiteboul, Hull et al. - 1995
435 Towards a Theory of Declarative Knowledge (context) - Apt, Blair et al. - 1988
245 Relational Queries Computable in Polynomial Time - Immerman - 1986
180 Logic Programming and Negation: A Survey - Apt, Bol - 1994
115 The Alternating Fixpoint of Logic Programs with Negation (context) - Van Gelder - 1989
115 The Alternating Fixpoint of Logic Programs with Negation (context) - Van Gelder - 1993
82 Semantics of Logic Programs: Their Intuitions and Formal Pro.. - Dix - 1995
45 Perspectives in Mathematical Logic (context) - Ebbinghaus, Flum et al. - 1995
20 Complexity and Undecidability Results in Logic Programming (context) - Schlipf - 1995
4 Fixpunktlogiken und Normalformen (context) - Kubierschky - 1995
3 The Structure of Fixed-Point Logics (context) - Grohe - 1994
2 Query Evaluation in Deductive Databases with Alternating Fix.. - Chen - 1995
1 Unfounded Sets and Well-Founded Sematics for General Logic P.. (context) - Van Gelder, Ross et al. - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://logik.mathematik.uni-freiburg.de/preprints.html): More
On the (infinite) Model Theory of Fixed-Point Logics - Flum (1995) (Correct)
Enhancing Fixed Point Logic With Cardinality Quantifiers - Hella, Imhof (1996) (Correct)
Fixed Point Logics, Generalized Quantifiers, and Oracles - Imhof (1995) (Correct)
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