Well-Founded Unions

Jeremy Dawson; Nachum Dershowitz; Rajeev Goré

doi:10.1007/978-3-319-94205-6_9

Well-Founded Unions

Jeremy Dawson, Nachum Dershowitz^*, Rajeev Goré

^*Corresponding author for this work

School of Computer Science

Australian National University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Given two or more well-founded (terminating) binary relations, when can one be sure that their union is likewise well-founded? We suggest new conditions for an arbitrary number of relations, generalising known conditions for two relations. We also provide counterexamples to several potential weakenings. All proofs have been machine checked.

Original language	English
Title of host publication	Automated Reasoning - 9th International Joint Conference, IJCAR 2018, Held as Part of the Federated Logic Conference, FloC 2018, Proceedings
Editors	Roberto Sebastiani, Didier Galmiche, Stephan Schulz
Publisher	Springer Verlag
Pages	117-133
Number of pages	17
ISBN (Print)	9783319942049
DOIs	https://doi.org/10.1007/978-3-319-94205-6_9
State	Published - 2018
Event	9th International Joint Conference on Automated Reasoning, IJCAR 2018 Held as Part of the Federated Logic Conference, FloC 2018 - Oxford, United Kingdom Duration: 14 Jul 2018 → 17 Jul 2018

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	10900 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	9th International Joint Conference on Automated Reasoning, IJCAR 2018 Held as Part of the Federated Logic Conference, FloC 2018
Country/Territory	United Kingdom
City	Oxford
Period	14/07/18 → 17/07/18

Funding

Funders	Funder number
Australian Research Council	DP140101540

Access to Document

10.1007/978-3-319-94205-6_9

Cite this

Dawson, J., Dershowitz, N., & Goré, R. (2018). Well-Founded Unions. In R. Sebastiani, D. Galmiche, & S. Schulz (Eds.), Automated Reasoning - 9th International Joint Conference, IJCAR 2018, Held as Part of the Federated Logic Conference, FloC 2018, Proceedings (pp. 117-133). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10900 LNAI). Springer Verlag. https://doi.org/10.1007/978-3-319-94205-6_9

Dawson, Jeremy ; Dershowitz, Nachum ; Goré, Rajeev. / Well-Founded Unions. Automated Reasoning - 9th International Joint Conference, IJCAR 2018, Held as Part of the Federated Logic Conference, FloC 2018, Proceedings. editor / Roberto Sebastiani ; Didier Galmiche ; Stephan Schulz. Springer Verlag, 2018. pp. 117-133 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{f0be6015cef94409a8127137a36aff83,

title = "Well-Founded Unions",

abstract = "Given two or more well-founded (terminating) binary relations, when can one be sure that their union is likewise well-founded? We suggest new conditions for an arbitrary number of relations, generalising known conditions for two relations. We also provide counterexamples to several potential weakenings. All proofs have been machine checked.",

author = "Jeremy Dawson and Nachum Dershowitz and Rajeev Gor{\'e}",

note = "Publisher Copyright: {\textcopyright} 2018, Springer International Publishing AG, part of Springer Nature.; 9th International Joint Conference on Automated Reasoning, IJCAR 2018 Held as Part of the Federated Logic Conference, FloC 2018 ; Conference date: 14-07-2018 Through 17-07-2018",

year = "2018",

doi = "10.1007/978-3-319-94205-6_9",

language = "אנגלית",

isbn = "9783319942049",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "117--133",

editor = "Roberto Sebastiani and Didier Galmiche and Stephan Schulz",

booktitle = "Automated Reasoning - 9th International Joint Conference, IJCAR 2018, Held as Part of the Federated Logic Conference, FloC 2018, Proceedings",

}

Dawson, J, Dershowitz, N & Goré, R 2018, Well-Founded Unions. in R Sebastiani, D Galmiche & S Schulz (eds), Automated Reasoning - 9th International Joint Conference, IJCAR 2018, Held as Part of the Federated Logic Conference, FloC 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10900 LNAI, Springer Verlag, pp. 117-133, 9th International Joint Conference on Automated Reasoning, IJCAR 2018 Held as Part of the Federated Logic Conference, FloC 2018, Oxford, United Kingdom, 14/07/18. https://doi.org/10.1007/978-3-319-94205-6_9

Well-Founded Unions. / Dawson, Jeremy; Dershowitz, Nachum; Goré, Rajeev.
Automated Reasoning - 9th International Joint Conference, IJCAR 2018, Held as Part of the Federated Logic Conference, FloC 2018, Proceedings. ed. / Roberto Sebastiani; Didier Galmiche; Stephan Schulz. Springer Verlag, 2018. p. 117-133 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10900 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Well-Founded Unions

AU - Dawson, Jeremy

AU - Dershowitz, Nachum

AU - Goré, Rajeev

PY - 2018

Y1 - 2018

N2 - Given two or more well-founded (terminating) binary relations, when can one be sure that their union is likewise well-founded? We suggest new conditions for an arbitrary number of relations, generalising known conditions for two relations. We also provide counterexamples to several potential weakenings. All proofs have been machine checked.

AB - Given two or more well-founded (terminating) binary relations, when can one be sure that their union is likewise well-founded? We suggest new conditions for an arbitrary number of relations, generalising known conditions for two relations. We also provide counterexamples to several potential weakenings. All proofs have been machine checked.

UR - http://www.scopus.com/inward/record.url?scp=85049937516&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-94205-6_9

DO - 10.1007/978-3-319-94205-6_9

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85049937516

SN - 9783319942049

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 117

EP - 133

BT - Automated Reasoning - 9th International Joint Conference, IJCAR 2018, Held as Part of the Federated Logic Conference, FloC 2018, Proceedings

A2 - Sebastiani, Roberto

A2 - Galmiche, Didier

A2 - Schulz, Stephan

PB - Springer Verlag

T2 - 9th International Joint Conference on Automated Reasoning, IJCAR 2018 Held as Part of the Federated Logic Conference, FloC 2018

Y2 - 14 July 2018 through 17 July 2018

ER -

Dawson J, Dershowitz N, Goré R. Well-Founded Unions. In Sebastiani R, Galmiche D, Schulz S, editors, Automated Reasoning - 9th International Joint Conference, IJCAR 2018, Held as Part of the Federated Logic Conference, FloC 2018, Proceedings. Springer Verlag. 2018. p. 117-133. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-94205-6_9

Well-Founded Unions

Abstract

Publication series

Conference

Funding

Access to Document

Other files and links

Fingerprint

Cite this