Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov  Home/Search
Context Related
Links: ACM DBLP | kr.tuwien.ac.at/pub/tr/rr9905.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 Problem Downloading? From: kr.tuwien.ac.at/research/...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . This paper surveys various complexity and expressiveness results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general logic programming with function symbols. Next to classical results on plain logic programming (pure Horn clause programs), more recent results on various important extensions of logic programming are surveyed. These include logic programming... (Update)
Cited by: More
Negation and Negative Information in the W3C - Resource Description Framework (2004) (Correct)
Nonmonotonic Ontological and Rule-Based Reasoning.. - Heymans, Van.. (2005) (Correct)
Guarded Open Answer Set Programming - Stijn Heymans Davy (2005) (Correct)
Similar documents (at the sentence level):
28.0%: Complexity and Expressive Power of Logic Programming - Dantsin, Eiter, Gottlob.. (1997) (Correct)
Similar documents based on text: More All
1.4: DBAI Publication List 2001 - TU-Wien (2001) (Correct)
1.3: New Results on Monotone Dualization and Generating Hypergraph.. - Eiter, al. (2002) (Correct)
1.3: Complexity of Nested Circumscription and Nested.. - Cardoli, Eiter, Gottlob (2002) (Correct)
Related documents from co-citation: More All
30: Classical Negation in Logic Programs and Disjunctive Databases - Gelfond, Lifschitz - 1991
29: Computational Complexity (context) - Papadimitriou - 1994
24: The Stable Model Semantics for Logic Programming - Gelfond - 1988
BibTeX entry: (Update)
E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov. Complexity and expressive power of logic programming. In Proceedings of the 12th Annual IEEE Conference on Computational Complexity, pages 82--101, Ulm, Germany, 1997. http://citeseer.ist.psu.edu/dantsin99complexity.html More
@inproceedings{ dantsin97complexity,
author = "Evgeny Dantsin and Thomas Eiter and Georg Gottlob and Andrei Voronkov",
title = "Complexity and Expressive Power of Logic Programming",
booktitle = "{IEEE} Conference on Computational Complexity",
pages = "82-101",
year = "1997",
url = "citeseer.ist.psu.edu/dantsin99complexity.html" }
Citations not processed or no citations identified.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.kr.tuwien.ac.at/research/reports/index.html): More
On ACTL Formulas Having Deterministic Counterexamples - Buccafurri, al. (1999) (Correct)
Heterogeneous Active Agents, II: Algorithms and Complexity - Eiter, al. (1998) (Correct)
Heterogeneous Active Agents, I: Semantics - Eiter, la. (1998) (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