Siege

swMATH4437MaRDI QIDQ16613FDOQ16613

Author name not available (Why is that?)

Official website: http://www.cs.sfu.ca/research/groups/CL/software/siege/

Cited In (56)

• On the power of clause-learning SAT solvers as resolution engines
• Computer Aided Verification
• Applications of SAT Solvers to Cryptanalysis of Hash Functions
• Logic Programming
• Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
• Theory and Applications of Satisfiability Testing
• Correct Hardware Design and Verification Methods
• Curriculum-based course timetabling with SAT and MaxSAT
• Theory and Applications of Satisfiability Testing
• A Tutorial on Satisfiability Modulo Theories
• Solving Simple Planning Problems with More Inference and No Search
• Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
• A framework for verifying bit-level pipelined machines based on automated deduction and decision procedures
• Solving weighted Max-SAT problems in a reduced search space: a performance analysis
• Modification strategies for SAT-based plan adaptation
• Theory and Applications of Satisfiability Testing
• Towards Robust CNF Encodings of Cardinality Constraints
• Conflict-driven answer set solving: from theory to practice
• HaifaSat
• Title not available (Why is that?)
• SATO
• UCLID
• CPlan
• zChaff
• Valse-XT
• BerkMin
• Chaff
• PaQuBE
• PicoSAT
• SPRINT
• Eureka
• PiMaG
• antom
• iClingo
• NAGSAT
• Picoso
• PMiniSAT
• PMSat
• RSat
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Theory and Applications of Satisfiability Testing
• Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools
• nomore++
• Evaluating CDCL variable scoring schemes
• Assessing progress in SAT solvers through the Lens of incremental SAT
• SCIP: solving constraint integer programs
• An overview of parallel SAT solving
• Approximate Boolean Reasoning: Foundations and Applications in Data Mining
• PaMira
• Planning as satisfiability: heuristics
• On the resolution of bipolar max-min equations.
• Solution Enumeration for Projected Boolean Search Problems
• Search in the patience game `Black Hole'
• Learning rate based branching heuristic for SAT solvers
• Cache conscious data structures for Boolean satisfiability solvers
• Handling Inconsistency In Distributed Software Requirements Specifications Based On Prioritized Merging

This page was built for software: Siege