1712 search results - page 145 / 343 » A Computational Approach to Binding Theory |
107
click to vote
ISIPTA
2003
IEEE
15 years 7 months ago
2003
IEEE
In this paper we adopt the geometric approach to the theory of evidence to study the geometric counterparts of the plausibility functions, or upper probabilities. The computation ...
108
click to vote
ECML
2006
Springer
15 years 5 months ago
2006
Springer
This paper studies the PAC and agnostic PAC learnability of some standard function classes in the learning in higher-order logic setting introduced by Lloyd et al. In particular, i...
105
click to vote
AAAI
2006
15 years 3 months ago
2006
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one...
102
click to vote
AAAI
2006
15 years 3 months ago
2006
Some search problems are most directly specified by boolean combinations of pseudo-boolean constraints. We study a logic PL(PB) whose formulas are of this form, and design local-s...
134
click to vote
JSW
2007
15 years 1 months ago
2007
— The science of physics is based on theories and models as well as experiments: the former structure relations and simplify reality to a degree such that predictions on physical...