Please use this identifier to cite or link to this item: doi:10.22028/D291-25002
Title: Satisfiability of the smallest binary program
Author(s): Hanschke, Philipp
Würtz, Jörg
Language: English
Year of Publication: 1993
OPUS Source: Kaiserslautern ; Saarbrücken : DFKI, 1993
SWD key words: Künstliche Intelligenz
Free key words: Theory of computation
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: 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_{1},...,l_{n})leftarrow P(r_{1},...,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.
Link to this record: urn:nbn:de:bsz:291-scidok-38102
Series name: Research report / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-008x]
Series volume: 93-09
Date of registration: 5-Jul-2011
Faculty: SE - Sonstige Einrichtungen
Department: SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
RR_93_09.pdf128,21 kBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.