3970 search results - page 516 / 794 » A Logic For Causal Reasoning |
335
click to vote
CADE
2011
Springer
14 years 6 months ago
2011
Springer
We describe asasp, a symbolic reachability procedure for the analysis of administrative access control policies. The tool represents access policies and their administrative action...
150
click to vote
CBMS
2007
IEEE
16 years 1 months ago
2007
IEEE
A major challenge for ontology integration is to deal with inconsistencies. Existing merging tools are based on classical logic and are forced to avoid inconsistencies (to prevent...
202
click to vote
CADE
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...
201
click to vote
CADE
2012
Springer
13 years 9 months ago
2012
Springer
Combination of theories underlies the design of satisfiability modulo theories (SMT) solvers. The Nelson-Oppen framework can be used to build a decision procedure for the combinat...
217
click to vote
SIAMCOMP
2012
13 years 9 months ago
2012
Abstract. In the framework of Carter and Wegman, a k-independent hash function maps any k keys independently. It is known that 5independent hashing provides good expected performan...