Sciweavers

1390 search results - page 137 / 278
» On the Algebraic Structure of Convergence
Sort
View
DAC
1994
ACM
15 years 10 months ago
Probabilistic Analysis of Large Finite State Machines
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veri cation problems. Recently, we ha...
Gary D. Hachtel, Enrico Macii, Abelardo Pardo, Fab...
OWLED
2008
15 years 8 months ago
The OWL in the CASL - Designing Ontologies Across Logics
Abstract. In this paper, we show how the web ontology language OWL can be accommodated within the larger framework of the heterogeneous common algebraic specification language HETC...
Oliver Kutz, Dominik Lücke, Till Mossakowski,...
ACL
2006
15 years 8 months ago
Semantic Retrieval for the Accurate Identification of Relational Concepts in Massive Textbases
This paper introduces a novel framework for the accurate retrieval of relational concepts from huge texts. Prior to retrieval, all sentences are annotated with predicate argument ...
Yusuke Miyao, Tomoko Ohta, Katsuya Masuda, Yoshima...
ESORICS
2010
Springer
15 years 7 months ago
Verifying Security Property of Peer-to-Peer Systems Using CSP
Due to their nature, Peer-to-Peer (P2P) systems are subject to a wide range of security issues. In this paper, we focus on a specific security property, called the root authenticit...
Tien Tuan Anh Dinh, Mark Ryan
CORR
2010
Springer
129views Education» more  CORR 2010»
15 years 6 months ago
The complexity of positive first-order logic without equality
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over a fixed, finite structure B. This may be seen as a natural generalisation of ...
Florent R. Madelaine, Barnaby Martin