Sciweavers

4128 search results - page 411 / 826
» Learning and using relational theories
Sort
View
TLCA
2009
Springer
16 years 1 months ago
Lexicographic Path Induction
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
Jeffrey Sarnat, Carsten Schürmann
KR
2010
Springer
15 years 11 months ago
Understanding Ontological Levels
In this paper, I defend a multiplicative approach that distinguishes statues from amounts of matter, political entities from physical ones, qua entities (e.g. John qua Alitalia pa...
Claudio Masolo
BCSHCI
2007
15 years 8 months ago
A card-sorting probe of e-banking trust perceptions
This paper investigates the issue of trust mediation in eBanking. The card sorting technique was used to probe factors influencing subjects’ attitudes to alternative e-banking h...
Tim French, Kecheng Liu, Mark Springett
AI
2008
Springer
15 years 7 months ago
On the notion of concept I
It is well known that classical set theory is not expressive enough to adequately model categorization and prototype theory. Recent work on compositionality and concept determinat...
Michael Freund
EJC
2008
15 years 7 months ago
Eriksson's numbers game and finite Coxeter groups
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to i...
Robert G. Donnelly