How to Generalize Logic Programming to Arbitrary set of Clauses
Publications de l'Institut Mathématique, _N_S_61 (1997) no. 75, p. 137
Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
We state how one can extend Logic Programming to any set of
clauses.
@article{PIM_1997_N_S_61_75_a16,
author = {Slavi\v{s}a B. Pre\v{s}i\'c},
title = {How to {Generalize} {Logic} {Programming} to {Arbitrary} set of {Clauses}},
journal = {Publications de l'Institut Math\'ematique},
pages = {137 },
publisher = {mathdoc},
volume = {_N_S_61},
number = {75},
year = {1997},
zbl = {0942.68017},
language = {en},
url = {http://geodesic.mathdoc.fr/item/PIM_1997_N_S_61_75_a16/}
}
TY - JOUR AU - Slaviša B. Prešić TI - How to Generalize Logic Programming to Arbitrary set of Clauses JO - Publications de l'Institut Mathématique PY - 1997 SP - 137 VL - _N_S_61 IS - 75 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/PIM_1997_N_S_61_75_a16/ LA - en ID - PIM_1997_N_S_61_75_a16 ER -
Slaviša B. Prešić. How to Generalize Logic Programming to Arbitrary set of Clauses. Publications de l'Institut Mathématique, _N_S_61 (1997) no. 75, p. 137 . http://geodesic.mathdoc.fr/item/PIM_1997_N_S_61_75_a16/