Sciweavers

422 search results - page 70 / 85
» Multithreaded SAT Solving
Sort
View
JCS
2008
94views more  JCS 2008»
15 years 1 months ago
Preprocessing for controlled query evaluation with availability policy
Controlled Query Evaluation (CQE) defines a logical framework to protect confidential information in a database. By modeling a user's a priori knowledge appropriately, a CQE ...
Joachim Biskup, Lena Wiese
ICST
2010
IEEE
15 years 13 days ago
Timed Moore Automata: Test Data Generation and Model Checking
Abstract—In this paper we introduce Timed Moore Automata, a specification formalism which is used in industrial train control applications for specifying the real-time behavior ...
Helge Löding, Jan Peleska
CPAIOR
2006
Springer
15 years 5 months ago
An Efficient Hybrid Strategy for Temporal Planning
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
Zhao Xing, Yixin Chen, Weixiong Zhang
CP
2009
Springer
16 years 2 months ago
Exploiting Problem Structure for Solution Counting
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
Aurélie Favier, Philippe Jégou, Simo...
CSR
2007
Springer
15 years 8 months ago
New Bounds for MAX-SAT by Clause Learning
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some...
Alexander S. Kulikov, Konstantin Kutzkov