846 search results - page 114 / 170 » Rewrite-Based Decision Procedures |
176
click to vote
FUIN
2010
15 years 3 months ago
2010
We study an extension of monadic second-order logic of order with the uncountability quantifier "there exist uncountably many sets". We prove that, over the class of fini...
184
click to vote
FUIN
2010
15 years 3 months ago
2010
Abstract. Developing a good formalism and an efficient decision procedure for the instance checking problem is desirable for practical application of description logics. The data c...
185
click to vote
IANDC
2011
15 years 1 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
157
click to vote
TR
2010
15 years 23 days ago
2010
This paper reports on a theoretical Bayesian modeling development for residual life prediction in the context of condition-based maintenance. At each monitoring point during a comp...
203
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Although many algorithms have been designed to construct Bayesian network structures using different approaches and principles, they all employ only two methods: those based on i...