Florian Pollitt

Orcid: 0009-0001-4337-6919

According to our database1, Florian Pollitt authored at least 15 papers between 2022 and 2025.

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

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Kissat Clause Reduction Version.
Dataset, August, 2025


Clausal Equivalence Checking Miters and SAT Competition Artifact.
Dataset, April, 2025

Clausal Equivalence Checking Miters and SAT Competition Artifact.
Dataset, April, 2025

CaDiCaL 2.2 System Description Artifact.
Dataset, February, 2025

CaDiCaL 2.2 System Description Artifact.
Dataset, February, 2025

CaDiCaL 2.2 System Description Artifact.
Dataset, February, 2025

Learn to Unlearn.
Proceedings of the 28th International Conference on Theory and Applications of Satisfiability Testing, 2025

Revisiting Clause Vivification.
Proceedings of the Joint Proceedings of the 23rd International Workshop on Satisfiability Modulo Theories and the 16th Pragmatics of SAT International Workshop co-located with the 31st International Conference on Principles and Practice of Constraint Programming, 2025

Incremental Inprocessing Rules beyond Resolution.
Proceedings of the Joint Proceedings of the 23rd International Workshop on Satisfiability Modulo Theories and the 16th Pragmatics of SAT International Workshop co-located with the 31st International Conference on Principles and Practice of Constraint Programming, 2025

2024
CaDiCaL 2.0 CAV'24 Tool-Paper Artifact.
Dataset, April, 2024

Certifying Incremental SAT Solving.
Proceedings of the LPAR 2024: Proceedings of 25th Conference on Logic for Programming, 2024

CaDiCaL 2.0.
Proceedings of the Computer Aided Verification - 36th International Conference, 2024

2023
Faster LRAT Checking Than Solving with CaDiCaL.
Proceedings of the 26th International Conference on Theory and Applications of Satisfiability Testing, 2023

2022
Making Translations to Classical Planning Competitive with Other HTN Planners.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022


  Loading...