158 search results - page 14 / 32 » Space Efficiency of Propositional Knowledge Representation F... |
SAT
2005
Springer
14 years 27 days ago
2005
Springer
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...
JAIR
2006
13 years 7 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
WSC
2004
13 years 8 months ago
2004
We present a conceptual framework for validating reusable behavioral models. The setting for this work is a modern product development environment in which design is performed by ...
KDD
2006
ACM
14 years 7 months ago
2006
ACM
Temporal patterns composed of symbolic intervals are commonly formulated with Allen's interval relations originating in temporal reasoning. This representation has severe dis...
PVLDB
2010
13 years 2 months ago
2010
In this paper, we tackle the problem of efficient skycube computation. We introduce a novel approach significantly reducing domination tests for a given subspace and the number of...