3513 search results - page 529 / 703 » Super Logic Programs |
91
Voted
ENTCS
2008
15 years 22 days 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...
87
Voted
ACTAC
2002
15 years 16 days ago
2002
This paper describes a framework for handling bound variable renaming and substitution mathematically rigorously with the aim at the same time to stay as close as possible to huma...
67
Voted
ANOR
2002
15 years 16 days 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...
103
click to vote
AROBOTS
1998
15 years 11 days 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...
92
Voted
AAECC
1999
Springer
15 years 10 days 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...