D.W. Loveland & G. Nadathur, `Proof procedures for logic programming', Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 5, D.M. Gabbay, C.J. Hogger & J.A. Robinson (eds.), Oxford University Press, 1998, pp. 163234. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Database Dependency Discovery: A Machine Learning Approach - Flach, Savnik (1999) (1 citation) (Correct)
.... the term subsumption, was introduced in the context of induction by Plotkin [25, 26] In theorem proving the above version is termed subsumption, whereas subsumption indicates a special case in which the number of literals of the subsumant does not exceed the number of literals of the subsumee [16]. 4 An alternative view of induction of integrity constraints is obtained if we view the data (e.g. a database relation or a Herbrand model) as one example, i.e. a member of the extension of the set of satisfied integrity constraints, which re establishes the extensional interpretation of ....
D.W. Loveland & G. Nadathur, `Proof procedures for logic programming', Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 5, D.M. Gabbay, C.J. Hogger & J.A. Robinson (eds.), Oxford University Press, 1998, pp. 163234.
Database Dependency Discovery: A Machine Learning Approach - Flach, Savnik (1999) (1 citation) (Correct)
No context found.
D.W. Loveland & G. Nadathur, `Proof procedures for logic programming', Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 5, D.M. Gabbay, C.J. Hogger & J.A. Robinson (eds.), Oxford University Press, 1998, pp. 163234.
A Class of Rewriting Rules and Reverse Transformation.. - Akama.. (2001) (1 citation) (Correct)
No context found.
Loveland, D. W. and Nadathur, G., Proof Procedures for Logic Programming, in: Gabbay, D. M., Hogger, C. J., and Robinson, J. A. (eds.), "Handbook of Logic in Artificial Intelligence and Logic Programming", Vol. 5, Oxford University Press, 1998, pp. 163--234.
Theorem Proving for Untyped Constructive λ-Calculus.. - Ramsay (2001) (Correct)
No context found.
D W Loveland and G Nadathur. Proof procedures for logic programming. In D M Gabbay, C J Hogger, and J A Robinson, editors, Handbook of logic in arti cial intelligence and logic programming: volume 5, logic programming, pages 163-234. Clarendon Press, Oxford, 1998.
Theorem Proving for Untyped Constructive λ-Calculus.. - Ramsay (Correct)
No context found.
D W Loveland and G Nadathur. Proof procedures for logic programming. In D M Gabbay, C J Hogger, and J A Robinson, editors, Handbook of logic in artificial intelligence and logic programming: volume 5, logic programming, pages 163--234. Clarendon Press, Oxford, 1998.
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