The following pages link to (Q3506045):
Displaying 45 items.
- Combined task- and network-level scheduling for distributed time-triggered systems (Q258438) (← links)
- Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces (Q436418) (← links)
- On deciding satisfiability by theorem proving with speculative inferences (Q438533) (← links)
- Resolution proof transformation for compression and interpolation (Q479815) (← links)
- Solving constraint satisfaction problems with SAT modulo theories (Q487632) (← links)
- Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories (Q487655) (← links)
- Complexity-sensitive decision procedures for abstract argumentation (Q490451) (← links)
- Structured learning modulo theories (Q511777) (← links)
- Exploiting subproblem optimization in SAT-based maxsat algorithms (Q525063) (← links)
- An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty (Q892228) (← links)
- Probabilistic satisfiability: algorithms with the presence and absence of a phase transition (Q905995) (← links)
- Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis (Q1037399) (← links)
- Theory decision by decomposition (Q1041591) (← links)
- Combination of convex theories: modularity, deduction completeness, and explanation (Q1041593) (← links)
- Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers (Q1697332) (← links)
- Superposition decides the first-order logic fragment over ground theories (Q1949088) (← links)
- Learning modulo theories for constructive preference elicitation (Q2238637) (← links)
- MNiBLoS: a SMT-based solver for continuous t-norm based logics and some of their modal expansions (Q2282273) (← links)
- \textsc{OptiMathSAT}: a tool for optimization modulo theories (Q2303246) (← links)
- SPASS-SATT. A CDCL(LA) solver (Q2305409) (← links)
- Advanced SMT techniques for weighted model integration (Q2321319) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- Combining SAT solvers with computer algebra systems to verify combinatorial conjectures (Q2360872) (← links)
- A Boolean satisfiability approach to the resource-constrained project scheduling problem (Q2430594) (← links)
- SMT proof checking using a logical framework (Q2441776) (← links)
- Delegatable Functional Signatures (Q2798783) (← links)
- Colors Make Theories Hard (Q2817916) (← links)
- Optimization Modulo Theories with Linear Rational Costs (Q2946768) (← links)
- On Interpolation in Decision Procedures (Q3010355) (← links)
- Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT (Q3172891) (← links)
- SAT-Based Model Checking (Q3176368) (← links)
- Satisfiability Modulo Theories (Q3176369) (← links)
- SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving (Q3453240) (← links)
- MathCheck: A Math Assistant via a Combination of Computer Algebra Systems and SAT Solvers (Q3454125) (← links)
- Towards SMT Model Checking of Array-Based Systems (Q3541687) (← links)
- Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints (Q3617770) (← links)
- Abstract Solvers for Computing Cautious Consequences of ASP programs (Q5108499) (← links)
- Light-Weight SMT-based Model Checking (Q5178977) (← links)
- Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis (Q5191098) (← links)
- Interpolant Generation for UTVPI (Q5191101) (← links)
- Automated Reasoning in $\mathcal{ALCQ}$ via SMT (Q5200031) (← links)
- Symbolic Execution as DPLL Modulo Theories (Q5240106) (← links)
- Efficient Interpolant Generation in Satisfiability Modulo Theories (Q5458340) (← links)
- Automated generation of hybrid automata for multi-rigid-body mechanical systems and its application to the falsification of safety properties (Q5861104) (← links)
- Verification Modulo theories (Q6056642) (← links)
