Physically based dynamic models are able to describe variable shapes without prior training. Their behaviour to find an object is intuitive, which facilitates corrections of false...
We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be ...
It is well known that the ratio of the number of clauses to the number of variables in a random k-SAT instance is highly correlated with the instance’s empirical hardness. We con...
Eugene Nudelman, Kevin Leyton-Brown, Holger H. Hoo...
Local pattern discovery, pattern set formation and global modeling may be viewed as three consecutive steps in a global modeling process. As each of these three steps have gained a...
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...