Charles Jordan: Publications
-
lrsarith: a small fixed/hybrid arithmetic C library.
[pdf]
David Avis and Charles Jordan.
arXiv:2101.12425, 2021.
-
mts: a light framework for parallelizing tree search codes.
[pdf]
arXiv:1709.07605
David Avis and Charles Jordan.
Optimization Methods and Software 36(2-3):279-300, 2021.
(special issue in memory of M. Iri)
This complements the earlier tutorial
(arXiv:1610:07735);
see the tutorial for changes in source code needed to use mts.
-
Parallel Enumeration of Triangulations.
[pdf]
arXiv:1709.04746
Charles Jordan, Michael Joswig and Lars Kastner.
Electronic Journal of Combinatorics 25(3), #P3.6, 2018.
-
mplrs: A scalable parallel vertex/facet enumeration code.
[pdf]
arXiv:1511.06487
David Avis and
Charles Jordan.
Mathematical Programming Computation 10(2):267–302, 2018.
-
The Kahr-Moore-Wang Class Contains Untestable Properties.
[pdf]
Charles Jordan and Thomas Zeugmann.
Baltic Journal of Modern Computing 4(4):736–752, 2016.
(special issue in memory of R. Freivalds)
-
Machine Learning with Guarantees using Descriptive Complexity
and SMT Solvers. [pdf]
Charles Jordan and Łukasz Kaiser.
arXiv:1609.02664, 2016.
-
QBF Gallery 2014: The QBF Competition at the FLoC 2014 Olympic Games.
[pdf]
Mikoláš Janota,
Charles Jordan,
Will Klieber,
Florian Lonsing,
Martina Seidl and
Allen Van Gelder.
Journal on Satisfiability, Boolean Modeling and Computation
9:187–206, 2016.
-
Non-CNF QBF Solving with QCIR.
[pdf]
Charles Jordan,
Will Klieber
and Martina Seidl.
In
AAAI Technical Report WS-16-05,
The Workshops of the Thirtieth AAAI Conference on Artificial
Intelligence,
pp. 320–326, 2016.
-
Comparative computational results for some vertex and facet enumeration
codes.
[pdf]
David Avis and
Charles Jordan.
arXiv:1510.02545, 2015.
Updated v3 in June 2016 to include additional comparisons and a
newer version of mplrs with improved performance.
-
MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing.
[pdf]
Charles Jordan,
Lukasz Kaiser,
Florian Lonsing and
Martina Seidl.
In
Theory and Applications of Satisfiability Testing - SAT 2014,
17th International Conference,
Held as Part of the Vienna Summer of Logic, VSL 2014,
Vienna, Austria,
July 14-17, 2014, Proceedings,
Lecture Notes in Computer Science 8561,
pp. 430–437, 2014.
-
Experiments with Reduction Finding.
[pdf]
Charles Jordan and Łukasz Kaiser. In
Theory and Applications of Satisfiability Testing,
16th International Conference, SAT 2013, Helsinki, Finland,
July 2013, Proceedings,
Lecture Notes in Computer Science 7962, pp. 192–207,
2013.
- Benchmarks from Reduction Finding.
[pdf]
Charles Jordan and Łukasz Kaiser. In
International Workshop on Quantified Boolean Formulas 2013,
Informal
Workshop Report,
pp. 40–43, 2013.
- Learning Programs as Logical Queries.
[pdf]
Charles Jordan and Łukasz Kaiser. In
ICALP 2013 Satellite Workshop on Learning Theory and Complexity
(LTC), 2013.
-
Testable and Untestable Classes of First-Order Formulae.
[pdf]
Charles Jordan and Thomas Zeugmann.
Journal of Computer and System Sciences 78(5):1557–1578,
2012.
-
Experimental Descriptive Complexity.
[pdf]
Marco Carmosino,
Neil Immerman and
Charles Jordan. In
Logic and Program Semantics, Essays Dedicated to Dexter Kozen on the
Occasion of His 60th Birthday,
Lecture Notes in Computer Science 7230, pp. 24–34,
2012.
-
Untestable Properties in the Kahr-Moore-Wang Class.
[pdf]
Charles Jordan and Thomas Zeugmann. In
Logic, Language, Information and Computation, 18th International
Workshop, WoLLIC 2011, Philadelphia, PA, USA, May 2011, Proceedings,
Lecture Notes in Artificial Intelligence 6642, pp. 176–186,
2011.
-
A Note on the Testability of Ramsey's Class.
[pdf]
Charles Jordan and Thomas Zeugmann. In
Theory and Applications of Models of Computation,
7th International Conference, TAMC 2010, Prague, Czech Republic,
June 2010, Proceedings,
Lecture Notes in Computer Science 6108, pp. 296–307,
2010.
-
Untestable Properties Expressible with Four First-Order Quantifiers.
[pdf]
Charles Jordan and Thomas Zeugmann. In
Language and Automata Theory and Applications, 4th International
Conference, LATA 2010, Trier, Germany, May 2010, Proceedings,
Lecture Notes in Computer Science 6031, pp. 333–343,
2010.
This is a conference version (improved but shorter) of the following
technical report.
-
Contributions to the Classification for Testability: Four Universal
and One Existential Quantifier.
[pdf]
Charles Jordan and Thomas Zeugmann.
Technical Report TCS-TR-A-09-39, Hokkaido University,
Division of Computer Science, November 2009.
- Relational
Properties Expressible with One Universal Quantifier Are
Testable. [pdf]
Charles Jordan and Thomas Zeugmann. In
Stochastic Algorithms: Foundations and Applications,
5th International Symposium, SAGA 2009, Sapporo, Japan, October 2009,
Proceedings,
Lecture Notes in Computer Science 5792, pp. 141–155,
2009.
-
Indistinguishability and First-Order Logic.
[pdf]
Skip Jordan and Thomas Zeugmann. In
Theory and Applications of Models of Computation,
5th International Conference, TAMC 2008, Xi'an, China, April 2008,
Proceedings,
Lecture Notes in Computer Science 4978, pp. 94–104,
2008.
Other (selected)
