( en | de | ru )

 

Disambiguation of "Philipp, Tobias"

Author of the publication

copydeleteadd this publication to your clipboard
Unsatisfiability Proofs for Parallel SAT Solver Portfolios with Clause Sharing and Inprocessing.

. GCAI, volume 41 of EPiC Series in Computing, page 24-38. EasyChair, (2016)

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. You can also use the button next to the name to display some publications already assigned to the person.

Tobias Philipp

Philipp Tobias Meyer

Tobias Philipp Haschek

Tobias Peter Philipp

Tobias Max Philipp Hartwich

 

Other publications of authors with the same name

Plattformen für mobile Geschäftsanwendungen - am Beispiel der Sybase Unwired Platform., and . HMD Prax. Wirtsch., (2012)subsequently labeled as volume 49 number 4 by Springer.Smoke Test Planning using Answer Set Programming., , and . Int. J. Interact. Multim. Artif. Intell., 6 (5): 57-65 (2021)Contextual Abduction and its Complexity Issues., , and . DARe@LPNMR, volume 1872 of CEUR Workshop Proceedings, page 58-70. CEUR-WS.org, (2017)Towards a Semantics of Unsatisfiability Proofs with Inprocessing., and . LPAR, volume 46 of EPiC Series in Computing, page 65-84. EasyChair, (2017)Unsatisfiability Proofs for Parallel SAT Solver Portfolios with Clause Sharing and Inprocessing.. GCAI, volume 41 of EPiC Series in Computing, page 24-38. EasyChair, (2016)A More Compact Translation of Pseudo-Boolean Constraints into CNF Such That Generalized Arc Consistency Is Maintained., , and . KI, volume 8736 of Lecture Notes in Computer Science, page 123-134. Springer, (2014)PBLib - A Library for Encoding Pseudo-Boolean Constraints into CNF., and . SAT, volume 9340 of Lecture Notes in Computer Science, page 9-16. Springer, (2015)The Complexity of Contextual Abduction in Human Reasoning Tasks., , and . YSIP, volume 1837 of CEUR Workshop Proceedings, page 65-74. CEUR-WS.org, (2017)Fuzzing and Verifying RAT Refutations with Deletion Information., , , and . FLAIRS, page 190-193. AAAI Press, (2017)Clause Simplifications in Search-Space Decomposition-Based Sat Solvers.. STAIRS, volume 264 of Frontiers in Artificial Intelligence and Applications, page 211-219. IOS Press, (2014)