4370 search results - page 687 / 874 » Algebra of Logic Programming |
125
click to vote
ENTCS
2008
15 years 4 months ago
2008
We present a system of refinement types for LF in the style of recent formulations where only canonical forms are well-typed. Both the usual LF rules and the rules for type refine...
97
Voted
ANOR
2002
15 years 3 months ago
2002
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
137
Voted
AROBOTS
1998
15 years 3 months ago
1998
We describe a uniform technique for representing both sensory data and the attentional state of an agent using a subset of modal logic with indexicals. The resulting representation...
131
click to vote
AAECC
1999
Springer
15 years 3 months ago
1999
Springer
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
147
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
—We present a new model for distributed shared memory systems, based on remote data accesses. Such features are offered by network interface cards that allow one-sided operations...