Sciweavers

7988 search results - page 222 / 1598
» A Useful Undecidable Theory
Sort
View
ENTCS
2007
113views more  ENTCS 2007»
15 years 19 days ago
On the Decidability of the Safety Problem for Access Control Policies
An access control system regulates the rights of users to gain access to resources in accordance with a specified policy. The rules in this policy may interact in a way that is n...
E. Kleiner, T. Newcomb
IANDC
2007
151views more  IANDC 2007»
15 years 18 days ago
Transducer-based analysis of cryptographic protocols
Cryptographic protocols can be divided into (1) protocols where the protocol steps are simple from a computational point of view and can thus be modeled by simple means, for insta...
Ralf Küsters, Thomas Wilke
138
Voted
JAPLL
2007
135views more  JAPLL 2007»
15 years 17 days ago
Open answer set programming for the semantic web
We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guard...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
116
Voted
BMCBI
2005
99views more  BMCBI 2005»
15 years 17 days ago
Effective ambiguity checking in biosequence analysis
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...
Janina Reeder, Peter Steffen, Robert Giegerich
ENTCS
2007
126views more  ENTCS 2007»
15 years 14 days ago
Context Dependent Procedures and Computed Types in -eriFun
We present two enhancements of the functional language L which is used in the eriFun system to write programs and formulate statements about them. Context dependent procedures all...
Andreas Schlosser, Christoph Walther, Michael Gond...