On the computational complexity of stratified negation in linear-time temporal logic programming (Q2758303)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the computational complexity of stratified negation in linear-time temporal logic programming |
scientific article; zbMATH DE number 1679693
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of stratified negation in linear-time temporal logic programming |
scientific article; zbMATH DE number 1679693 |
Statements
2000
0 references
cycle sum test
0 references
Chronolog program
0 references
On the computational complexity of stratified negation in linear-time temporal logic programming (English)
0 references
