3933 search results - page 562 / 787 » Argumentation in the Semantic Web |
175
click to vote
IWMM
2009
Springer
16 years 1 months ago
2009
Springer
This paper presents an analysis that derives a formula describing the worst-case live heap space usage of programs in a functional language with automated memory management (garba...
174
Voted
PPDP
2009
Springer
16 years 1 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
178
click to vote
IJCNN
2007
IEEE
16 years 29 days ago
2007
IEEE
— Serious efforts to develop computerized systems for natural language understanding and machine translation have taken place for more than half a century. Some successful system...
168
click to vote
CSL
2007
Springer
16 years 25 days ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
171
click to vote
BIRTHDAY
2005
Springer
16 years 5 days ago
2005
Springer
I present a formalism that combines two methodologies: objective Bayesianism and Bayesian nets. According to objective Bayesianism, an agent’s degrees of belief (i) ought to sat...