( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
SAT Modulo Linear Arithmetic for Solving Polynomial Constraints.

, , , , и . J. Autom. Reason., 48 (1): 107-131 (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Carsten Albert

Albert Moser

Albert Waal

Albert Moser

Albert Schlecht

 

Другие публикации лиц с тем же именем

6 Years of SMT-COMP., , , , и . J. Autom. Reason., 50 (3): 243-277 (2013)Employee Scheduling With SAT-Based Pseudo-Boolean Constraint Solving., , , и . IEEE Access, (2021)Cardinality Networks: a theoretical and empirical study., , , и . Constraints An Int. J., 16 (2): 195-221 (2011)Analyzing Multiple Conflicts in SAT: An Experimental Evaluation., , и . LPAR, том 94 из EPiC Series in Computing, стр. 306-316. EasyChair, (2023)A Parametric Approach for Smaller and Better Encodings of Cardinality Constraints., , , и . CP, том 8124 из Lecture Notes in Computer Science, стр. 80-96. Springer, (2013)Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers., , , , и . ACM Trans. Comput. Log., 20 (4): 25:1-25:36 (2019)Practical algorithms for unsatisfiability proof and core generation in SAT solvers., , , и . AI Commun., 23 (2-3): 145-157 (2010)Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)., , и . J. ACM, 53 (6): 937-977 (2006)IntSat: Integer Linear Programming by Conflict-Driven Constraint-Learning., , и . CoRR, (2024)Congruence Closure with Integer Offsets., и . LPAR, том 2850 из Lecture Notes in Computer Science, стр. 78-90. Springer, (2003)