ON FUNCTIONAL SYMBOL-FREE LOGIC PROGRAMS
DOI:
https://doi.org/10.46991/PYSU:A/2012.46.1.043Keywords:
logic programming, functional symbol-free programs, algorithmic problemsAbstract
In the present article logic programs (both with and without negation) that do not use functional symbols are studied. Three algorithmic problems for functional symbol-free programs are investigated: the existence of a solvable interpreter, the problem of Δ-equivalence and the problem of logical equivalence. The first two problems are known to be decidable for functional symbol-free definite programs. We show that the third one is also decidable for such programs. In contrast, all three problems are shown to be undedicable for functional symbol-free general programs.
Downloads
Published
2012-03-06
How to Cite
Haykazyan, L. (2012). ON FUNCTIONAL SYMBOL-FREE LOGIC PROGRAMS. Proceedings of the YSU A: Physical and Mathematical Sciences, 46(1 (227), 43–48. https://doi.org/10.46991/PYSU:A/2012.46.1.043
Issue
Section
Informatics
License
Copyright (c) 2012 Proceedings of the YSU
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.