URSA: A System for Uniform Reduction to SAT

DOI10.2168/LMCS-8(3:30)2012zbMath1248.68456arXiv1012.1255OpenAlexW2045196404MaRDI QIDQ3166220

Predrag Janičić

Publication date: 22 October 2012

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1012.1255

zbMATH Keywords

specification languagesSAT problemconstraint solving

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (7)

Constructibility classes for triangle location problems ⋮ Proving Correctness of a KRK Chess Endgame Strategy by Using Isabelle/HOL and Z3 ⋮ On black-box optimization in divide-and-conquer SAT solving ⋮ Finding Effective SAT Partitionings Via Black-Box Optimization ⋮ Unnamed Item ⋮ meSAT: multiple encodings of CSP to SAT ⋮ Theorem proving as constraint solving with coherent logic

Uses Software

• MiniSat
• CPLEX
• MiniZinc
• SATzilla
• clasp
• Pex
• URBiVA
• CBMC
• Sugar
• G12
• SIMPLY
• fzn2smt
• URSA

This page was built for publication: URSA: A System for Uniform Reduction to SAT