Sciweavers

185 search results - page 21 / 37
» Induction in an Abstraction Space: A Form of Constructive In...
Sort
View
CADE
2006
Springer
14 years 8 months ago
Partial Recursive Functions in Higher-Order Logic
Abstract. Based on inductive definitions, we develop an automated tool for defining partial recursive functions in Higher-Order Logic and providing appropriate reasoning tools for ...
Alexander Krauss
LPAR
2010
Springer
13 years 5 months ago
Disunification for Ultimately Periodic Interpretations
Abstract. Disunification is an extension of unification to first-order formulae over syntactic equality atoms. Instead of considering only syntactic equality, I extend a disunifica...
Matthias Horbach
TCS
2011
13 years 2 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
ICML
2008
IEEE
14 years 8 months ago
Automatic discovery and transfer of MAXQ hierarchies
We present an algorithm, HI-MAT (Hierarchy Induction via Models And Trajectories), that discovers MAXQ task hierarchies by applying dynamic Bayesian network models to a successful...
Neville Mehta, Soumya Ray, Prasad Tadepalli, Thoma...
IDA
2005
Springer
14 years 1 months ago
Combining Bayesian Networks with Higher-Order Data Representations
Abstract. This paper introduces Higher-Order Bayesian Networks, a probabilistic reasoning formalism which combines the efficient reasoning mechanisms of Bayesian Networks with the...
Elias Gyftodimos, Peter A. Flach