3527 search results - page 461 / 706 » Test Automation in Practice |
122
Voted
TPHOL
2009
IEEE
15 years 10 months ago
2009
IEEE
Optical systems are becoming increasingly important as they tend to resolve many bottlenecks in the present age communications and electronics. Some common examples include their u...
114
Voted
ECSQARU
2009
Springer
15 years 10 months ago
2009
Springer
Many computational problems linked to reasoning under uncertainty can be expressed in terms of computing the marginal(s) of the combination of a collection of (local) valuation fun...
144
Voted
LPNMR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
147
Voted
LPNMR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In answer-set programming (ASP), many notions of program equivalence have been introduced and formally analysed. A particular line of research in this direction aims at s...
141
Voted
HYBRID
2010
Springer
15 years 10 months ago
2010
Springer
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...