3691 search results - page 288 / 739 » Bayesian Logic Programs |
279
click to vote
SLOGICA
2011
15 years 1 months ago
2011
The paper contains a survey of (mainly unpublished) adaptive logics of inductive generalization. These defeasible logics are precise formulations of certain methods. Some attentio...
161
Voted
LPNMR
2005
Springer
16 years 6 days ago
2005
Springer
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
197
click to vote
POPL
2012
ACM
14 years 2 months ago
2012
ACM
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...
189
click to vote
SAC
2010
ACM
15 years 4 months ago
2010
ACM
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...
193
click to vote
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present proach based on the use of higher-order abstract syntax and...