Model checking with probabilistic tabled logic programming
From MaRDI portal
Publication:4911143
DOI10.1017/S1471068412000245zbMath1260.68062arXiv1204.4736OpenAlexW2154113949MaRDI QIDQ4911143
Scott A. Smolka, C. R. Ramakrishnan, Andrey Gorlin
Publication date: 13 March 2013
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.4736
Specification and verification (program logics, model checking, etc.) (68Q60) Logic programming (68N17)
Related Items (5)
Symbolic DNN-tuner ⋮ The distribution semantics for normal programs with function symbols ⋮ Infinite probability computation by cyclic explanation graphs ⋮ Lifted discriminative learning of probabilistic logic programs ⋮ Unnamed Item
Uses Software
Cites Work
- Results on the propositional \(\mu\)-calculus
- A calculus of mobile processes. I
- A logic for reasoning about time and reliability
- Probabilistic temporal logics via the modal mu-calculus
- Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
- Model Checking Probabilistic Pushdown Automata
This page was built for publication: Model checking with probabilistic tabled logic programming