Robert Givan, David McAllester  Home/Search
Context
Related
| purdue.edu/~givan/brown/pap...tocl00.ps 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: purdue.edu/~givan/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the concept of a local set of inference rules. A local rule set can be automatically transformed into a rule set for which bottom-up evaluation terminates in polynomial time. The local-rule-set transformation gives polynomial-time evaluation strategies for a large variety of rule sets that cannot be given terminating evaluation strategies by any other known automatic technique. This paper discusses three new results. First, it is shown that every polynomial-time predicate can be... (Update)
Similar documents (at the sentence level):
38.5%: New Results on Local Inference Relations - Givan, McAllester (1992) (Correct)
11.8%: Tractable Inference Relations - Givan, McAllester (Correct)
Active bibliography (related documents): More All
0.2: On the Complexity Analysis of Static Analyses - McAllester (1999) (Correct)
0.1: Inclusion Constraints over Non-empty Sets of Trees - Müller, Niehren, Podelski (1997) (Correct)
0.1: Complexity of Linear Standard Theories - Lynch, Morawska (2001) (Correct)
Similar documents based on text: More All
0.6: Automatic Recognition of Tractability in Inference Relations - McAllester (1990) (Correct)
0.4: Tarskian Set Constraints - Givan, McAllester, Witty, Kozen (1996) (Correct)
0.3: Tarskian Set Constraints are in NEXPTIME - Mielniczuk, Pacholski (1998) (Correct)
BibTeX entry: (Update)
@misc{ givan-polynomialtime,
author = "Robert Givan and David McAllester",
title = "Polynomial-time Computation via Local Inference Relations",
url = "citeseer.ist.psu.edu/givan00polynomialtime.html" }
Citations (may not include all citations):981 Principles of Database and Knowledge-Base Systems (context) - Ullman - 1988
702 Consistency in networks of relations (context) - Mackworth - 1977
561 Constraint logic programming (context) - Jaffar, Lassez - 1987
380 Constraint Satisfaction in Logic Programming (context) - van Hentenryck - 1989
379 Complexity of relational query languages (context) - Vardi - 1982
245 Relational queries computable in polynomial time - Immerman - 1986
66 Complexity of finitely presented algebras (context) - Kozen - 1977
66 Algebraic Reconstruction of Types and Effects - Jouvelot, Gifford - 1991
50 Bottom-up beats top-down for datalog (context) - Ullman - 1989
46 Query evaluation in recursive databases: bottom-up and top-d.. (context) - Bry - 1990
41 An algorithm for reasoning about equality (context) - Shostak - 1978
32 Automatic recognition of tractability in inference relations - McAllester - 1993
31 Ontic: A Knowledge Representation System for Mathematics (context) - McAllester - 1989
29 Estimating the efficiency of backtrack programs (context) - Knuth - 1975
21 Bottom-up evaluation of logic programs (context) - Naughton, Ramakrishnan - 1991
21 Natural language based inference procedures applied to Schub.. - Givan, McAllester et al. - 1991
10 Automated Complexity Analysis Based on Ordered Resolution - Basin, Ganzinger - 2000
3 A note on the expressive power of prolog (context) - Papadimitriou - 1985
2 MIT Artificial Intelligence Laboratory Memo (context) - McAllester, Siskind et al. - 1991
1 Type and Effect Systems (context) - Talpin, Jouvelot - 1992
Documents on the same site (http://dynamo.ecn.purdue.edu/~givan/): More
Natural Language Based Inference Procedures applied to.. - Givan, McAllester.. (1991) (Correct)
Inferring Program Specifications in Polynomial-Time - Givan (1996) (Correct)
Tarskian Set Constraints - McAllester, Givan, Witty, Kozen (1996) (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