Sciweavers

129 search results - page 2 / 26
» Logical Cryptanalysis as a SAT Problem
Sort
View
ICCSA
2004
Springer
14 years 1 months ago
A Reduced Codification for the Logical Representation of Job Shop Scheduling Problems
Abstract. This paper presents the Job Shop Scheduling Problem (JSSP) represented as the well known Satisfiabilty Problem (SAT). Even though the representation of JSSP in SAT is not...
Juan Frausto Solís, Marco Antonio Cruz-Chav...
SAT
2005
Springer
142views Hardware» more  SAT 2005»
14 years 2 months ago
Optimizations for Compiling Declarative Models into Boolean Formulas
Advances in SAT solver technology have enabled many automated analysis and reasoning tools to reduce their input problem to a SAT problem, and then to use an efficient SAT solver ...
Darko Marinov, Sarfraz Khurshid, Suhabe Bugrara, L...
TPLP
2008
118views more  TPLP 2008»
13 years 8 months ago
Logic programming with satisfiability
This paper presents a Prolog interface to the MiniSat satisfiability solver. Logic programming with satisfiability combines the strengths of the two paradigms: logic programming f...
Michael Codish, Vitaly Lagoon, Peter J. Stuckey
FUIN
2010
93views more  FUIN 2010»
13 years 7 months ago
SAT as a Programming Environment for Linear Algebra
In this paper we present an application of the propositional SATisfiability environment to computing some simple orthogonal matrices and some interesting tasks in the area of cry...
Marian Srebrny, Lidia Stepien
TABLEAUX
2000
Springer
14 years 3 days ago
Consistency Testing: The RACE Experience
Abstract. This paper presents the results of applying RACE, a description logic system for ALCNHR+ , to modal logic SAT problems. Some aspects of the RACE architecture are discusse...
Volker Haarslev, Ralf Möller