Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Clymo, Judith
6  Ergebnisse:
Personensuche X
?
1

How QBF Expansion Makes Strategy Extraction Hard:

, In: Automated Reasoning; Lecture Notes in Computer Science,
Chew, Leroy ; Clymo, Judith - p. 66-82 , 2020
Link: https://doi.org/10.1007/..
 
?
2

The Equivalences of Refutational QRAT:

, In: Lecture Notes in Computer Science; Theory and Applications of Satisfiability Testing – SAT 2019,
Chew, Leroy ; Clymo, Judith - p. 100-116 , 2019
Link: https://doi.org/10.1007/..
 
?
3

Short Proofs in QBF Expansion:

, In: Lecture Notes in Computer Science; Theory and Applications of Satisfiability Testing – SAT 2019,
Beyersdorff, Olaf ; Chew, Leroy ; Clymo, Judith. - p. 19-35 , 2019
Link: https://doi.org/10.1007/..
 
?
4

Relating size and width in variants of Q-resolution:

Clymo, Judith ; Beyersdorff, Olaf
Information Processing Letters.  138 (2018)  - p. 1-6 , 2018
Link: https://doi.org/10.1016/..
 
?
5

Data Generation for Neural Programming by Example:

Clymo, Judith ; Manukian, Haik ; Fijalkow, Nathanaël..
http://arxiv.org/abs/1911.02624.  , 2019
Link: http://arxiv.org/abs/191..
 
?
6

Proof Complexity for Quantified Boolean Formulas:

Clymo, Judith Caroline
https://etheses.whiterose.ac.uk/28805/1/Clymo%20thesis.pdf.  , 2020
Link: https://etheses.whiteros..
 
1-6