( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Compressing UNSAT Search Trees with Caching.

, , , и . ICAART (3), стр. 358-365. SCITEPRESS, (2023)

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.

Rainer Berrer

Frauke Rita Berres

Andrea Berres

Alexander Josef Berresheim

Eva Maria Sybille Berret

 

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

Planning Personalised Museum Visits., , и . ICAPS, AAAI, (2013)On Irrelevant Literals in Pseudo-Boolean Constraint Learning., , , и . IJCAI, стр. 1148-1154. ijcai.org, (2020)Scheduled for July 2020, Yokohama, Japan, postponed due to the Corona pandemic..Representing Policies for Quantified Boolean Formulae., , , , и . KR, стр. 286-297. AAAI Press, (2006)Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation., , , и . CP, том 10416 из Lecture Notes in Computer Science, стр. 596-614. Springer, (2017)Automatic repair of buggy if conditions and missing preconditions with SMT., , , и . CSTVA, стр. 30-39. ACM, (2014)Autour de SAT : le calcul d'impliquants P-restreints, algorithmes et applications. (Beyond SAT: P-restricted implicant, algorithms and applications).. Paul Sabatier University, Toulouse, France, (2000)Fifty-Five Solvers in Vancouver: The SAT 2004 Competition., и . SAT (Selected Papers, том 3542 из Lecture Notes in Computer Science, стр. 321-344. Springer, (2004)Weakening Conflicting Information for Iterated Revision and Knowledge Integration., , , и . IJCAI, стр. 109-118. Morgan Kaufmann, (2001)A SAT-Based Approach for Solving the Modal Logic S5-Satisfiability Problem., , , , и . AAAI, стр. 3864-3870. AAAI Press, (2017)Compressing UNSAT Search Trees with Caching., , , и . ICAART (3), стр. 358-365. SCITEPRESS, (2023)