73 search results - page 7 / 15 » The Strength of Multilinear Proofs |
COCOON
2007
Springer
15 years 3 months ago
2007
Springer
We investigate the connection between propositional proof systems and their canonical pairs. It is known that simulations between proof systems translate to reductions between the...
81
Voted
GI
2009
Springer
15 years 2 months ago
2009
Springer
Abstract: Free theorems establish interesting properties of parametrically polymorphic functions, solely from their types, and serve as a nice proof tool. For pure and lazy functio...
IJCAI
2003
14 years 11 months ago
2003
Efficient implementations of DPLL with the addition of clause learning are the fastest complete satisfiability solvers and can handle many significant real-world problems, such as...
145
Voted
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
MayBMS is a state-of-the-art probabilistic database management system which leverages the strengths of previous database research for achieving scalability. As a proof of concept ...
AUSAI
2007
Springer
15 years 3 months ago
2007
Springer
In this paper we show how to capture dialogue games in Defeasible Logic. We argue that Defeasible Logic is a natural candidate and general representation formalism to capture dialo...