Sciweavers

3793 search results - page 486 / 759
» Expressive Description Logics
Sort
View
EUROSYS
2010
ACM
15 years 11 months ago
Policy-based access control for weakly consistent replication
Combining access control with weakly consistent replication presents a challenge if the resulting system is to support eventual consistency. If authorization policy can be tempora...
Ted Wobber, Thomas L. Rodeheffer, Douglas B. Terry
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
15 years 11 months ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
CONCUR
1999
Springer
15 years 11 months ago
Approximate Symbolic Model Checking of Continuous-Time Markov Chains
d abstract) Christel Baiera, Joost-Pieter Katoenb;c and Holger Hermannsc aLehrstuhl fur Praktische Informatik II, University of Mannheim 68131 Mannheim, Germany bLehrstuhl fur Info...
Christel Baier, Joost-Pieter Katoen, Holger Herman...
NMELP
1994
15 years 10 months ago
Static Semantics as Program Transformation and Well-founded Computation
In this paper, we propose a new constructive characterization of those semantics for disjunctive logic programs which are extensions of the well-founded semantics for normal progra...
Stefania Costantini, Gaetano Aurelio Lanzarone
STACS
1994
Springer
15 years 10 months ago
Reachability and the Power of Local Ordering
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
Kousha Etessami, Neil Immerman