[PDF][PDF] Mathematics of sudoku I

B Felgenhauer, F Jarvis - Mathematical Spectrum, 2006 - Citeseer
Sudoku puzzles became extremely popular in Britain from late 2004. Sudoku, or Su Doku, is
a Japanese word (or phrase) meaning something like Number Place. The idea of the puzzle …

[PDF][PDF] Enumerating possible Sudoku grids

B Felgenhauer, F Jarvis - Preprint available at http://www. afjarvis …, 2005 - afjarvis.org.uk
Sudoku puzzles became extremely popular in Britain from late-2004. Sudoku, or Su Doku,
is a Japanese word (or phrase) meaning something like Number Place. The idea of the …

CSI–A confluence tool

H Zankl, B Felgenhauer, A Middeldorp - … , Poland, July 31-August 5, 2011 …, 2011 - Springer
This paper describes a new confluence tool for term rewrite systems. Due to its modular design,
the few techniques implemented so far can be combined flexibly. Methods developed for …

Proof orders for decreasing diagrams

B Felgenhauer, V van Oostrom - 24th International Conference …, 2013 - drops.dagstuhl.de
We present and compare some well-founded proof orders for decreasing diagrams. These
proof orders order a conversion above another conversion if the latter is obtained by filling …

CSI: New evidence–a progress report

J Nagele, B Felgenhauer, A Middeldorp - International Conference on …, 2017 - Springer
CSI is a strong automated confluence prover for rewrite systems which has been in development
since 2010. In this paper we report on recent extensions that make CSI more powerful, …

Labelings for decreasing diagrams

H Zankl, B Felgenhauer, A Middeldorp - Journal of Automated Reasoning, 2015 - Springer
This article is concerned with automating the decreasing diagrams technique of van Oostrom
for establishing confluence of term rewrite systems. We study abstract criteria that allow to …

Layer systems for proving confluence

B Felgenhauer, A Middeldorp, H Zankl… - ACM Transactions on …, 2015 - dl.acm.org
We introduce layer systems for proving generalizations of the modularity of confluence for
first-order rewrite systems. Layer systems specify how terms can be divided into layers. We …

[PDF][PDF] Confluence of Term Rewriting: Theory and Automation

B Felgenhauer - 2015 - cl-informatik.uibk.ac.at
The topic of this thesis is confluence of first-order term rewriting systems, both its theory and
its automation. Term rewrite systems are a model of computation in which terms are …

Deciding confluence of ground term rewrite systems in cubic time

B Felgenhauer - … on Rewriting Techniques and Applications (RTA …, 2012 - drops.dagstuhl.de
It is well known that the confluence property of ground term rewrite systems (ground TRSs) is
decidable in polynomial time. For an efficient implementation, the degree of this polynomial …

Reachability analysis with state-compatible automata

B Felgenhauer, R Thiemann - … on Language and Automata Theory and …, 2014 - Springer
Regular tree languages are a popular device for reachability analysis over term rewrite
systems, with many applications like analysis of cryptographic protocols, or confluence and …