61 search results - page 10 / 13 » On Resolution Proofs for Combinational Equivalence |
105
Voted
FUIN
2006
14 years 11 months ago
2006
Traditional Machine Learning approaches based on single inference mechanisms have reached their limits. This causes the need for a framework that integrates approaches based on aba...
106
click to vote
CP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
SAGT
2009
Springer
15 years 6 months ago
2009
Springer
We study implementability in dominant strategies of social choice functions when sets of types are multi-dimensional and convex, sets of outcomes are arbitrary, valuations for outc...
LFCS
2007
Springer
15 years 5 months ago
2007
Springer
LP can be seen as a logic of knowledge with justifications. Artemov’s Realization Theorem says justifications can be extracted from validities in the more conventional Hintikk...
ATVA
2004
Springer
15 years 3 months ago
2004
Springer
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...