Sciweavers

123 search results - page 16 / 25
» Program verification as probabilistic inference
Sort
View
ERLANG
2007
ACM
13 years 11 months ago
A language for specifying type contracts in Erlang and its interaction with success typings
We propose a small extension of the ERLANG language that allows programmers to specify contracts with type information at the level of individual functions. Such contracts are opt...
Miguel Jimenez, Tobias Lindahl, Konstantinos F. Sa...
BIRTHDAY
2010
Springer
14 years 11 days ago
The Arrow of Time through the Lens of Computing
Egon Börger Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy Realizability of System Interface Specifications 11:30 AM Ofer Strichman Proving Equivalence be...
Krishna V. Palem
AIPS
2007
13 years 10 months ago
Approximate Solution Techniques for Factored First-Order MDPs
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
Scott Sanner, Craig Boutilier
ML
2006
ACM
131views Machine Learning» more  ML 2006»
13 years 7 months ago
Markov logic networks
We propose a simple approach to combining first-order logic and probabilistic graphical models in a single representation. A Markov logic network (MLN) is a first-order knowledge b...
Matthew Richardson, Pedro Domingos
APIN
2000
155views more  APIN 2000»
13 years 7 months ago
Defeasible Logic on an Embedded Microcontroller
Defeasible logic is a system of reasoning in which rules have exceptions, and when rules conflict, the one that applies most specifically to the situation wins out. This paper repo...
Michael A. Covington