@article{Haykazyan_2021, title={The Degree of Unsolvability of the Completion Semantics for General Logic Programs}, volume={36}, url={http://mpcs.sci.am/index.php/mpcs/article/view/260}, abstractNote={<p>The completion semantics considers interpretations that satisfy a special first-order theory was first introduced in [1]. These interpretations include but are not limited to Herbrand interpretations. Nevertheless, in logic programming the restriction to Herbrand interpretations is very desirable. As [2] remarks, however, this results in a non-recursively enumerable semantics. In this paper we show the П 11 -completeness of the completion semantics with restriction to Herbrand interpretations.</p>}, journal={Mathematical Problems of Computer Science}, author={Haykazyan, Levon A.}, year={2021}, month={Dec.}, pages={7–12} }