Tobias Philipp

Orcid: 0000-0002-3606-030X

According to our database1, Tobias Philipp authored at least 23 papers between 2011 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Lazily-Verifiable SAT Proof Checker in SPARK 2014.
Datenschutz und Datensicherheit, 2023

A Logic Programming Approach to Global Logistics in a Co-Design Environment.
Proceedings of the Proceedings 39th International Conference on Logic Programming, 2023

2021
Imaginary carrot or effective fertiliser? A rejoinder on funding and productivity.
Scientometrics, 2021

Smoke Test Planning using Answer Set Programming.
Int. J. Interact. Multim. Artif. Intell., 2021

2019
Inconsistency Proofs for ASP: The ASP - DRUPE Format.
Theory Pract. Log. Program., 2019

2018
Checking Unsatisfiability Proofs in Parallel.
Proceedings of Pragmatics of SAT 2015, 2018

2017
The Complexity of Contextual Abduction in Human Reasoning Tasks.
Proceedings of the YSIP2, 2017

Contextual Abduction and its Complexity Issues.
Proceedings of the 4th International Workshop on Defeasible and Ampliative Reasoning (DARe-17) co-located with the 14th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2017), 2017

Towards a Semantics of Unsatisfiability Proofs with Inprocessing.
Proceedings of the LPAR-21, 2017

Fuzzing and Verifying RAT Refutations with Deletion Information.
Proceedings of the Thirtieth International Florida Artificial Intelligence Research Society Conference, 2017

2016
A Verified Decision Procedure for Pseudo-Boolean Formulas.
Proceedings of the 34th Workshop of the UK Planning and Scheduling Special Interest Group, 2016

DRAT Proofs for XOR Reasoning.
Proceedings of the Logics in Artificial Intelligence - 15th European Conference, 2016

Unsatisfiability Proofs for Parallel SAT Solver Portfolios with Clause Sharing and Inprocessing.
Proceedings of the GCAI 2016. 2nd Global Conference on Artificial Intelligence, September 19, 2016

2015
PBLib - A Library for Encoding Pseudo-Boolean Constraints into CNF.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

An Expressive Model for Instance Decomposition Based Parallel SAT Solvers.
Proceedings of the Frontiers of Combining Systems - 10th International Symposium, 2015

2014
Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers.
Proceedings of the Young Scientists' International Workshop on Trends in Information Processing (YSIP) Co-located with the Sixth International Conference on Infocommunicational Technologies in Science, 2014

Clause Simplifications in Search-Space Decomposition-Based Sat Solvers.
Proceedings of the STAIRS 2014, 2014

Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers.
Proceedings of the POS-14. Fifth Pragmatics of SAT workshop, 2014

A More Compact Translation of Pseudo-Boolean Constraints into CNF Such That Generalized Arc Consistency Is Maintained.
Proceedings of the KI 2014: Advances in Artificial Intelligence, 2014

Formula Simplifications as DRAT Derivations.
Proceedings of the KI 2014: Advances in Artificial Intelligence, 2014

2013
Soundness of Inprocessing in Clause Sharing SAT Solvers.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

2012
Plattformen für mobile Geschäftsanwendungen - am Beispiel der Sybase Unwired Platform.
HMD Prax. Wirtsch., 2012

2011
An Abductive Model for Human Reasoning.
Proceedings of the Logical Formalizations of Commonsense Reasoning, 2011


  Loading...