Martin Suda 0001
19 publications
7 venues
H Index 8
Affiliation
Czech Technical University in Prague, Czech RepublicFiluta AI, Inc., New York, NY, USA
TU Wien, Vienna, Austria
University of Manchester, UK
Max Planck Institute for Informatics, Saarbr cken, Germany
Links
| Name | Venue | Year | citations |
|---|---|---|---|
Planning Domain Model Acquisition from State Traces without Action Parameters.
|
KR | 2024 | 0 |
| How Much Should This Symbol Weigh? A GNN-Advised Clause Selection.
|
LPAR | 2023 | 0 |
| Neural Precedence Recommender.
|
CADE | 2021 | 1 |
| SAT Competition 2020.
|
Artificial Intelligence | 2021 | 22 |
| Improving ENIGMA-style Clause Selection while Learning From History.
|
CADE | 2021 | 6 |
| ENIGMA-NG: Efficient Neural and Gradient-Boosted Inference Guidance for E.
|
CADE | 2019 | 52 |
| A Theory of Satisfiability-Preserving Proofs in SAT Solving.
|
LPAR | 2018 | 4 |
| Towards Smarter MACE-style Model Finders.
|
LPAR | 2018 | 3 |
| Local Soundness for QBF Calculi.
|
SAT | 2018 | 5 |
| Splitting Proofs for Interpolation.
|
CADE | 2017 | 2 |
| Blocked Clauses in First-Order Logic.
|
LPAR | 2017 | 12 |
| A Unifying Principle for Clause Elimination in First-Order Logic.
|
CADE | 2017 | 7 |
| Lifting QBF Resolution Calculi to DQBF.
|
SAT | 2016 | 18 |
| Finding Finite Models in Multi-sorted First-Order Logic.
|
SAT | 2016 | 0 |
| Playing with AVATAR.
|
CADE | 2015 | 44 |
| Property Directed Reachability for Automated Planning.
|
ICAPS | 2014 | 28 |
| Property Directed Reachability for Automated Planning.
|
JAIR | 2014 | 0 |
| Labelled Superposition for PLTL.
|
LPAR | 2012 | 11 |
| SPASS Version 3.5.
|
CADE | 2009 | 284 |