3973 search results - page 592 / 795 » Records for Logic Programming |
137
click to vote
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...
134
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...
149
Voted
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...
153
click to vote
ICML
2008
IEEE
16 years 5 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...
254
click to vote
POPL
2009
ACM
16 years 4 months ago
2009
ACM
In this paper, we show how pattern matching can be seen to arise from a proof term assignment for the focused sequent calculus. This use of the Curry-Howard correspondence allows ...