305 search results - page 54 / 61 » Decidability of Split Equivalence |
LPAR
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. The paper presents the methodology and the results of checking consistency of the knowledge base of CADIAG-2, a large-scale medical expert system. Such knowledge base con...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
WS-BPEL Processes Dieter K?nig IBM B?blingen Laboratory Sch?naicher Stra?e 220, 71032 B?blingen, Germany dieterkoenig@de.ibm.com Niels Lohmann Universit?t Rostock, Institut f?r Inf...
82
Voted
LICS
2006
IEEE
15 years 3 months ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
CONCUR
2004
Springer
15 years 3 months ago
2004
Springer
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
FOIKS
2008
Springer
14 years 11 months ago
2008
Springer
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent ...