PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE (BEOGRAD) (N.S.), Vol. 61(75), pp. 137--152, 1997

PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE (BEOGRAD) (N.S.)
Vol. 61(75), pp. 137--152 (1997)

Previous Article

Next Article

Contents of this Issue

Other Issues

ELibM Journals

ELibM Home

EMIS Home

How to generalize logic programming to arbitrary set of clauses

Slavisa B. Presi\'c

Matematicki fakultet, Beograd, Yugoslavia

Abstract: We state how one can extend Logic Programming to any set of clauses.

Classification (MSC2000): 68N17

Full text of the article:

Compressed PostScript file (67 kilobytes)
PDF file (182 kilobytes)

Electronic fulltext finalized on: 1 Nov 2001. This page was last modified: 6 Feb 2002.

© 2001 Mathematical Institute of the Serbian Academy of Science and Arts
© 2001--2002 ELibM for the EMIS Electronic Edition