Czech DPLL(T) Cited by user Jj14 on 23 Feb 2024 V informatice je DPLL(T) technika pro stanovení splnitelnosti problémů SMT (splnitelnost modulo teorie).
English Satisfiability modulo theories Cited by user Siddharthist on 04 Dec 2023 In computer science and mathematical logic, satisfiability modulo theories (SMT) is the problem of determining whether a mathematical formula is satisfiable.
English DPLL(T) Cited by user Siddharthist on 29 Nov 2023 In computer science, DPLL(T) is a framework for determining the satisfiability of SMT problems.