Local search for solving satisfiability of polynomial formulas

DOI10.1007/978-3-031-37703-7_5zbMATH Open1545.68122MaRDI QIDQ6535529FDOQ6535529

Authors: Haokun Li, Bican Xia, Tianqi Zhao 

Publication date: 12 January 2024

zbMATH Keywords

local searchSMTcylindrical algebraic decompositionnonlinear real arithmeticcell-jump

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Symbolic computation and algebraic computation (68W30) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Local search for Boolean satisfiability with configuration checking and subscore
• The MathSAT5 SMT solver
• Title not available (Why is that?)
• Partial cylindrical algebraic decomposition for quantifier elimination
• Title not available (Why is that?)
• Solving non-linear arithmetic
• A Model-Constructing Satisfiability Calculus
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Improved projection for cylindrical algebraic decomposition
• Quantifier elimination for real algebra -- the quadratic case and beyond
• Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break
• Title not available (Why is that?)
• Stochastic local search for SMT: combining theory solvers with WalkSAT
• Handbook of Model Checking
• Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings
• Constructing a single cell in cylindrical algebraic decomposition
• Incremental Linearization for Satisfiability and Verification Modulo Nonlinear Arithmetic and Transcendental Functions
• raSAT: an SMT solver for polynomial constraints
• Precise and Complete Propagation Based Local Search for Satisfiability Modulo Theories
• Computer Aided Verification
• Local Search for SMT on Linear Integer Arithmetic

This page was built for publication: Local search for solving satisfiability of polynomial formulas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535529)