Sciweavers

2649 search results - page 317 / 530
» Temporal Theories of Reasoning
Sort
View
LICS
1990
IEEE
14 years 1 months ago
Normal Process Representatives
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...
Vijay Gehlot, Carl A. Gunter
CSL
2007
Springer
14 years 1 months ago
MSO on the Infinite Binary Tree: Choice and Order
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
Arnaud Carayol, Christof Löding
ECSQARU
2007
Springer
14 years 1 months ago
Information Affinity: A New Similarity Measure for Possibilistic Uncertain Information
Abstract. This paper addresses the issue of measuring similarity between pieces of uncertain information in the framework of possibility theory. In a first part, natural properties...
Ilyes Jenhani, Nahla Ben Amor, Zied Elouedi, Salem...
CTRSA
2009
Springer
106views Cryptology» more  CTRSA 2009»
14 years 1 months ago
Communication-Efficient Private Protocols for Longest Common Subsequence
We design communication efficient two-party and multi-party protocols for the longest common subsequence (LCS) and related problems. Our protocols achieve privacy with respect to p...
Matthew K. Franklin, Mark Gondree, Payman Mohassel
ATAL
2006
Springer
14 years 1 months ago
Formalizing typicality of objects and context-sensitivity in ontologies
In multiagent systems ontologies are essential because they facilitate tasks like communications and reasoning. In this paper, inspired by studies in cognitive psychology, we pres...
Ching-man Au Yeung, Ho-fung Leung