Sciweavers

378 search results - page 54 / 76
» Proof interpretations with truth
Sort
View
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 7 months ago
A Meta-Programming Approach to Realizing Dependently Typed Logic Programming
Dependently typed lambda calculi such as the Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and ...
Zachary Snow, David Baelde, Gopalan Nadathur
JCT
2007
90views more  JCT 2007»
13 years 7 months ago
Overpartitions, lattice paths, and Rogers-Ramanujan identities
We define the notions of successive ranks and generalized Durfee squares for overpartitions. We show how these combinatorial statistics give extensions to overpartitions of combin...
Sylvie Corteel, Olivier Mallet
JCT
2010
112views more  JCT 2010»
13 years 6 months ago
Annular embeddings of permutations for arbitrary genus
In the symmetric group on a set of size 2n, let P2n denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as “pairings”, since each ...
I. P. Goulden, William Slofstra
ALT
2004
Springer
14 years 4 months ago
Probabilistic Inductive Logic Programming
Probabilistic inductive logic programming, sometimes also called statistical relational learning, addresses one of the central questions of artificial intelligence: the integratio...
Luc De Raedt, Kristian Kersting
CSL
2009
Springer
14 years 2 months ago
On the Relation between Sized-Types Based Termination and Semantic Labelling
We investigate the relationship between two independently developed termination techniques for rst and higher-order rewrite systems. On the one hand, sized-types based termination...
Frédéric Blanqui, Cody Roux