1916 search results - page 177 / 384 » Reasoning with class algebra |
128
click to vote
LPAR
2010
Springer
15 years 2 months ago
2010
Springer
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...
142
click to vote
ECSQARU
2009
Springer
15 years 2 months ago
2009
Springer
For a presented case, a Bayesian network classifier in essence computes a posterior probability distribution over its class variable. Based upon this distribution, the classifier&#...
117
click to vote
CADE
2009
Springer
16 years 4 months ago
2009
Springer
Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is ess...
158
click to vote
CADE
2008
Springer
16 years 4 months ago
2008
Springer
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...
120
click to vote
CADE
2008
Springer
16 years 4 months ago
2008
Springer
In this paper, we present a variant of the dependency pair method for analysing runtime complexities of term rewrite systems automatically. This method is easy to implement, but si...