Stratified negation in temporal logic programming and the cycle-sum test
We consider stratified negation in temporal logic programming. We demonstrate that the cycle-sum test (which was initially proposed for detecting deadlocks in the context of temporal functional programming) can also be used as a syntactic stratification test for temporal logic programming. Therefore...
Saved in:
| Published in: | Theoretical computer science Vol. 254; no. 1; pp. 663 - 676 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Amsterdam
Elsevier B.V
2001
Elsevier |
| Subjects: | |
| ISSN: | 0304-3975, 1879-2294 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!