Sciweavers

24 search results - page 3 / 5
» Portfolio-based Parallel SAT solving
Sort
View
AAAI
2007
14 years 1 months ago
Inference Rules for High-Order Consistency in Weighted CSP
Recently defined resolution calculi for Max-SAT and signed Max-SAT have provided a logical characterization of the solving techniques applied by Max-SAT and WCSP solvers. In this...
Carlos Ansótegui, Maria Luisa Bonet, Jordi ...
LPAR
2010
Springer
13 years 9 months ago
Partitioning SAT Instances for Distributed Solving
Abstract. In this paper we study the problem of solving hard propositional satisfiability problem (SAT) instances in a computing grid or cloud, where run times and communication b...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...
ACTA
2006
154views more  ACTA 2006»
13 years 11 months ago
Solving HPP and SAT by P Systems with Active Membranes and Separation Rules
The P systems (or membrane systems) are a class of distributed parallel computing devices of a biochemical type, where membrane division is the frequently investigated way for obta...
Linqiang Pan, Artiom Alhazov
CSCLP
2008
Springer
14 years 19 days ago
Challenges in Constraint-Based Analysis of Hybrid Systems
In the analysis of hybrid discrete-continuous systems, rich arithmetic constraint formulae with complex Boolean structure arise naturally. The iSAT algorithm, a solver for such for...
Andreas Eggers, Natalia Kalinnik, Stefan Kupfersch...
ICTAC
2004
Springer
14 years 4 months ago
Replicative - Distribution Rules in P Systems with Active Membranes
Abstract. P systems (known also as membrane systems) are biologically motivated theoretical models of distributed and parallel computing. The two most interesting questions in the ...
Tseren-Onolt Ishdorj, Mihai Ionescu