Sciweavers

3323 search results - page 105 / 665
» Computational Semantics with Functional Programming
Sort
View
IJCAI
2007
14 years 11 months ago
A Fully Connectionist Model Generator for Covered First-Order Logic Programs
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
Sebastian Bader, Pascal Hitzler, Steffen Höll...
AAAI
2000
14 years 11 months ago
DATALOG with Constraints - An Answer-Set Programming System
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
Deborah East, Miroslaw Truszczynski
POPL
2006
ACM
15 years 10 months ago
Small bisimulations for reasoning about higher-order imperative programs
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
Vasileios Koutavas, Mitchell Wand
ESOP
2011
Springer
14 years 1 months ago
Measure Transformer Semantics for Bayesian Machine Learning
Abstract. The Bayesian approach to machine learning amounts to inferring posterior distributions of random variables from a probabilistic model of how the variables are related (th...
Johannes Borgström, Andrew D. Gordon, Michael...
AGP
2003
IEEE
15 years 3 months ago
Time Equations for Lazy Functional (Logic) Languages
There are very few approaches to measure the execution costs of lazy functional (logic) programs. The use of a lazy execution mechanism implies that the complexity of an evaluation...
Elvira Albert, Josep Silva, Germán Vidal