8132 search results - page 217 / 1627 » Dependability, Abstraction, and Programming |
203
click to vote
LPNMR
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...
182
click to vote
ICLP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
180
click to vote
ICMLA
2010
15 years 4 months ago
2010
Abstract--We study how to effectively integrate reinforcement learning (RL) and programming languages via adaptation-based programming, where programs can include non-deterministic...
172
click to vote
COMPSAC
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract. The TransLucid programming language is a low-level intensional language, designed to be sufficiently rich for it to be the target language for translating the common prog...
231
click to vote
ICFP
2012
ACM
13 years 9 months ago
2012
ACM
Most complex software projects are compiled using a build tool (e.g. make), which runs commands in an order satisfying userdefined dependencies. Unfortunately, most build tools r...