SATO

swMATH4451MaRDI QIDQ16627FDOQ16627

Author name not available (Why is that?)

Official website: http://www.divms.uiowa.edu/~hzhang/sato/

Cited In (only showing first 100 items - show all)

• Title not available (Why is that?)
• PSATO: A distributed propositional prover and its application to quasigroup problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• RobinX: a three-field classification and unified data format for round-robin sports timetabling
• Solving SAT problem by heuristic polarity decision-making algorithm
• BerkMin: A fast and robust SAT-solver
• SatEx: A web-based framework for SAT experimentation
• Computer Aided Verification
• Logic Programming and Nonmonotonic Reasoning
• Theory and Applications of Satisfiability Testing
• Title not available (Why is that?)
• An experiment with satisfiability modulo SAT
• Extending and implementing the stable model semantics
• Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
• Heuristics for the mirrored traveling tournament problem
• An improved SAT formulation for the social golfer problem
• Reconfigurable computing. The theory and practice of FPGA-based computation.
• Title not available (Why is that?)
• DDDLIB
• HaifaSat
• ManySAT
• March_eq
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• SatEx
• SATLIB
• QingTing1
• Siege
• PBS
• SAT competition
• SATIRE
• zChaff
• FINDER
• DCTP
• GrAnDe
• SCOTT
• BerkMin
• Chaff
• PaMiraXT
• PaQuBE
• PicoSAT
• Quaffle
• PrecoSAT
• DIMACS
• CVC
• Jerusat
• HeerHugo
• QUBOS
• SATORI
• MGTP
• HANNIBAL
• SOCRATES
• XHSTT
• GridJM
• NAGSAT
• Picoso
• PMiniSAT
• PMSat
• ppfolio
• QMiraXT
• SArTagnan
• AMUSE
• XtremWeb
• MUP
• ZetaSAT
• SATLIB Benchmark Suite
• Skeptik
• Roo
• FOCI
• Leibniz
• RSat
• DiffSat
• EVC
• Velev SAT Benchmarks
• HordeSat
• Title not available (Why is that?)
• ALIAS
• ICS
• clpb
• HordeQBF
• MPIDepQBF
• PKind
• 3TAP
• ModGen
• Murphi
• semprop
• OKlibrary
• SAT Solver Verification
• BooleForce
• ZRes
• RobinX
• Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL
• Another look at graph coloring via propositional satisfiability
• \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
• Extending the Smodels system with cardinality and weight constraints
• Towards a unified model of search in theorem-proving: subgoal-reduction strategies
• On the resolution of bipolar max-min equations.
• Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers

This page was built for software: SATO