Sciweavers

3513 search results - page 529 / 703
» Super Logic Programs
Sort
View
ENTCS
2008
116views more  ENTCS 2008»
13 years 10 months ago
A Bidirectional Refinement Type System for LF
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...
William Lovas, Frank Pfenning
ACTAC
2002
75views more  ACTAC 2002»
13 years 10 months ago
Framework for Studying Substitution
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...
Härmel Nestra
ANOR
2002
67views more  ANOR 2002»
13 years 10 months ago
An Improved Hybrid Model for the Generic Hoist Scheduling Problem
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...
Daniel Riera, Neil Yorke-Smith
AROBOTS
1998
113views more  AROBOTS 1998»
13 years 10 months ago
Grounding Mundane Inference in Perception
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...
Ian Horswill
AAECC
1999
Springer
82views Algorithms» more  AAECC 1999»
13 years 10 months ago
Reasoning over Networks by Symbolic Methods
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...
Thomas Sturm