1963 search results - page 278 / 393 » Applications of Preferences using Answer Set Programming |
129
click to vote
ALT
2004
Springer
15 years 11 months ago
2004
Springer
Kernel functions are typically viewed as providing an implicit mapping of points into a high-dimensional space, with the ability to gain much of the power of that space without inc...
106
click to vote
AIML
1998
15 years 3 months ago
1998
In this paper I will propose a new approach to certain semantic puzzles due to Frege, Kripke and others, and the question of propositional attitudes, via the notion of belief revi...
115
Voted
ICFP
2007
ACM
15 years 6 months ago
2007
ACM
In this paper we introduce the iTask system: a set of combinators to specify work flows in a pure functional language at a very high level of abstraction. Work flow systems are au...
125
Voted
PLDI
2011
ACM
14 years 5 months ago
2011
ACM
The most intuitive memory consistency model for shared-memory multi-threaded programming is sequential consistency (SC). However, current concurrent programming languages support ...
154
click to vote
MCMASTER
1993
15 years 6 months ago
1993
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...