Chaff

swMATH6916MaRDI QIDQ18982FDOQ18982

scientific article; zbMATH DE number Author name (Why is no real title available?)

Official website: http://www.princeton.edu/~chaff/software.html

(only showing first 100 items - show all)

• Clause/Term resolution and learning in the evaluation of quantified Boolean formulas
• Exact Max-SAT solvers for over-constrained problems
• Solving satisfiability problems with preferences
• Propagation via lazy clause generation
• Verification of timed automata via satisfiability checking
• The model evolution calculus as a first-order DPLL method
• scientific article; zbMATH DE number 5542982 (Why is no real title available?)
• On the resolution of bipolar max-min equations.
• scientific article; zbMATH DE number 1979551 (Why is no real title available?)
• scientific article; zbMATH DE number 1796136 (Why is no real title available?)
• scientific article; zbMATH DE number 1903356 (Why is no real title available?)
• scientific article; zbMATH DE number 2090318 (Why is no real title available?)
• Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL
• Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
• Efficiently checking propositional refutations in HOL theorem provers
• Integrating external deduction tools with ACL2
• Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 8th international conference, CPAIOR 2011, Berlin, Germany, May 23--27, 2011. Proceedings
• Interpolation systems for ground proofs in automated deduction: a survey
• On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations
• An experiment with satisfiability modulo SAT
• Semantically-guided goal-sensitive reasoning: model representation
• Improving MCS enumeration via caching
• On abstract modular inference systems and solvers
• Solution Enumeration for Projected Boolean Search Problems
• Negative effects of modeling techniques on search performance
• Finding Reductions Automatically
• On the relation among answer set solvers
• scientific article; zbMATH DE number 5852793 (Why is no real title available?)
• A framework for satisfiability modulo theories
• Using SAT in QBF
• Theory and Applications of Satisfiability Testing
• Answer set programming based on propositional satisfiability
• scientific article; zbMATH DE number 1903365 (Why is no real title available?)
• Property-directed incremental invariant generation
• scientific article; zbMATH DE number 2111140 (Why is no real title available?)
• A Boolean satisfiability approach to the resource-constrained project scheduling problem
• scientific article; zbMATH DE number 2243370 (Why is no real title available?)
• Solving RCPSP/max by lazy clause generation
• An interpolating theorem prover
• Conflict analysis in mixed integer programming
• Mosel
• LiSA
• Mistral
• CaDiCaL
• MapleCOMSPS
• MapleCOMSPS_LRB
• sunny-cp
• YalSAT
• maxino
• OMiGA
• CRN++
• xorro
• STP
• tiny_sha3
• Linear Encodings of Bounded LTL Model Checking
• RC2
• Cassowary
• Antenna Toolbox
• ATPDraw
• LEKIN
• SeisLab
• SeismicLab
• TEXTNN
• GNU parallel
• Mjollnir
• DynAlloy
• CCAnr
• cnf2aig
• countAntom
• Maple_LCM_Dist_ChronoBT
• probSAT
• FourierSAT
• Wombit
• VIS
• Sparrow2Riss
• Analyzing Context-Free Grammars Using an Incremental SAT Solver
• Explaining circuit propagation
• Specification and Verification of Multi-Agent Systems
• Iterative and core-guided maxsat solving: a survey and assessment
• Efficient CNF encoding of Boolean cardinality constraints
• Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
• Non existence of some mixed Moore graphs of diameter 2 using SAT
• Theory and Applications of Satisfiability Testing
• A survey of satisfiability modulo theory
• Curriculum-based course timetabling with SAT and MaxSAT
• Extended Resolution Proofs for Symbolic SAT Solving with Quantification
• Another look at graph coloring via propositional satisfiability
• SMTS: Distributed, Visualized Constraint Solving
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Reconfigurable computing. The theory and practice of FPGA-based computation.
• Wombit: a portfolio bit-vector solver using word-level propagation
• On Solving the Partial MAX-SAT Problem
• Explaining the \texttt{cumulative} propagator
• Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs
• Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation
• An algorithm for direct construction of complete merged processes
• Conflict-driven answer set solving: from theory to practice
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing

This page was built for software: Chaff