698 search results - page 58 / 140 » Model Checking with Multi-valued Logics |
142
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic t...
144
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...
147
click to vote
TOCL
2011
14 years 11 months ago
2011
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the s...
152
click to vote
FUIN
2000
15 years 4 months ago
2000
We give algorithms to construct the least L-model for a given positive modal logic program P, where L can be one of the modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. If L...
125
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we present the theory and practice of co-logic programming (co-LP for brevity), a paradigm that combines both inductive and coinductive logic programming. Co-LP is a ...