523 search results - page 53 / 105 » On the Power of Quantum Proofs |
103
click to vote
EACL
1989
ACL Anthology
15 years 1 months ago
1989
ACL Anthology
Koskenniemi's model of two-level morphology has been very influential in recent years, but definitions of the formalism have generally been phrased in terms of a compilation ...
108
click to vote
AMAI
1998
Springer
14 years 11 months ago
1998
Springer
Overgeneralization is a major issue in the identification of grammars for formal languages from positive data. Different formulations of generalization and specialization strate...
141
click to vote
CEFP
2007
Springer
15 years 6 months ago
2007
Springer
This tutorial paper aims to provide the necessary expertise for working with the proof assistant Sparkle, which is dedicated to the lazy functional programming language Clean. The ...
109
click to vote
AAAI
2008
15 years 2 months ago
2008
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
CLIMA
2004
15 years 1 months ago
2004
Abstract. We present an encoding of a sequent calculus for a multiagent epistemic logic in Athena, an interactive theorem proving system for many-sorted first-order logic. We then ...