scientific article
From MaRDI portal
Publication:3506045
zbMath1145.68501MaRDI QIDQ3506045
Publication date: 11 June 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (46)
Combining SAT solvers with computer algebra systems to verify combinatorial conjectures ⋮ Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT ⋮ SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving ⋮ SAT-Based Model Checking ⋮ Satisfiability Modulo Theories ⋮ MathCheck: A Math Assistant via a Combination of Computer Algebra Systems and SAT Solvers ⋮ Optimization Modulo Theories with Linear Rational Costs ⋮ Verification Modulo theories ⋮ An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty ⋮ Local Search For Satisfiability Modulo Integer Arithmetic Theories ⋮ Abstract Solvers for Computing Cautious Consequences of ASP programs ⋮ Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers ⋮ A Boolean satisfiability approach to the resource-constrained project scheduling problem ⋮ Probabilistic satisfiability: algorithms with the presence and absence of a phase transition ⋮ Superposition decides the first-order logic fragment over ground theories ⋮ Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces ⋮ On deciding satisfiability by theorem proving with speculative inferences ⋮ SMT proof checking using a logical framework ⋮ Symbolic Execution as DPLL Modulo Theories ⋮ Towards SMT Model Checking of Array-Based Systems ⋮ Resolution proof transformation for compression and interpolation ⋮ Solving constraint satisfaction problems with SAT modulo theories ⋮ Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories ⋮ Complexity-sensitive decision procedures for abstract argumentation ⋮ Learning modulo theories for constructive preference elicitation ⋮ On Interpolation in Decision Procedures ⋮ Structured learning modulo theories ⋮ Exploiting subproblem optimization in SAT-based maxsat algorithms ⋮ Light-Weight SMT-based Model Checking ⋮ Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis ⋮ Interpolant Generation for UTVPI ⋮ MNiBLoS: a SMT-based solver for continuous t-norm based logics and some of their modal expansions ⋮ Automated Reasoning in $\mathcal{ALCQ}$ via SMT ⋮ Delegatable Functional Signatures ⋮ Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints ⋮ Efficient Interpolant Generation in Satisfiability Modulo Theories ⋮ \textsc{OptiMathSAT}: a tool for optimization modulo theories ⋮ Colors Make Theories Hard ⋮ SPASS-SATT. A CDCL(LA) solver ⋮ Advanced SMT techniques for weighted model integration ⋮ Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis ⋮ Theory decision by decomposition ⋮ Combination of convex theories: modularity, deduction completeness, and explanation ⋮ Automated generation of hybrid automata for multi-rigid-body mechanical systems and its application to the falsification of safety properties ⋮ Iterative and core-guided maxsat solving: a survey and assessment ⋮ Combined task- and network-level scheduling for distributed time-triggered systems
Uses Software
This page was built for publication:
