Applying Temporal Logic to Analysis of Behavior of Cooperating Logic Programs

Authors:
Michael I. Dekhtyar;Alexander Ja. Dikovsky;M. K. Valiev
Affiliations:
-;-;-
Venue:
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Year:
1999

Citing 4
Cited 1

Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Decision Complexity of Variants of Propositional Dynamic Logic

MFCS '80 Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science
On Homeostatic Behavior of Dynamic Deductive Data Bases

Proceedings of the Second International Andrei Ershov Memorial Conference on Perspectives of System Informatics
A temporal logic for reasoning about partially ordered computations (Extended Abstract)

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing

Complexity of Multi-agent Systems Behavior

JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider systems of cooperating logic programs which generalize dynamic deductive databases (DDDBs) from [1,2]. Some properties of the system behavior are defined which ensure an infinite steady life of the system. Decision problems for these properties of cooperating productional logic programs are investigated. It is shown that these problems are reducible to the satisfiability problem for the propositional temporal logic of branching time. It follows that stability problems for the cooperating productional logic programs are decidable with the exponential time complexity.