About
de is a "Descriptive Environment" that allows one to interact with
(finite) relational structures and logical queries in various ways.
It is free software released under the ISC license.
Downloads
Status
- New release (January 2023): improved QBF functionality, additional cleanup.
Publications
-
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.
This paper introduces de, describing its basic functionality.
-
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.
This paper describes the automatic reduction-finding implemented in de.
Acknowledgements
Supported in part by JSPS grants 18K18027, 23K11043, 25106501 and 2100195209.
