Sciweavers

199 search results - page 5 / 40
» Denotations for Classical Proofs - Preliminary Results
Sort
View
IJCAI
2003
13 years 9 months ago
A Tractability Result for Reasoning with Incomplete First-Order Knowledge Bases
In previous work, Levesque proposed an extension to classical databases that would allow for a certain form of incomplete first-order knowledge. Since this extension was suffici...
Yongmei Liu, Hector J. Levesque
EJC
2008
13 years 7 months ago
A simple proof for open cups and caps
Let X be a set of points in general position in the plane. General position means that no three points lie on a line and no two points have the same x-coordinate. Y X is a cup, r...
Jakub Cerný
BIRTHDAY
2003
Springer
14 years 24 days ago
Computational Proof as Experiment: Probabilistic Algorithms from a Thermodynamic Perspective
Abstract. A novel framework for the design and analysis of energy-aware algorithms is presented, centered around a deterministic Bit-level (Boltzmann) Random Access Machine or BRAM...
Krishna V. Palem
JCT
2011
83views more  JCT 2011»
13 years 2 months ago
The weighted hook length formula
Abstract. Based on the ideas in [CKP], we introduce the weighted analogue of the branching rule for the classical hook length formula, and give two proofs of this result. The firs...
Ionut Ciocan-Fontanine, Matjaz Konvalinka, Igor Pa...
CORR
2010
Springer
113views Education» more  CORR 2010»
13 years 7 months ago
Game semantics for first-order logic
We refine HO/N game semantics with an additional notion of pointer (mu-pointers) and extend it to first-order classical logic with completeness results. We use a Church style exte...
Olivier Laurent