191 search results - page 17 / 39 » Mappings Between Domain Models in Answer Set Programming |
107
click to vote
ACL
2011
14 years 1 months ago
2011
We propose a non-parametric Bayesian model for unsupervised semantic parsing. Following Poon and Domingos (2009), we consider a semantic parsing setting where the goal is to (1) d...
SIGARCH
2008
14 years 9 months ago
2008
Conventional programming models were designed to be used by expert programmers for programming for largescale multiprocessors, distributed computational clusters, or specialized p...
TCS
2010
14 years 8 months ago
2010
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...
LCPC
1993
Springer
15 years 1 months ago
1993
Springer
This paper presents a model for concurrent programming, where programs (concurrent program structures) are represented as composition expressions over component programs with suita...
ML
2006
ACM
14 years 9 months ago
2006
ACM
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...