Pages that link to "Item:Q5717462"

The following pages link to Mechanizing Mathematical Reasoning (Q5717462):

Displaying 18 items.

• Optimal rectangle packing (Q610984) (← links)
• On the modelling and optimization of preferences in constraint-based temporal reasoning (Q646549) (← links)
• Answer set programming based on propositional satisfiability (Q861709) (← links)
• The SAT-based approach to separation logic (Q862390) (← links)
• M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures (Q862395) (← links)
• Fast congruence closure and extensions (Q876046) (← links)
• Backtracking algorithms for disjunctions of temporal constraints (Q1575430) (← links)
• Human rationality challenges universal logic (Q1931349) (← links)
• Translation-based approaches for solving disjunctive temporal problems with preferences (Q2331097) (← links)
• Solving strong controllability of temporal problems with uncertainty using SMT (Q2342602) (← links)
• Modelling and solving temporal reasoning as propositional satisfiability (Q2389682) (← links)
• Processes and continuous change in a SAT-based planner (Q2457662) (← links)
• Generalizing DPLL and satisfiability for equalities (Q2643080) (← links)
• Encoding OCL Data Types for SAT-Based Verification of UML/OCL Models (Q3012970) (← links)
• Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT (Q3172891) (← links)
• Satisfiability Modulo Theories (Q3176369) (← links)
• Variant-Based Satisfiability in Initial Algebras (Q4686604) (← links)
• An interdisciplinary experimental evaluation on the disjunctive temporal problem (Q6080502) (← links)