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...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science Vol. 254; no. 1; pp. 663 - 676
Main Author: Rondogiannis, P.
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 2001
Elsevier
Subjects:
Applied sciences
Computer science; control theory; systems
Cycle-sum test
Exact sciences and technology
Negation
Programming theory
Stratification
Temporal logic programming
Theoretical computing
Temporal logic programming
Negation
Stratification
Cycle-sum test
Canonical atom
Logic programming
Cycle sum test
Temporal reference
Logic
Temporal logic
ISSN:0304-3975, 1879-2294
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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, on the one hand we exhibit a class of temporal logic programs with negation which have a well-defined semantics, and on the other hand we provide further evidence that the cycle-sum test is a fundamental one in the area of temporal programming.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/S0304-3975(00)00374-1