Skip Jordan (= Charles Jordan)
Laboratory for Algorithmics
Graduate School of Information Science and Technology
Hokkaido University
North-14, West-9
Sapporo, 060-0814
JAPAN
Research
I am interested in logic in computer science, especially
applications related to descriptive complexity.
I'm also interested in parallel solvers for SAT and QBF,
complexity theory, and related topics.
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.
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.
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.
Software
mplrs:
MPI wrapper to use lrs in parallel on
distributed systems. See the
lrs home page
or MPC paper for
details.
mts: David Avis and I are developing a generic MPI wrapper for
parallelizing reverse search and more. See the
tutorial
for details and a pre-release version. Used in mptopcom.
mptopcom: parallel
enumeration of triangulations, joint work with Michael Joswig and Lars
Kastner. See the
mptopcom home page or
paper for details.
de: descriptive programming environment
described
here and also used
here.
Experimental Descriptive Complexity.
Charles Jordan (joint work with
Marco Carmosino and
Neil Immerman).
Talk at
Finite and Algorithmic Model Theory (FMT 2012), Les Houches, May 2012.
Slides are available here or via the
FMT
program.