Searching for authors named Philippe Devienne – sorted by Relevance.
3 documents found, showing 1 through 3.
-
The Emptiness Problem of One Binary Recursive Horn Clause is Undecidable
- …The simplest recursive program in Horn clause languages is of the form : 8 ? ! ? : p(fact) / : p(lef t) / p(right) : / p(goal) : This corresponds to append--like programs. The two most relevant problems concerning this class are the halting and the emptiness (existence of at least one solution) prob…
- Add To MetaCart
-
Halting Problem of One Binary Horn Clause is Undecidable.
- …. This paper proposes a codification of the halting problem of any Turing machine in the form of only one right--linear binary Horn clause as follows : p(t) / p(tt) : where t (resp. tt) is any (resp. linear) term. Recursivity is well--known to be a crucial and fundamental concept in programming th…
- Cited by 6 (0 self) – Add To MetaCart
-
One Binary Horn Clause is Enough
- …. This paper proposes an equivalent form of the famous BohmJacopini theorem for declarative languages. C. Bohm and G. Jacopini [1] proved that all programming can be done with at most one single whiledo. That result is cited as a mathematical justification for structured programming. A similar r…
- Cited by 1 (1 self) – Add To MetaCart
Showing 1 through 3.
