598 search results - page 109 / 120 » Optimized Reasoning in Description Logics Using Hypertableau... |
138
click to vote
TACAS
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
104
click to vote
ICLP
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Region-based memory management is a form of compiletime memory management, well-known from the functional programming world. This paper describes a static region analysis...
121
click to vote
AI
2000
Springer
15 years 1 months ago
2000
Springer
We show that global caching can be used with propagation of both satisfiability and unsatisfiability in a sound manner to give an EXPTIME algorithm for checking satisfiability w.r....
102
click to vote
CADE
2006
Springer
16 years 1 months ago
2006
Springer
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
ECSQARU
2009
Springer
15 years 8 months ago
2009
Springer
Many computational problems linked to reasoning under uncertainty can be expressed in terms of computing the marginal(s) of the combination of a collection of (local) valuation fun...