329 search results - page 58 / 66 » Resolution-based argumentation semantics |
150
click to vote
IJCNN
2007
IEEE
15 years 11 months 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...
143
click to vote
CSL
2007
Springer
15 years 11 months 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...
131
click to vote
BIRTHDAY
2005
Springer
15 years 10 months 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...
145
click to vote
TLCA
2005
Springer
15 years 10 months ago
2005
Springer
αProlog is a logic programming language which is well-suited for rapid prototyping of type systems and operational semantics of typed λ-calculi and many other languages involving...
136
click to vote
CONCUR
2004
Springer
15 years 10 months ago
2004
Springer
We define a language whose type system, incorporating session types, allows complex protocols to be specified by types and verified by static typechecking. A session type, asso...