Satisfiability of the Smallest Binary Program

Deutsches Forschungszentrum für Künstliche Intelligenz
German Research Center for Artificial Intelligence

English

Publikation

Philipp Hanschke; Jörg Würtz

DFKI, DFKI Research Reports (RR), Vol. 93-09, 1993.

Zusammenfassung

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(l₁, ..., l_n) ← P(r₁, ..., r_n). 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.

RR-93-09.pdf (pdf, 128 KB )

Folgen Sie uns auf:

Herausgeber

Deutsches Forschungszentrum für
Künstliche Intelligenz GmbH (DFKI)

Trippstadter Str. 122
67663 Kaiserslautern
Deutschland

Tel.: +49 631 20575 0

info@dfki.de

Alle Ansehen

Standorte

Deutsches Forschungszentrum für Künstliche Intelligenz
German Research Center for Artificial Intelligence

