2767 search results - page 188 / 554 » Universal Exponentiation Algorithm |
BIRTHDAY
1999
Springer
15 years 6 months ago
1999
Springer
We define simple-regular expressions and languages. Simple-regular languages provide a necessary condition for a language to be outfix-free. We design algorithms that compute si...
105
click to vote
TABLEAUX
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. linTAP is a tableau prover for the multiplicative and exponential fragment M?LL of Girards linear logic. It proves the validity of a given formula by constructing an anal...
100
click to vote
AAAI
2007
15 years 4 months ago
2007
Binary voting trees provide a succinct representation for a large and prominent class of voting rules. In this paper, we investigate the PAC-learnability of this class of rules. W...
DLOG
2007
15 years 4 months ago
2007
Abstract. Conjunctive query answering is an important DL reasoning task. Although this task is by now quite well-understood, tight complexity bounds for conjunctive query answering...
105
Voted
WSC
2007
15 years 4 months ago
2007
We discuss efficient Monte Carlo (MC) methods for the estimation of convex risk measures within the portfolio credit risk model CreditMetrics. Our focus lies on the Utilitybased ...