Skip to main content Skip to main navigation


Satisfiability of the Smallest Binary Program

Philipp Hanschke; Jörg Würtz
DFKI, DFKI Research Reports (RR), Vol. 93-09, 1993.


Recursivity is well known to be a crucial and important concept in programming theory. The simplest scheme of recursion in the context of logic programming is the binary Horn clause P(l1, ..., ln) ← P(r1, ..., rn). The decidability of the satisfiability problem of programs consisting of such a rule, a fact and a goal -- called smallest binary program -- has been a goal of research for some time. In this paper the undecidability of the smallest binary program is shown by a simple reduction of the Post Correspondence Problem.