On lazy commutation

Nachum Dershowitz*

*Corresponding author for this work

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

Abstract

We investigate combinatorial commutation properties for reordering a sequence of two kinds of steps, and for separating well-foundedness of unions of relations. To that end, we develop the notion of a constricting sequence. These results can be applied, for example, to generic path orderings used in termination proofs.

Original languageEnglish
Title of host publicationLanguages
Subtitle of host publicationFrom Formal to Natural - Essays Dedicated to Nissim Francez on the Occasion of His 65th Birthday
Pages59-82
Number of pages24
DOIs
StatePublished - 2009
EventSymposium on Languages: From Formal to Natural. Dedicated to Nissim Francez on the Occasion of His 65th Birthday - Haifa, Israel
Duration: 24 May 200925 May 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5533 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceSymposium on Languages: From Formal to Natural. Dedicated to Nissim Francez on the Occasion of His 65th Birthday
Country/TerritoryIsrael
CityHaifa
Period24/05/0925/05/09

Fingerprint

Dive into the research topics of 'On lazy commutation'. Together they form a unique fingerprint.

Cite this