Decidable matching for convergent systems

Nachum Dershowitz; Subrata Mitra; G. Sivakumar

doi:10.1007/3-540-55602-8_194

Decidable matching for convergent systems

Nachum Dershowitz, Subrata Mitra, G. Sivakumar

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

15 Scopus citations

Abstract

We provide a simple system, based on transformation rules, which is complete for certain classes of semantic matching problems, where the equational theory with respect to which the semantic matching is performed has a convergent rewrite system. We also use this transformation system to describe decision procedures for semantic matching problems. We give counterexamples to show that semantic matching becomes undecidable (as it generally is) when the conditions we give are weakened. Our main result pertains to convergent systems with variable preserving rules, with some particular patterns of defined functions on the right hand sides.

Original language	English
Title of host publication	Automated Deduction — CADE-11 - 11 th International Conference on Automated Deduction, Proceedings
Editors	Deepak Kapur
Publisher	Springer Verlag
Pages	589-602
Number of pages	14
ISBN (Print)	9783540556022
DOIs	https://doi.org/10.1007/3-540-55602-8_194
State	Published - 1992
Externally published	Yes
Event	11th International Conference on Automated Deduction, CADE, 1992 - Saratoga Springs, United States Duration: 15 Jun 1992 → 18 Jun 1992

Publication series

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

Conference

Conference	11th International Conference on Automated Deduction, CADE, 1992
Country/Territory	United States
City	Saratoga Springs
Period	15/06/92 → 18/06/92

Funding

Funders	Funder number
U. S. National Science Foundation	CGR-90-07195, CCR-90-24271

Access to Document

10.1007/3-540-55602-8_194

Cite this

Dershowitz, N., Mitra, S., & Sivakumar, G. (1992). Decidable matching for convergent systems. In D. Kapur (Ed.), Automated Deduction — CADE-11 - 11 th International Conference on Automated Deduction, Proceedings (pp. 589-602). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 607 LNAI). Springer Verlag. https://doi.org/10.1007/3-540-55602-8_194

Dershowitz, Nachum ; Mitra, Subrata ; Sivakumar, G. / Decidable matching for convergent systems. Automated Deduction — CADE-11 - 11 th International Conference on Automated Deduction, Proceedings. editor / Deepak Kapur. Springer Verlag, 1992. pp. 589-602 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{1bb672354c3b492eb28f008a86bbd974,

title = "Decidable matching for convergent systems",

abstract = "We provide a simple system, based on transformation rules, which is complete for certain classes of semantic matching problems, where the equational theory with respect to which the semantic matching is performed has a convergent rewrite system. We also use this transformation system to describe decision procedures for semantic matching problems. We give counterexamples to show that semantic matching becomes undecidable (as it generally is) when the conditions we give are weakened. Our main result pertains to convergent systems with variable preserving rules, with some particular patterns of defined functions on the right hand sides.",

author = "Nachum Dershowitz and Subrata Mitra and G. Sivakumar",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1994.; 11th International Conference on Automated Deduction, CADE, 1992 ; Conference date: 15-06-1992 Through 18-06-1992",

year = "1992",

doi = "10.1007/3-540-55602-8_194",

language = "אנגלית",

isbn = "9783540556022",

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

publisher = "Springer Verlag",

pages = "589--602",

editor = "Deepak Kapur",

booktitle = "Automated Deduction — CADE-11 - 11 th International Conference on Automated Deduction, Proceedings",

address = "גרמניה",

}

Dershowitz, N, Mitra, S & Sivakumar, G 1992, Decidable matching for convergent systems. in D Kapur (ed.), Automated Deduction — CADE-11 - 11 th International Conference on Automated Deduction, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 607 LNAI, Springer Verlag, pp. 589-602, 11th International Conference on Automated Deduction, CADE, 1992, Saratoga Springs, United States, 15/06/92. https://doi.org/10.1007/3-540-55602-8_194

Decidable matching for convergent systems. / Dershowitz, Nachum; Mitra, Subrata; Sivakumar, G.
Automated Deduction — CADE-11 - 11 th International Conference on Automated Deduction, Proceedings. ed. / Deepak Kapur. Springer Verlag, 1992. p. 589-602 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 607 LNAI).

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

TY - GEN

T1 - Decidable matching for convergent systems

AU - Dershowitz, Nachum

AU - Mitra, Subrata

AU - Sivakumar, G.

PY - 1992

Y1 - 1992

N2 - We provide a simple system, based on transformation rules, which is complete for certain classes of semantic matching problems, where the equational theory with respect to which the semantic matching is performed has a convergent rewrite system. We also use this transformation system to describe decision procedures for semantic matching problems. We give counterexamples to show that semantic matching becomes undecidable (as it generally is) when the conditions we give are weakened. Our main result pertains to convergent systems with variable preserving rules, with some particular patterns of defined functions on the right hand sides.

AB - We provide a simple system, based on transformation rules, which is complete for certain classes of semantic matching problems, where the equational theory with respect to which the semantic matching is performed has a convergent rewrite system. We also use this transformation system to describe decision procedures for semantic matching problems. We give counterexamples to show that semantic matching becomes undecidable (as it generally is) when the conditions we give are weakened. Our main result pertains to convergent systems with variable preserving rules, with some particular patterns of defined functions on the right hand sides.

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

U2 - 10.1007/3-540-55602-8_194

DO - 10.1007/3-540-55602-8_194

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

AN - SCOPUS:84858564688

SN - 9783540556022

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

SP - 589

EP - 602

BT - Automated Deduction — CADE-11 - 11 th International Conference on Automated Deduction, Proceedings

A2 - Kapur, Deepak

PB - Springer Verlag

T2 - 11th International Conference on Automated Deduction, CADE, 1992

Y2 - 15 June 1992 through 18 June 1992

ER -

Dershowitz N, Mitra S, Sivakumar G. Decidable matching for convergent systems. In Kapur D, editor, Automated Deduction — CADE-11 - 11 th International Conference on Automated Deduction, Proceedings. Springer Verlag. 1992. p. 589-602. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-55602-8_194

Decidable matching for convergent systems

Abstract

Publication series

Conference

Funding

Access to Document

Other files and links

Fingerprint

Cite this