Sciweavers

361 search results - page 30 / 73
» Analytic Methods for the Logic of Proofs
Sort
View
ALT
2004
Springer
14 years 5 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
JUCS
2007
71views more  JUCS 2007»
13 years 8 months ago
Rates of Asymptotic Regularity for Halpern Iterations of Nonexpansive Mappings
: In this paper we obtain new effective results on the Halpern iterations of nonexpansive mappings using methods from mathematical logic or, more specifically, proof-theoretic te...
Laurentiu Leustean
ACL
1989
13 years 9 months ago
Parsing as Natural Deduction
The logic behind parsers for categorial grammars can be formalized in several different ways. Lambek Calculus (LC) constitutes an example for a natural deduction 1 style parsing m...
Esther König
LICS
2007
IEEE
14 years 2 months ago
Environmental Bisimulations for Higher-Order Languages
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...
Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii
POPL
2006
ACM
14 years 8 months ago
Certified assembly programming with embedded code pointers
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
Zhaozhong Ni, Zhong Shao