Pages that link to "Item:Q5705940"
From MaRDI portal
The following pages link to Logic for Programming, Artificial Intelligence, and Reasoning (Q5705940):
Displaying 18 items.
- Constructing cycles in the simplex method for DPLL(T) (Q1675808) (← links)
- A certifying algorithm for lattice point feasibility in a system of UTVPI constraints (Q1702822) (← links)
- On integer closure in a system of unit two variable per inequality constraints (Q2023870) (← links)
- Propagation via lazy clause generation (Q2272160) (← links)
- Combining SAT solvers with computer algebra systems to verify combinatorial conjectures (Q2360872) (← links)
- Generalizing DPLL and satisfiability for equalities (Q2643080) (← links)
- Integer feasibility and refutations in UTVPI constraints using bit-scaling (Q2684489) (← links)
- A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints (Q2819515) (← links)
- Deduction, strategies, and rewriting (Q2864357) (← links)
- NRCL - A Model Building Approach to the Bernays-Schönfinkel Fragment (Q2964454) (← links)
- Satisfiability Modulo Theories (Q3176369) (← links)
- Extracting a DPLL Algorithm (Q3178287) (← links)
- MathCheck: A Math Assistant via a Combination of Computer Algebra Systems and SAT Solvers (Q3454125) (← links)
- Bounded Model Checking of Analog and Mixed-Signal Circuits Using an SMT Solver (Q3510788) (← links)
- Propagation = Lazy Clause Generation (Q3523077) (← links)
- Ground Interpolation for Combined Theories (Q5191102) (← links)
- Quo Vadis Answer Set Programming? (Q5504648) (← links)
- Computer Aided Verification (Q5716574) (← links)