2436 search results - page 32 / 488 » Comonadic Notions of Computation |
ACL
2001
13 years 9 months ago
2001
In a headed tree, each terminal word can be uniquely labeled with a governing word and grammatical relation. This labeling is a summary of a syntactic analysis which eliminates de...
LANMR
2004
13 years 9 months ago
2004
We recently proposed a definition of a language for nonmonotonic reasoning based on intuitionistic logic. Our main idea is a generalization of the notion of answer sets for arbitr...
FORMATS
2010
Springer
13 years 5 months ago
2010
Springer
We study two-player timed games where the objectives of the two players are not opposite. We focus on the standard notion of Nash equilibrium and propose a series of transformation...
CADE
2009
Springer
14 years 8 months ago
2009
Springer
In the symbolic analysis of security protocols, two classical notions of knowledge, deducibility and indistinguishability, yield corresponding decision problems. We propose a proce...
IWOCA
2009
Springer
14 years 2 months ago
2009
Springer
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether ...