A competitive and cooperative approach to propositional satisfiability

DOI10.1016/j.dam.2006.04.015zbMath1142.68036OpenAlexW1983758948MaRDI QIDQ860390

Seiji Ueda, Naoyuki Tamura, Yoshito Sasaura, Katsumi Inoue, Mutsunori Banbara, Takehide Soh

Publication date: 9 January 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.04.015

zbMATH Keywords

planningjob-shop schedulingSATSAT solverparallel execution

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Parallel algorithms in computer science (68W10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Compiling finite linear CSP into SAT

Uses Software

• MiniSat
• GridSAT
• SATLIB
• PSATO
• Walksat
• SATO
• zChaff
• Chaff
• Graphplan
• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast parallel SAT-solver -- efficient workload balancing
• Fast planning through planning graph analysis
• The \(Multi\)-SAT algorithm
• PSATO: A distributed propositional prover and its application to quasigroup problems
• GridSAT: Design and implementation of a computational grid application
• Generating hard satisfiability problems
• The Complexity of Flowshop and Jobshop Scheduling
• GRASP: a search algorithm for propositional satisfiability
• Theory and Applications of Satisfiability Testing
• A machine program for theorem-proving
• Job Shop Scheduling by Local Search
• Algorithm portfolios