Sciweavers

1712 search results - page 25 / 343
» A Computational Approach to Binding Theory
Sort
View
CCS
2008
ACM
15 years 1 months ago
Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev-Yao) intruders are modeled by Horn theories and security analysis boils d...
Ralf Küsters, Tomasz Truderung
BMCBI
2007
120views more  BMCBI 2007»
14 years 12 months ago
Recognition of interferon-inducible sites, promoters, and enhancers
Background: Computational analysis of gene regulatory regions is important for prediction of functions of many uncharacterized genes. With this in mind, search of the target genes...
Elena A. Ananko, Yury V. Kondrakhin, Tatyana I. Me...
ACTAC
2002
75views more  ACTAC 2002»
14 years 11 months ago
Framework for Studying Substitution
This paper describes a framework for handling bound variable renaming and substitution mathematically rigorously with the aim at the same time to stay as close as possible to huma...
Härmel Nestra
AAAI
1994
15 years 1 months ago
Soundness and Completeness of a Logic Programming Approach to Default Logic
We present a method of representing some classes of default theories as normal logic programs. The main point is that the standard semantics (i.e. SLDNF-resolution) computes answe...
Grigoris Antoniou, Elmar Langetepe
WOA
2003
15 years 1 months ago
Using a Properties Based Naming System in Mobile Agents Environments for Pervasive Computing
— Mobile Agents model is widely accepted as a good solution to simplify the coordination in a complex and distributed environment. Pervasive computing, presents many issues regar...
Fabio Tarantino, Alessio Ravani, Mario Zambrini