NP-completeness results concerning the transformation of logic programs into attribute grammars
Attribute grammars and logic programs axe two well investigated formalisms, which were related in [DM85] for the restricted class of simple logic programs. In this paper we define the more restricted class of very simple logic programs and we prove that the problem of deciding, whether a given logic...
Elmentve itt :
| Szerző: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1998
|
| Sorozat: | Acta cybernetica
13 No. 3 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12587 |
| LEADER | 01125nab a2200217 i 4500 | ||
|---|---|---|---|
| 001 | acta12587 | ||
| 005 | 20220613154629.0 | ||
| 008 | 161015s1998 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Lohrey Markus | |
| 245 | 1 | 0 | |a NP-completeness results concerning the transformation of logic programs into attribute grammars |h [elektronikus dokumentum] / |c Lohrey Markus |
| 260 | |c 1998 | ||
| 300 | |a 209-224 | ||
| 490 | 0 | |a Acta cybernetica |v 13 No. 3 | |
| 520 | 3 | |a Attribute grammars and logic programs axe two well investigated formalisms, which were related in [DM85] for the restricted class of simple logic programs. In this paper we define the more restricted class of very simple logic programs and we prove that the problem of deciding, whether a given logic program is (very) simple, is NP-complete. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12587/1/cybernetica_013_numb_003_209-224.pdf |z Dokumentum-elérés |