2012; Physical and Mathematical Sciences, 46(1 (227): 43–48
Shared with The Gufo

ON FUNCTIONAL SYMBOL-FREE LOGIC PROGRAMS

L.A. Haykazyan*

Received: 2025-02-19 · Published: 2012-03-06

© 2012 The Author(s) and the original publisher.

CC BY 4.0 This work is licensed under a Creative Commons Attribution 4.0 International License.
Shared article.
Original title
ON FUNCTIONAL SYMBOL-FREE LOGIC PROGRAMS
Author
L.A. Haykazyan
Published
2012-03-06
Licence
Creative Commons Attribution 4.0 International

Abstract

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.
1 / ? 100% Open in new tab Download Cite

Loading the full text…

Download Follow Updates