137 search results - page 25 / 28 » Conditional independence in propositional logic |
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Abstract The class of ω-regular languages provide a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness...
84
Voted
QEST
2008
IEEE
15 years 4 months ago
2008
IEEE
We present Hintikka games for formulae of the probabilistic temporal logic PCTL and countable labeled Markov chains as models, giving an operational account of the denotational se...
94
Voted
SARA
2009
Springer
15 years 2 months ago
2009
Springer
An important challenge in constraint programming is to rewrite constraint models into executable programs calculating the solutions. This phase of constraint processing may requir...
94
Voted
AAAI
1994
14 years 11 months ago
1994
The situation calculus is a popular technique for reasoning about action and change. However, its restriction to a firstorder syntax and pure deductive reasoning makes it unsuitab...
86
Voted
TCIAIG
2010
14 years 5 months ago
2010
Abstract--Fingerprinting operators generate functional signatures of game players and are useful for their automated analysis independent of representation or encoding. The theory ...