3481 search results - page 548 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
117
Voted
ENTCS
2008
15 years 3 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...
107
Voted
ACTAC
2002
15 years 3 months 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...
131
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...
142
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...
146
click to vote
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...