A Term Rewriting System for Kuratowski’s Closure-Complement Problem

Osama Al-Hassani, Quratul Ain Mahesar, Claudio Sacerdoti Coen, Volker Sorge

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Citations (Scopus)

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 languageEnglish
Title of host publication23rd International Conference on Rewriting Techniques and Applications
Subtitle of host publication(RTA 2012)
EditorsAshish Tiwari
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages38-52
Number of pages15
ISBN (Print)9783939897385
DOIs
Publication statusPublished - 29 May 2012
Externally publishedYes
Event23rd International Conference on Rewriting Techniques and Applications - Nagoya University, Nagoya, Japan
Duration: 28 May 20122 Jun 2012
Conference number: 23
https://rta2012.trs.cm.is.nagoya-u.ac.jp/

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume15
ISSN (Print)1868-8969

Conference

Conference23rd International Conference on Rewriting Techniques and Applications
Abbreviated titleRTA 2012
CountryJapan
CityNagoya
Period28/05/122/06/12
Internet address

Fingerprint

Dive into the research topics of 'A Term Rewriting System for Kuratowski’s Closure-Complement Problem'. Together they form a unique fingerprint.

Cite this