default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTobias Philipp
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j5]André Dietrich, Christopher Schmidt, Nico Enghardt, Tobias Philipp:
Lazily-Verifiable SAT Proof Checker in SPARK 2014. Datenschutz und Datensicherheit 47(8): 487-491 (2023)- [c19]Emmanuelle Dietz, Tobias Philipp, Gerrit Schramm, Andreas Zindel:
A Logic Programming Approach to Global Logistics in a Co-Design Environment. ICLP 2023: 227-240 - 2021
- [j4]Tobias Philipp, Valentin Roland, Lukas Schweizer:
Smoke Test Planning using Answer Set Programming. Int. J. Interact. Multim. Artif. Intell. 6(5): 57-65 (2021) - [j3]Rachel Heyard
, Tobias Philipp, Hanna Hottenrott:
Imaginary carrot or effective fertiliser? A rejoinder on funding and productivity. Scientometrics 126(11): 9333-9338 (2021)
2010 – 2019
- 2019
- [j2]Mario Alviano, Carmine Dodaro, Johannes Klaus Fichte, Markus Hecher, Tobias Philipp, Jakob Rath:
Inconsistency Proofs for ASP: The ASP - DRUPE Format. Theory Pract. Log. Program. 19(5-6): 891-907 (2019) - [i1]Mario Alviano, Carmine Dodaro, Johannes Klaus Fichte, Markus Hecher, Tobias Philipp, Jakob Rath:
Inconsistency Proofs for ASP: The ASP-DRUPE Format. CoRR abs/1907.10389 (2019) - 2018
- [c18]Norbert Manthey, Tobias Philipp:
Checking Unsatisfiability Proofs in Parallel. POS@SAT 2018: 34-49 - 2017
- [c17]Walter Forkel, Tobias Philipp, Adrian Rebola-Pardo, Elias Werner:
Fuzzing and Verifying RAT Refutations with Deletion Information. FLAIRS 2017: 190-193 - [c16]Tobias Philipp, Adrián Rebola-Pardo:
Towards a Semantics of Unsatisfiability Proofs with Inprocessing. LPAR 2017: 65-84 - [c15]Emmanuelle-Anna Dietz Saldanha, Steffen Hölldobler, Tobias Philipp:
Contextual Abduction and its Complexity Issues. DARe@LPNMR 2017: 58-70 - [c14]Emmanuelle-Anna Dietz Saldanha, Steffen Hölldobler, Tobias Philipp:
The Complexity of Contextual Abduction in Human Reasoning Tasks. YSIP 2017: 65-74 - 2016
- [c13]Tobias Philipp:
Unsatisfiability Proofs for Parallel SAT Solver Portfolios with Clause Sharing and Inprocessing. GCAI 2016: 24-38 - [c12]Tobias Philipp, Adrian Rebola-Pardo:
DRAT Proofs for XOR Reasoning. JELIA 2016: 415-429 - [c11]Tobias Philipp, Anna Tigunova:
A Verified Decision Procedure for Pseudo-Boolean Formulas. PlanSIG 2016 - 2015
- [c10]Tobias Philipp:
An Expressive Model for Instance Decomposition Based Parallel SAT Solvers. FroCos 2015: 101-116 - [c9]Tobias Philipp, Peter Steinke:
PBLib - A Library for Encoding Pseudo-Boolean Constraints into CNF. SAT 2015: 9-16 - 2014
- [c8]Norbert Manthey, Tobias Philipp:
Formula Simplifications as DRAT Derivations. KI 2014: 111-122 - [c7]Norbert Manthey, Tobias Philipp, Peter Steinke:
A More Compact Translation of Pseudo-Boolean Constraints into CNF Such That Generalized Arc Consistency Is Maintained. KI 2014: 123-134 - [c6]Marijn Heule, Norbert Manthey, Tobias Philipp:
Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers. POS@SAT 2014: 12-25 - [c5]Steffen Hölldobler, Norbert Manthey, Tobias Philipp, Peter Steinke:
Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers. POS@SAT 2014: 89-102 - [c4]Tobias Philipp:
Clause Simplifications in Search-Space Decomposition-Based Sat Solvers. STAIRS 2014: 211-219 - [c3]Steffen Hölldobler, Norbert Manthey, Tobias Philipp, Peter Steinke:
Generic CDCL - A Formalization of Modern Propositional Satisfiability Solvers. YSIP 2014: 25-34 - 2013
- [c2]Norbert Manthey, Tobias Philipp, Christoph Wernhard:
Soundness of Inprocessing in Clause Sharing SAT Solvers. SAT 2013: 22-39 - 2012
- [j1]Domenico Martino, Tobias Philipp:
Plattformen für mobile Geschäftsanwendungen - am Beispiel der Sybase Unwired Platform. HMD Prax. Wirtsch. 286: 32-42 (2012) - 2011
- [c1]Steffen Hölldobler, Tobias Philipp, Christoph Wernhard:
An Abductive Model for Human Reasoning. AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning 2011
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
