Skip to Main content Skip to Navigation
Conference papers

The halting problem of one binary Horn clause is undecidable

Philippe Devienne 1 Patrick Lebègue 2 Jean-Christophe Routier 1, 3
3 SMAC - Systèmes Multi-Agents et Comportements
CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Résumé : No abstract
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00732053
Contributor : Hal Lifl <>
Submitted on : Thursday, September 13, 2012 - 5:22:12 PM
Last modification on : Friday, November 27, 2020 - 2:20:02 PM

Identifiers

  • HAL Id : hal-00732053, version 1

Citation

Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier. The halting problem of one binary Horn clause is undecidable. Proceedings of 1993 Symposium on Theoretical Aspects of Computer Science (STACS'93), 1993, undef, France. pp.48--57. ⟨hal-00732053⟩

Share

Metrics

Record views

323