154 search results - page 22 / 31 » PAC-Learnability of Determinate Logic Programs |
JSC
2010
13 years 4 months ago
2010
A uniform verification problem for parameterized systems is to determine whether a temporal property is satisfied for every instance of the system which is composed of an arbitrar...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
HPCA
2011
IEEE
13 years 1 months ago
2011
IEEE
Most shared memory systems maximize performance by unpredictably resolving memory races. Unpredictable memory races can lead to nondeterminism in parallel programs, which can suff...
ICALP
2000
Springer
14 years 1 months ago
2000
Springer
Today many formalisms exist for specifying complex Markov chains. In contrast, formalism for specifying the quantitative properties to analyze have remained quite primitive. In th...
CSL
2006
Springer
14 years 1 months ago
2006
Springer
Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on t...