论文信息 - Oriented Equational Clauses as a Programming Language - 字舞流文

Oriented Equational Clauses as a Programming Language

In the Prolog language, Horn clauses of first-order logic are regarded as programs, and the resolution procedure is used as an interpreter.

Laurent Fribourg | L. Fribourg

[1] L. Wos,et al. Paramodulation and Theorem-Proving in First-Order Theories with Equality , 1983 .

[2] Laurent Fribourg. Oriented Equational Clauses as a Programming Language , 1984, J. Log. Program..

[3] Laurent Fribourg,et al. A Superposition Oriented Theorem Prover , 1983, IJCAI.

[4] Christoph M. Hoffmann,et al. Programming with Equations , 1982, TOPL.

[5] Pierpaolo Degano,et al. A Functional Plus Predicate Logic Programming , 1980 .

[6] Robert A. Kowalski,et al. The Semantics of Predicate Logic as a Programming Language , 1976, JACM.

[7] Nachum Dershowitz,et al. Computing with Rewrite Systems , 1985, Inf. Control..

[8] Alain Colmerauer,et al. Prolog en 10 figures , 1983, SPLT.

[9] G. Huet,et al. Equations and rewrite rules: a survey , 1980 .

[10] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[11] Alain Colmerauer. Prolog in 10 figures , 1985, CACM.

[12] James R. Slagle,et al. Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity , 1974, JACM.

[13] William A. Kornfeld. Equality for Prolog , 1983, IJCAI.

[14] Nachum Dershowitz,et al. Rewrite Methods for Clausal and Non-Clausal Theorem Proving , 1983, ICALP.

[15] François Fages,et al. Associative-Commutative Unification , 1984, CADE.