93 search results - page 14 / 19 » On the Computational Representation of Classical Logical Con... |
PPDP
2004
Springer
14 years 21 days ago
2004
Springer
We investigate some fundamental properties of the reduction relation in the untyped term calculus derived from Curien and Herbelin’s λµµ. The original λµµ has a system of ...
ILP
2007
Springer
14 years 1 months ago
2007
Springer
A recurrent question in the design of intelligent agents is how to assign degrees of beliefs, or subjective probabilities, to various events in a relational environment. In the sta...
PODS
2011
ACM
12 years 10 months ago
2011
ACM
In the traditional data exchange setting, source instances are restricted to be complete in the sense that every fact is either true or false in these instances. Although natural ...
EUSFLAT
2007
13 years 8 months ago
2007
At present time configurable wireless sensor networks are given special consideration. Wireless sensor networks are now a static elements union. To make such a network a powerful ...
PODS
1994
ACM
13 years 11 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...