✦ LIBER ✦

Paraconsistent Computation Tree Logic

✍ Scribed by Ken Kaneiwa; Norihiro Kamide

Publisher: Springer
Year: 2011
Tongue: English
Weight: 322 KB
Volume: 29
Category: Article
ISSN: 0288-3635
DOI: 10.1007/s00354-009-0116-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Paraconsistent intelligent systems of co

Paraconsistent intelligent systems of computer logics

✍ A. S. Kuzichev 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 726 KB

Quantified Computation Tree Logic

✍ A.C. Patthak; I. Bhattacharya; A. Dasgupta; Pallab Dasgupta; P.P. Chakrabarti 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 109 KB

Computation Tree Logic (CTL) is one of the most syntactically elegant and computationally attractive temporal logics for branching time model checking. In this paper, we observe that while CTL can be verified in time polynomial in the size of the state space times the length of the formula, there is

Paraconsistent logics?

✍ B. H. Slater 📂 Article 📅 1995 🏛 Springer Netherlands 🌐 English ⚖ 208 KB

Min-max Computation Tree Logic

✍ Pallab Dasgupta; P.P. Chakrabarti; Jatindra Kumar Deka; Sriram Sankaranarayanan 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 342 KB

This paper introduces a branching time temporal query language called Min-max CTL which is similar in syntax to the popular temporal logic, CTL [Clarke et al., ACM Trans. Program. Lang. Systems 8 (1986) 244]. However unlike CTL, Min-max CTL can express timing queries on a timed model. We show that i

Paraconsistent quantum logics

✍ Maria Luisa Dalla Chiara; Roberto Giuntini 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 621 KB

The Paraconsistent Logics PJ

✍ Newton C. A. da Costa; V. S. Subrahmanian; Carlo Vago 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 582 KB