4573 search results - page 461 / 915 » Automated Reasoning |
159
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Matrix interpretations can be used to bound the derivational complexity of term rewrite systems. In particular, triangular matrix interpretations over the natural numbers are known...
142
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Unification in Description Logics has been proposed as a novel inference service that can, for example, be used to detect redundancies in ontologies. In a recent paper, we have sho...
191
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
We present an explicitly typed lambda calculus "`a la Church" based on the union and intersection types discipline; this system is the counterpart of the standard type a...
172
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
We consider a mild extension of universal algebra in which terms are built both from deterministic and probabilistic variables, and are interpreted as distributions. We formulate a...
168
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
A rational and selfish environment may have an incentive to cheat the system it interacts with. Cheating the system amounts to reporting a stream of inputs that is different from ...