3970 search results - page 427 / 794 » A Logic For Causal Reasoning |
220
Voted
DLOG
2011
14 years 10 months ago
2011
We prove co-N2ExpTime-hardness for conjunctive query entailment in the description logic ALCOIF , thus improving the previously known 2ExpTime lower bound. The result transfers to ...
171
click to vote
CADE
2007
Springer
16 years 7 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
173
click to vote
CADE
2007
Springer
16 years 7 months ago
2007
Springer
Much research concerning Satisfiability Modulo Theories is devoted to the design of efficient SMT-solvers that integrate a SATsolver with T -satisfiability procedures. The rewrite-...
198
click to vote
ISMB
1998
15 years 8 months ago
1998
Traditionally, biochemical systems are modelled usingkinetics anddifferential equationsin a quantitative simulator. However,for manybiological processes detailed quantitative info...
199
click to vote
ENTCS
2010
15 years 6 months ago
2010
This paper presents a formal framework for compositional reasoning about secure systems. A key insight is to view a trusted system in terms of the interfaces that the various comp...