Abstract
We present a term rewriting system to solve a class of open problems that are generalisations of Kuratowski's closure-complement theorem. The problems are concerned with finding the number of distinct sets that can be obtained by applying combinations of axiomatically defined set operators. While the original problem considers only closure and complement of a topological space as operators, it can be generalised by adding operators and varying axiomatisation. We model these axioms as rewrite rules and construct a rewriting system that allows us to close some so far open variants of Kuratowski's problem by analysing several million inference steps on a typical personal computer.
| Original language | English |
|---|---|
| Title of host publication | 23rd International Conference on Rewriting Techniques and Applications |
| Subtitle of host publication | (RTA 2012) |
| Editors | Ashish Tiwari |
| Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
| Pages | 38-52 |
| Number of pages | 15 |
| ISBN (Print) | 9783939897385 |
| DOIs | |
| Publication status | Published - 29 May 2012 |
| Externally published | Yes |
| Event | 23rd International Conference on Rewriting Techniques and Applications - Nagoya University, Nagoya, Japan Duration: 28 May 2012 → 2 Jun 2012 Conference number: 23 https://rta2012.trs.cm.is.nagoya-u.ac.jp/ |
Publication series
| Name | Leibniz International Proceedings in Informatics, LIPIcs |
|---|---|
| Volume | 15 |
| ISSN (Print) | 1868-8969 |
Conference
| Conference | 23rd International Conference on Rewriting Techniques and Applications |
|---|---|
| Abbreviated title | RTA 2012 |
| Country/Territory | Japan |
| City | Nagoya |
| Period | 28/05/12 → 2/06/12 |
| Internet address |