532 search results - page 105 / 107 » The Logic of Quasi-MV Algebras |
AIMSA
2010
Springer
13 years 11 months ago
2010
Springer
We propose ontological blending as a new method for `creatively' combining ontologies. In contrast to other combination techniques that aim at integrating or assimilating cate...
AI
2008
Springer
13 years 10 months ago
2008
Springer
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
CSR
2008
Springer
13 years 10 months ago
2008
Springer
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
ENTCS
2006
13 years 9 months ago
2006
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be descr...
PEPM
2011
ACM
13 years 19 days ago
2011
ACM
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...