Skip to Main content Skip to Navigation
Conference papers

No complete linear term rewriting system for propositional logic

Anupam Das 1 Lutz Strassburger 1 
1 PARSIFAL - Proof search and reasoning with logic specifications
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
Abstract : Recently it has been observed that the set of all sound linear inference rules in propositional logic is already coNP-complete, i.e. that every Boolean tautology can be written as a (left-and right-) linear rewrite rule. This raises the question of whether there is a rewriting system on linear terms of propositional logic that is sound and complete for the set of all such rewrite rules. We show in this paper that, as long as reduction steps are polynomial-time decidable, such a rewriting system does not exist unless coNP = NP. We draw tools and concepts from term rewriting, Boolean function theory and graph theory in order to access the required intermediate results. At the same time we make several connections between these areas that, to our knowledge, have not yet been presented and constitute a rich theoretical framework for reasoning about linear TRSs for propositional logic. 1998 ACM Subject Classification F.4 Mathematical Logic and Formal Languages
Document type :
Conference papers
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Lutz Straßburger Connect in order to contact the contributor
Submitted on : Wednesday, December 2, 2015 - 1:59:48 PM
Last modification on : Thursday, January 20, 2022 - 5:27:40 PM
Long-term archiving on: : Saturday, April 29, 2017 - 12:20:04 AM


Publisher files allowed on an open archive



Anupam Das, Lutz Strassburger. No complete linear term rewriting system for propositional logic. 26th International Conference on Rewriting Techniques and Applications (RTA 2015), Jun 2015, Warsaw, Poland. ⟨10.4230/LIPIcs.RTA.2015.127⟩. ⟨hal-01236948⟩



Record views


Files downloads