19130 search results - page 325 / 3826 » Modelling multi-path problems |
162
click to vote
MFCS
2005
Springer
16 years 6 days ago
2005
Springer
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...
183
click to vote
FMCAD
2004
Springer
16 years 2 days ago
2004
Springer
We present a new and very simple translation of the bounded model checking problem which is linear both in the size of the formula and the length of the bound. The resulting CNF-fo...
167
click to vote
BIRD
2008
Springer
15 years 8 months ago
2008
Springer
The swap matching problem consists if finding a pattern in a text, while allowing for transpositions in the pattern. A new approach using a graph-theoretic model was presented in [...
130
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
The problem of deciding the probability model equivalence of two PRISM programs is addressed. In the finite case this problem can be solved (albeit slowly) using techniques from a...
180
click to vote
AAAI
2000
15 years 8 months ago
2000
The task of generating minimal models of a knowledge base is a significant computational problem in artificial intelligence. This task is at the computational heart of diagnosis s...