Christos H. Papadimitriou. A note on the expressive power of prolog. EATCS Bulletin, 26:21-23, 1985. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Tractable Inference Relations - Givan, McAllester (Correct)
.... Horn clauses then k a is polynomial time decidable [Aho and Ullman, 1979] Papadirnitriou, 1985] Building on independent results of Vardi and Immerrnan, Papadimitriou showed that superficial Horn sets provide a characterization of the complexity class P [Vardi, 1982] Immerrnan, 1986] [Papadimitriou, 1985]. Let P be any polynomial time predicate on k first order terms. Papadimitriou showed, in essence, that for any such P there exists a set R of superficial Horn clauses such that for any first order terms t, t2, tk we have that O(tl, t2, tn ) if and only if Input(t, t, tk) ka ,ccapt ....
Christos H. Papadimitriou. A note on the expressive power of prolog. EATCS Bulletin, 26:21-23, 1985.
Polynomial-time Computation via Local Inference Relations - Givan, McAllester (2000) (Correct)
.... that datalog programs provide a characterization of the complexity class P any polynomial time predicate on finite databases can be written as a datalog program provided that one is given a successor relation that defines a total order on the domain elements [Vardi, 1982] Immerman, 1986] [Papadimitriou, 1985]. Although datalog programs provide an interesting class of polynomial time inference relations, the class of tractable rule sets is much larger than the class of datalog programs. First of all, one can generalize the concept of a datalog program to the concept of a superficial rule set. We call ....
Christos H. Papadimitriou. A note on the expressive power of prolog. EATCS Bulletin, 26:21--23, 1985.
New Results on Local Inference Relations - Givan, McAllester (1992) (9 citations) (Correct)
.... datalog programs provide a characterization of the complexity class P any polynomial time predicate on finite data bases can be written as a datalog program provided that one is given a successor relation that defines a total order on the domain elements [ Vardi, 1982 ] Immerman, 1986 ] Papadimitriou, 1985 ] Although datalog programs provide an interesting class of polynomial time inference relations, the class of tractable rule sets is much larger than the class of datalog programs. First of all, one can generalize the concept of a datalog program to the concept of a superficial rule set. We call ....
Christos H. Papadimitriou. A note on the expressive power of prolog. EATCS Bulletin, 26:21--23, 1985.
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