- The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG programs
Description
- Title: The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG programs
- Group publication title: Lecture Notes in Computer Science ; 1046
- Collective work title: STACS 96 : 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996 : proceedings
- Creator: Marcinkowski, Jerzy
- Pages: S. 427-438
- Date issued: 1996
- Type: Tekst
- Language: eng
- Detailed object type: rozdz
- Object type: Rozdział