Satisfiability of the smallest binary program
- 2 April 1993
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 45 (5), 237-241
- https://doi.org/10.1016/0020-0190(93)90210-z
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Halting problem of one binary Horn clause is undecidableLecture Notes in Computer Science, 1993
- Undecidability of the Horn-clause implication problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programmingTheoretical Computer Science, 1990
- Implication of clauses is undecidableTheoretical Computer Science, 1988
- Efficient tests for top-down termination of logical rulesJournal of the ACM, 1988
- Controlling recursive inferenceArtificial Intelligence, 1986
- Krom formulas with one dyadic predicate letterThe Journal of Symbolic Logic, 1976
- On the Decision Problem for Formulas in which all Disjunctions are BinaryPublished by Elsevier ,1971
- Flow diagrams, turing machines and languages with only two formation rulesCommunications of the ACM, 1966
- A variant of a recursively unsolvable problemBulletin of the American Mathematical Society, 1946