Shuffle on trajectories: syntactic constraints
Theoretical Computer Science
Shuffle factorization is unique
Theoretical Computer Science
A prolog toolkit for formal languages and automata
ITiCSE '05 Proceedings of the 10th annual SIGCSE conference on Innovation and technology in computer science education
On the uniqueness of shuffle on words and finite languages
Theoretical Computer Science
Kodkod: a relational model finder
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Nitpick: a counterexample generator for higher-order logic based on a relational model finder
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
| Hi-index | 0.00 |
While proving a theorem from a set of axioms is undecidable in first order logic, recent development has produced several tools which serve as automated theorem provers. However, often these systems are too complex for a given problem. Their usefulness is outweighed by the difficulty of learning a new tool or translating results into computer-readable form. I describe tools developed in Prolog to partially characterize the shuffle-inclusion problem. These tools allowed for rapid development of proofs with little intellectual overhead. While focused around a specific problem, the techniques described are general, and well suited to many problems on discrete structures.