Combining Pattern E-Unification Algorithms

We present an algorithm for unification of higher-order patterns modulo combinations of disjoint first-order equational theories. This algorithm is highly non-deterministic, in the spirit of those by Schmidt-Schauβ [20] and Baader-Schulz [1] in the first-order case. We redefine the properties requir...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Boudet, Alexandre, Contejean, Evelyne
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Applied sciences Computer science control theory systems Equational Theory Exact sciences and technology Free Theory Free Variable Language theory and syntactical analysis Logic and foundations Mathematical logic, foundations, set theory Mathematics Nondeterministic Choice Proof theory and constructive mathematics Sciences and techniques of general use Theoretical computing Unification Algorithm
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	76
container_issue
container_start_page	63
container_title
container_volume	2051
creator	Boudet, Alexandre Contejean, Evelyne
description	We present an algorithm for unification of higher-order patterns modulo combinations of disjoint first-order equational theories. This algorithm is highly non-deterministic, in the spirit of those by Schmidt-Schauβ [20] and Baader-Schulz [1] in the first-order case. We redefine the properties required for elementary pattern unification algorithms of pure problems in this context, then we show that some theories of interest have elementary unification algorithms fitting our requirements. This provides a unification algorithm for patterns modulo the combination of theories such as the free theory, commutativity, one-sided distributivity, associativity-commutativity and some of its extensions, including Abelian groups.
doi_str_mv	10.1007/3-540-45127-7_7
format	Book Chapter
fullrecord	<record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_1015024</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3072507_13_73</sourcerecordid><originalsourceid>FETCH-LOGICAL-p1807-403c402d994ae14f4227accefc7702e99e0795d5332ac80f182dd8b45642d0123</originalsourceid><addsrcrecordid>eNotUDtPwzAQNk8RSmfWDkxIhrPPruOxqspDqgQDnS3XcdpA6gQ7DPx7TNu74XT3PaT7CLll8MAA1CNSKYAKybiiyqgTco35sN_VKSnYlDGKKPQZGWtV7jHOmFLnpAAETrUSeEkK5FMpucLyioxT-oRc-YRCFuR-3u3WTWjCZvJuh8HHMFnQVWjqxtmh6cJk1m662AzbXbohF7Vtkx8f54isnhYf8xe6fHt-nc-WtGclKCoAnQBeaS2sZ6IWnCvrnK-dUsC91h6UlpVE5NaVULOSV1W5FnIqeAWM44jcHXx7m5xt62iDa5LpY7Oz8dcwYBK4yDR6oKWMhI2PZt11Xynj5j87gybHYfZZmdyZz4-2sfv-8Wkw_l_gfBiibd3W9vn7ZBAUl1nOMGvwD3FtaVM</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3072507_13_73</pqid></control><display><type>book_chapter</type><title>Combining Pattern E-Unification Algorithms</title><source>Springer Books</source><creator>Boudet, Alexandre ; Contejean, Evelyne</creator><contributor>Middeldorp, Aart ; Middeldorp, Aart</contributor><creatorcontrib>Boudet, Alexandre ; Contejean, Evelyne ; Middeldorp, Aart ; Middeldorp, Aart</creatorcontrib><description>We present an algorithm for unification of higher-order patterns modulo combinations of disjoint first-order equational theories. This algorithm is highly non-deterministic, in the spirit of those by Schmidt-Schauβ [20] and Baader-Schulz [1] in the first-order case. We redefine the properties required for elementary pattern unification algorithms of pure problems in this context, then we show that some theories of interest have elementary unification algorithms fitting our requirements. This provides a unification algorithm for patterns modulo the combination of theories such as the free theory, commutativity, one-sided distributivity, associativity-commutativity and some of its extensions, including Abelian groups.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540421177</identifier><identifier>ISBN: 3540421173</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540451277</identifier><identifier>EISBN: 9783540451273</identifier><identifier>DOI: 10.1007/3-540-45127-7_7</identifier><identifier>OCLC: 326552738</identifier><identifier>LCCallNum: QA76.76.C65</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Equational Theory ; Exact sciences and technology ; Free Theory ; Free Variable ; Language theory and syntactical analysis ; Logic and foundations ; Mathematical logic, foundations, set theory ; Mathematics ; Nondeterministic Choice ; Proof theory and constructive mathematics ; Sciences and techniques of general use ; Theoretical computing ; Unification Algorithm</subject><ispartof>Lecture notes in computer science, 2001, Vol.2051, p.63-76</ispartof><rights>Springer-Verlag Berlin Heidelberg 2001</rights><rights>2001 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3072507-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/3-540-45127-7_7$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/3-540-45127-7_7$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4049,4050,27924,38254,41441,42510</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1015024$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Middeldorp, Aart</contributor><contributor>Middeldorp, Aart</contributor><creatorcontrib>Boudet, Alexandre</creatorcontrib><creatorcontrib>Contejean, Evelyne</creatorcontrib><title>Combining Pattern E-Unification Algorithms</title><title>Lecture notes in computer science</title><description>We present an algorithm for unification of higher-order patterns modulo combinations of disjoint first-order equational theories. This algorithm is highly non-deterministic, in the spirit of those by Schmidt-Schauβ [20] and Baader-Schulz [1] in the first-order case. We redefine the properties required for elementary pattern unification algorithms of pure problems in this context, then we show that some theories of interest have elementary unification algorithms fitting our requirements. This provides a unification algorithm for patterns modulo the combination of theories such as the free theory, commutativity, one-sided distributivity, associativity-commutativity and some of its extensions, including Abelian groups.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Equational Theory</subject><subject>Exact sciences and technology</subject><subject>Free Theory</subject><subject>Free Variable</subject><subject>Language theory and syntactical analysis</subject><subject>Logic and foundations</subject><subject>Mathematical logic, foundations, set theory</subject><subject>Mathematics</subject><subject>Nondeterministic Choice</subject><subject>Proof theory and constructive mathematics</subject><subject>Sciences and techniques of general use</subject><subject>Theoretical computing</subject><subject>Unification Algorithm</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540421177</isbn><isbn>3540421173</isbn><isbn>3540451277</isbn><isbn>9783540451273</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2001</creationdate><recordtype>book_chapter</recordtype><recordid>eNotUDtPwzAQNk8RSmfWDkxIhrPPruOxqspDqgQDnS3XcdpA6gQ7DPx7TNu74XT3PaT7CLll8MAA1CNSKYAKybiiyqgTco35sN_VKSnYlDGKKPQZGWtV7jHOmFLnpAAETrUSeEkK5FMpucLyioxT-oRc-YRCFuR-3u3WTWjCZvJuh8HHMFnQVWjqxtmh6cJk1m662AzbXbohF7Vtkx8f54isnhYf8xe6fHt-nc-WtGclKCoAnQBeaS2sZ6IWnCvrnK-dUsC91h6UlpVE5NaVULOSV1W5FnIqeAWM44jcHXx7m5xt62iDa5LpY7Oz8dcwYBK4yDR6oKWMhI2PZt11Xynj5j87gybHYfZZmdyZz4-2sfv-8Wkw_l_gfBiibd3W9vn7ZBAUl1nOMGvwD3FtaVM</recordid><startdate>2001</startdate><enddate>2001</enddate><creator>Boudet, Alexandre</creator><creator>Contejean, Evelyne</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>2001</creationdate><title>Combining Pattern E-Unification Algorithms</title><author>Boudet, Alexandre ; Contejean, Evelyne</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p1807-403c402d994ae14f4227accefc7702e99e0795d5332ac80f182dd8b45642d0123</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2001</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Equational Theory</topic><topic>Exact sciences and technology</topic><topic>Free Theory</topic><topic>Free Variable</topic><topic>Language theory and syntactical analysis</topic><topic>Logic and foundations</topic><topic>Mathematical logic, foundations, set theory</topic><topic>Mathematics</topic><topic>Nondeterministic Choice</topic><topic>Proof theory and constructive mathematics</topic><topic>Sciences and techniques of general use</topic><topic>Theoretical computing</topic><topic>Unification Algorithm</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Boudet, Alexandre</creatorcontrib><creatorcontrib>Contejean, Evelyne</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Boudet, Alexandre</au><au>Contejean, Evelyne</au><au>Middeldorp, Aart</au><au>Middeldorp, Aart</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Combining Pattern E-Unification Algorithms</atitle><btitle>Lecture notes in computer science</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2001</date><risdate>2001</risdate><volume>2051</volume><spage>63</spage><epage>76</epage><pages>63-76</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540421177</isbn><isbn>3540421173</isbn><eisbn>3540451277</eisbn><eisbn>9783540451273</eisbn><abstract>We present an algorithm for unification of higher-order patterns modulo combinations of disjoint first-order equational theories. This algorithm is highly non-deterministic, in the spirit of those by Schmidt-Schauβ [20] and Baader-Schulz [1] in the first-order case. We redefine the properties required for elementary pattern unification algorithms of pure problems in this context, then we show that some theories of interest have elementary unification algorithms fitting our requirements. This provides a unification algorithm for patterns modulo the combination of theories such as the free theory, commutativity, one-sided distributivity, associativity-commutativity and some of its extensions, including Abelian groups.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/3-540-45127-7_7</doi><oclcid>326552738</oclcid><tpages>14</tpages></addata></record>
fulltext	fulltext
identifier	ISSN: 0302-9743
ispartof	Lecture notes in computer science, 2001, Vol.2051, p.63-76
issn	0302-9743 1611-3349
language	eng
recordid	cdi_pascalfrancis_primary_1015024
source	Springer Books
subjects	Applied sciences Computer science control theory systems Equational Theory Exact sciences and technology Free Theory Free Variable Language theory and syntactical analysis Logic and foundations Mathematical logic, foundations, set theory Mathematics Nondeterministic Choice Proof theory and constructive mathematics Sciences and techniques of general use Theoretical computing Unification Algorithm
title	Combining Pattern E-Unification Algorithms
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T15%3A28%3A28IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Combining%20Pattern%20E-Unification%20Algorithms&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Boudet,%20Alexandre&rft.date=2001&rft.volume=2051&rft.spage=63&rft.epage=76&rft.pages=63-76&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540421177&rft.isbn_list=3540421173&rft_id=info:doi/10.1007/3-540-45127-7_7&rft_dat=%3Cproquest_pasca%3EEBC3072507_13_73%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540451277&rft.eisbn_list=9783540451273&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3072507_13_73&rft_id=info:pmid/&rfr_iscdi=true