|
|
|
|
| LEADER |
11530cam a2201357 4500 |
| 001 |
183-595126790 |
| 003 |
DE-627 |
| 005 |
20240214204719.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
090328s1993 gw |||||o 00| ||eng c |
| 020 |
|
|
|a 9783540475491
|9 978-3-540-47549-1
|
| 024 |
7 |
|
|a 10.1007/3-540-56393-8
|2 doi
|
| 035 |
|
|
|a (DE-627)595126790
|
| 035 |
|
|
|a (DE-576)9595126799
|
| 035 |
|
|
|a (DE-599)GBV595126790
|
| 035 |
|
|
|a (DE-601)NLM003721507
|
| 035 |
|
|
|a (ZBM)0825.00125
|
| 035 |
|
|
|a (ZBM)0825.00125
|
| 035 |
|
|
|a (DE-He213)978-3-540-47549-1
|
| 035 |
|
|
|a (EBP)040478165
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 044 |
|
|
|c XA-DE-BE
|
| 072 |
|
7 |
|a UMZ
|2 bicssc
|
| 072 |
|
7 |
|a COM051230
|2 bisacsh
|
| 084 |
|
|
|a 28
|2 sdnb
|
| 084 |
|
|
|a SS 4800
|q SEPA
|2 rvk
|0 (DE-625)rvk/143528:
|
| 084 |
|
|
|a ST 130
|q SEPA
|2 rvk
|0 (DE-625)rvk/143588:
|
| 084 |
|
|
|a *00B25
|2 msc
|
| 084 |
|
|
|a 68-06
|2 msc
|
| 084 |
|
|
|a 54.10
|2 bkl
|
| 084 |
|
|
|a 54.62
|2 bkl
|
| 245 |
1 |
0 |
|a Conditional term rewriting systems
|b third international workshop, CTRS-92, Pont-à-Mousson, France, July 8 - 10, 1992 ; proceedings
|c M. Rusinowitch ... (eds.)
|
| 264 |
|
1 |
|a Berlin [u.a.]
|b Springer
|c 1993
|
| 300 |
|
|
|a Online-Ressource (XI, 501 S.)
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a Computermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a Online-Ressource
|b cr
|2 rdacarrier
|
| 490 |
1 |
|
|a Lecture notes in computer science
|v 656
|
| 500 |
|
|
|a Literaturangaben
|
| 520 |
|
|
|a Algebraic semantics of rewriting terms and types -- Context rewriting -- Explicit cyclic substitutions -- Simple type inference for term graph rewriting systems -- Consistency and semantics of equational definitions over predefined algebras -- Completeness of combinations of conditional constructor systems -- Collapsed tree rewriting: Completeness, confluence, and modularity -- Combinations of simplifying conditional term rewriting systems -- Sufficient conditions for modular termination of conditional term rewriting systems -- Termination of combined (rewrite and ?-calculus) systems -- Type removal in term rewriting -- Termination of term rewriting by interpretation -- Path orderings for termination of associative-commutative rewriting -- Generic induction proofs -- A constructor-based approach for positive/negative-conditional equational specifications -- Semantics for positive/negative conditional rewrite systems -- Inductive theorem proving by consistency for first-order clauses -- Reduction techniques for first-order reasoning -- Conditional term rewriting and first-order theorem proving -- Decidability of regularity and related properties of ground normal form languages -- Computing linearizations using test sets -- Proving group isomorphism theorems -- Semigroups satisfying x m+n = x n -- Could orders be captured by term rewriting systems? -- A categorical formulation for critical-pair/completion procedures -- Trace rewriting systems -- A calculus for conditional inductive theorem proving -- Implementing contextual rewriting -- Confluence of terminating membership conditional TRS -- Completeness and confluence of order-sorted term rewriting -- Completion for constrained term rewriting systems -- Generalized partial computation using disunification to solve constraints -- Decidability of finiteness properties -- Termination proofs of well-moded logic programs via conditional rewrite systems -- Logic programs with polymorphic types: A condition for static type checking -- Normalization by leftmost innermost rewriting -- A strategy to deal with divergent rewrite systems -- A new approach to general E-unification based on conditional rewriting systems -- An optimal narrowing strategy for general canonical systems -- Set-of-support strategy for higher-order logic.
|
| 520 |
|
|
|a This volume contains the papers preesented at the Third International Workshop on Conditional Term Rewriting Systems, held in Pont- -Mousson, France, July 8-10, 1992. Topics covered include conditional rewriting and its applications to programming languages, specification languages, automated deduction, constrained rewriting, typed rewriting, higher-order rewriting, and graph rewriting. The volume contains 40 papers, including four invited talks: Algebraic semantics of rewriting terms and types, by K. Meinke; Generic induction proofs, by P. Padawitz; Conditional term rewriting and first-order theorem proving, by D. Plaisted; and Decidability of finiteness properties (abstract), by L. Pacholski. The first CTRS workshop was held at the University of Paris in 1987 and the second at Concordia University, Montreal, in 1990. Their proceddings are published as Lecture Notes in Computer Science Volumes 308 and 516 respectively.
|
| 533 |
|
|
|a Online-Ausg.
|b Berlin [u.a.]
|c Springer
|d 2006
|f Springer lecture notes archive
|7 |2006||||||||||
|
| 650 |
|
0 |
|a Computer science
|
| 650 |
|
0 |
|a Logic, Symbolic and mathematical
|
| 650 |
|
0 |
|a Artificial intelligence
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
|
0 |
|a Machine theory.
|
| 650 |
|
0 |
|a Compilers (Computer programs).
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
|
4 |
|a Mathematical Logic and Formal Languages
|
| 650 |
|
4 |
|a Computer Science
|
| 650 |
|
4 |
|a Mathematical Logic and Foundations
|
| 650 |
|
4 |
|a Artificial Intelligence (incl. Robotics)
|
| 650 |
|
4 |
|a Programming Languages, Compilers, Interpreters
|
| 655 |
|
7 |
|a Konferenzschrift
|0 (DE-588)1071861417
|0 (DE-627)826484824
|0 (DE-576)433375485
|2 gnd-content
|
| 689 |
0 |
0 |
|D s
|0 (DE-588)4200454-8
|0 (DE-627)105173541
|0 (DE-576)210135581
|a Bedingtes Termersetzungssystem
|2 gnd
|
| 689 |
0 |
|
|5 (DE-627)
|
| 700 |
1 |
|
|a Rusinowitch, Michaël
|4 oth
|
| 711 |
2 |
|
|a CTRS
|n 3
|d 1992
|c Pont-à-Mousson
|0 (DE-588)2126878-2
|0 (DE-627)121353532
|0 (DE-576)194326438
|4 oth
|
| 776 |
1 |
|
|z 3540563938
|
| 776 |
1 |
|
|z 9783540563938
|
| 776 |
0 |
8 |
|i Druckausg.
|t Conditional term rewriting systems
|d Berlin : Springer-Verl., 1993
|h XI, 501 S.
|w (DE-627)12087704X
|w (DE-576)031812538
|z 3540563938
|z 0387563938
|
| 830 |
|
0 |
|a Lecture notes in computer science
|v 656
|9 65600
|w (DE-627)316228877
|w (DE-576)093890923
|w (DE-600)2018930-8
|x 1611-3349
|7 ns
|
| 856 |
4 |
0 |
|u http://www.springerlink.com/content/w2pj703818x7
|x Verlag
|z lizenzpflichtig
|3 Volltext
|
| 856 |
4 |
0 |
|u http://www.springerlink.de/openurl.asp?genre=book&isbn=978-3-540-56393-8
|x Verlag
|z lizenzpflichtig
|3 Volltext
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/3-540-56393-8
|x Resolving-System
|z lizenzpflichtig
|3 Volltext
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-56393-8
|m X:SPRINGER
|x Resolving-System
|z lizenzpflichtig
|
| 856 |
4 |
2 |
|u https://zbmath.org/?q=an:0825.00125
|m B:ZBM
|v 2021-04-12
|x Verlag
|y Zentralblatt MATH
|3 Inhaltstext
|
| 912 |
|
|
|a ZDB-1-SLN
|
| 912 |
|
|
|a ZDB-2-LNC
|b 1993
|
| 912 |
|
|
|a ZDB-2-SCS
|b 1993
|
| 912 |
|
|
|a ZDB-2-BAE
|b 1993
|
| 912 |
|
|
|a ZDB-2-SXCS
|b 1993
|
| 912 |
|
|
|a ZDB-2-SEB
|b 1993
|
| 912 |
|
|
|a SSG-OPC-mat
|
| 924 |
1 |
|
|a 1221298666
|b DE-1a
|9 1a
|c GBV
|d d
|h 5:INTERN
|k http://erf.sbb.spk-berlin.de/han/512881081/dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 20266712X
|b DE-84
|9 84
|c GBV
|d d
|k http://dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 201777363
|b DE-46
|9 46
|c GBV
|d d
|k http://dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 1162771496
|b DE-18
|9 18
|c GBV
|d d
|k http://dx.doi.org/10.1007/3-540-56393-8
|k http://emedien.sub.uni-hamburg.de/han/SpringerEbooks/dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 202426378
|b DE-830
|9 830
|c GBV
|d d
|k http://dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 202690792
|b DE-8
|9 8
|c GBV
|d d
|k http://dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 3503727213
|b DE-104
|9 104
|c GBV
|d d
|k http://dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 1114763845
|b DE-27
|9 27
|c GBV
|d d
|k http://dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 202731944
|b DE-Ilm1
|9 Ilm 1
|c GBV
|d d
|g Online-Ressource
|h Internet
|
| 924 |
1 |
|
|a 1273487249
|b DE-7
|9 7
|c GBV
|d d
|k http://dx.doi.org/10.1007/3-540-56393-8
|k http://han.sub.uni-goettingen.de/han/SpringerLectureNotesinComputerScience/dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 1159774536
|b DE-705
|9 705
|c GBV
|d d
|k http://dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 202643441
|b DE-28
|9 28
|c GBV
|d d
|k http://dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 202702626
|b DE-Wim2
|9 Wim 2
|c GBV
|d d
|k http://dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 202631605
|b DE-3
|9 3
|c GBV
|d d
|g ebook
|k http://dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 1173496807
|b DE-9
|9 9
|c GBV
|d d
|k http://dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 1670357171
|b DE-95
|9 95
|c GBV
|d d
|k http://dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 1196441014
|b DE-Ma9
|9 Ma 9
|c GBV
|d d
|g ebook SpringerLectureNotes
|k http://dx.doi.org/10.1007/3-540-56393-8
|k http://han.med.uni-magdeburg.de/han/NLUNIeBookSpringerLectureNotes/dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 1196477558
|b DE-Ma14
|9 Ma 14
|c GBV
|d d
|g ebook SpringerLectureNotes
|k http://dx.doi.org/10.1007/3-540-56393-8
|k http://han.med.uni-magdeburg.de/han/NLUNIeBookSpringerLectureNotes/dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 1217416625
|b DE-Luen4
|9 Lün 4
|c GBV
|d d
|k http://dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 158680880X
|b DE-Kt1
|9 Kt 1
|c GBV
|d d
|k http://dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 927646196
|b DE-715
|9 715
|c GBV
|d d
|k http://dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 1752181972
|b DE-715
|9 715
|c GBV
|d d
|k http://49gbv-uob-primo.hosted.exlibrisgroup.com/openurl/49GBV_UOB/UOB_services_page?u.ignore_date_coverage=true&rft.mms_id=991010473549703501
|l Springer Lecture Notes [Nationallizenz]
|l Campusweiter Zugriff (Universität Oldenburg). - Vervielfältigungen (z.B. Kopien, Downloads) sind nur von einzelnen Kapiteln oder Seiten und nur zum eigenen wissenschaftlichen Gebrauch erlaubt. Keine Weitergabe an Dritte. Kein systematisches Downloaden.
|
| 924 |
1 |
|
|a 202655288
|b DE-700
|9 700
|c GBV
|d d
|k http://dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 3848426293
|b DE-Wis1
|9 Wis 1
|c GBV
|d d
|k http://dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 1263874703
|b DE-755
|9 755
|c GBV
|d d
|k http://dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 1172947821
|b DE-960
|9 960
|c GBV
|d d
|k http://dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 203361954
|b DE-916
|9 916
|c GBV
|d d
|k http://dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 1823528066
|b DE-Ki95
|9 Ki 95
|c GBV
|d d
|k http://dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 1222077124
|b DE-H155
|9 H 155
|c GBV
|d d
|k http://dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 202678954
|b DE-517
|9 517
|c GBV
|d d
|k http://dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 1172991642
|b DE-960-3
|9 960/3
|c GBV
|d d
|k http://dx.doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 4484378957
|b DE-14
|9 14
|c BSZ
|d d
|k https://doi.org/10.1007/3-540-56393-8
|
| 924 |
1 |
|
|a 4484378965
|b DE-576
|9 576
|c BSZ
|d d
|
| 924 |
1 |
|
|a 4484338610
|b DE-Ofb1
|9 Ofb 1
|c BSZ
|d d
|g E-Book Springer
|k https://doi.org/10.1007/3-540-56393-8
|l Zum Online-Dokument
|l Zugang im Hochschulnetz der HS Offenburg / extern via VPN oder Shibboleth (Login über Institution)
|
| 936 |
r |
v |
|a SS 4800
|b Lecture notes in computer science
|k Informatik
|k Enzyklopädien und Handbücher. Kongressberichte Schriftenreihe. Tafeln und Formelsammlungen
|k Schriftenreihen (indiv. Sign.)
|k Lecture notes in computer science
|0 (DE-627)1271461242
|0 (DE-625)rvk/143528:
|0 (DE-576)201461242
|
| 936 |
r |
v |
|a ST 130
|b Allgemeines
|k Informatik
|k Monografien
|k Grundlagen der Informatik
|k Theoretische Informatik
|k Allgemeines
|0 (DE-627)1270877461
|0 (DE-625)rvk/143588:
|0 (DE-576)200877461
|
| 936 |
b |
k |
|a 54.10
|j Theoretische Informatik
|0 (DE-627)106418815
|
| 936 |
b |
k |
|a 54.62
|j Datenstrukturen
|0 (DE-627)106403265
|
| 951 |
|
|
|a BO
|
| 980 |
|
|
|a 595126790
|b 183
|c sid-183-col-kxpbbi
|
SOLR
| _version_ |
1797248075841929216 |
| author2 |
Rusinowitch, Michaël |
| author2_role |
oth |
| author2_variant |
m r mr |
| author_corporate |
CTRS |
| author_corporate_role |
oth |
| author_facet |
Rusinowitch, Michaël, CTRS |
| building |
Library A |
| collection |
ZDB-1-SLN, ZDB-2-LNC, ZDB-2-SCS, ZDB-2-BAE, ZDB-2-SXCS, ZDB-2-SEB, SSG-OPC-mat, sid-183-col-kxpbbi |
| contents |
Algebraic semantics of rewriting terms and types -- Context rewriting -- Explicit cyclic substitutions -- Simple type inference for term graph rewriting systems -- Consistency and semantics of equational definitions over predefined algebras -- Completeness of combinations of conditional constructor systems -- Collapsed tree rewriting: Completeness, confluence, and modularity -- Combinations of simplifying conditional term rewriting systems -- Sufficient conditions for modular termination of conditional term rewriting systems -- Termination of combined (rewrite and ?-calculus) systems -- Type removal in term rewriting -- Termination of term rewriting by interpretation -- Path orderings for termination of associative-commutative rewriting -- Generic induction proofs -- A constructor-based approach for positive/negative-conditional equational specifications -- Semantics for positive/negative conditional rewrite systems -- Inductive theorem proving by consistency for first-order clauses -- Reduction techniques for first-order reasoning -- Conditional term rewriting and first-order theorem proving -- Decidability of regularity and related properties of ground normal form languages -- Computing linearizations using test sets -- Proving group isomorphism theorems -- Semigroups satisfying x m+n = x n -- Could orders be captured by term rewriting systems? -- A categorical formulation for critical-pair/completion procedures -- Trace rewriting systems -- A calculus for conditional inductive theorem proving -- Implementing contextual rewriting -- Confluence of terminating membership conditional TRS -- Completeness and confluence of order-sorted term rewriting -- Completion for constrained term rewriting systems -- Generalized partial computation using disunification to solve constraints -- Decidability of finiteness properties -- Termination proofs of well-moded logic programs via conditional rewrite systems -- Logic programs with polymorphic types: A condition for static type checking -- Normalization by leftmost innermost rewriting -- A strategy to deal with divergent rewrite systems -- A new approach to general E-unification based on conditional rewriting systems -- An optimal narrowing strategy for general canonical systems -- Set-of-support strategy for higher-order logic., This volume contains the papers preesented at the Third International Workshop on Conditional Term Rewriting Systems, held in Pont- -Mousson, France, July 8-10, 1992. Topics covered include conditional rewriting and its applications to programming languages, specification languages, automated deduction, constrained rewriting, typed rewriting, higher-order rewriting, and graph rewriting. The volume contains 40 papers, including four invited talks: Algebraic semantics of rewriting terms and types, by K. Meinke; Generic induction proofs, by P. Padawitz; Conditional term rewriting and first-order theorem proving, by D. Plaisted; and Decidability of finiteness properties (abstract), by L. Pacholski. The first CTRS workshop was held at the University of Paris in 1987 and the second at Concordia University, Montreal, in 1990. Their proceddings are published as Lecture Notes in Computer Science Volumes 308 and 516 respectively. |
| ctrlnum |
(DE-627)595126790, (DE-576)9595126799, (DE-599)GBV595126790, (DE-601)NLM003721507, (ZBM)0825.00125, (DE-He213)978-3-540-47549-1, (EBP)040478165 |
| doi_str_mv |
10.1007/3-540-56393-8 |
| facet_912a |
ZDB-1-SLN, ZDB-2-LNC, ZDB-2-SCS, ZDB-2-BAE, ZDB-2-SXCS, ZDB-2-SEB, SSG-OPC-mat |
| facet_avail |
Online |
| facet_local_del330 |
Bedingtes Termersetzungssystem |
| finc_class_facet |
Informatik |
| fincclass_txtF_mv |
science-computerscience |
| footnote |
Literaturangaben |
| format |
eBook, ConferenceProceedings |
| format_access_txtF_mv |
Book, E-Book |
| format_de105 |
Ebook |
| format_de14 |
Book, E-Book |
| format_de15 |
Book, E-Book |
| format_del152 |
Buch |
| format_detail_txtF_mv |
text-online-monograph-independent-conference |
| format_dezi4 |
e-Book |
| format_finc |
Book, E-Book |
| format_legacy |
ElectronicBook |
| format_legacy_nrw |
Book, E-Book |
| format_nrw |
Book, E-Book |
| format_strict_txtF_mv |
E-Book |
| genre |
Konferenzschrift (DE-588)1071861417 (DE-627)826484824 (DE-576)433375485 gnd-content |
| genre_facet |
Konferenzschrift |
| geogr_code |
not assigned |
| geogr_code_person |
not assigned |
| hierarchy_parent_id |
183-316228877 |
| hierarchy_parent_title |
Lecture notes in computer science |
| hierarchy_sequence |
65600 |
| hierarchy_top_id |
183-316228877 |
| hierarchy_top_title |
Lecture notes in computer science |
| id |
183-595126790 |
| illustrated |
Not Illustrated |
| imprint |
Berlin [u.a.], Springer, 1993 |
| imprint_str_mv |
Berlin [u.a.]: Springer, 1993, Online-Ausg.: Berlin [u.a.]: Springer, 2006 |
| institution |
FID-BBI-DE-23 |
| is_hierarchy_id |
183-595126790 |
| is_hierarchy_title |
Conditional term rewriting systems: third international workshop, CTRS-92, Pont-à-Mousson, France, July 8 - 10, 1992 ; proceedings |
| isbn |
9783540475491 |
| isbn_isn_mv |
3540563938, 9783540563938, 0387563938 |
| issn_isn_mv |
1611-3349 |
| language |
English |
| last_indexed |
2024-04-24T20:08:49.865Z |
| marc024a_ct_mv |
10.1007/3-540-56393-8 |
| marc_error |
[geogr_code]Unable to make public java.lang.AbstractStringBuilder java.lang.AbstractStringBuilder.append(java.lang.String) accessible: module java.base does not "opens java.lang" to unnamed module @6684697a |
| match_str |
rusinowitch1993conditionaltermrewritingsystemsthirdinternationalworkshopctrs92pontamoussonfrancejuly8101992proceedings |
| mega_collection |
K10plus Verbundkatalog, Springer Lecture Notes |
| multipart_link |
093890923 |
| multipart_part |
(093890923)656 |
| physical |
Online-Ressource (XI, 501 S.) |
| publishDate |
1993 |
| publishDateSort |
1993 |
| publishPlace |
Berlin [u.a.] |
| publisher |
Springer |
| record_format |
marcfinc |
| record_id |
595126790 |
| recordtype |
marcfinc |
| rvk_facet |
SS 4800, ST 130 |
| rvk_label |
Informatik, Enzyklopädien und Handbücher. Kongressberichte Schriftenreihe. Tafeln und Formelsammlungen, Schriftenreihen (indiv. Sign.), Lecture notes in computer science, Monografien, Grundlagen der Informatik, Theoretische Informatik, Allgemeines |
| rvk_path |
SS, ST, SQ - SU, SS 4000 - SS 5999, SS 4800, ST 120 - ST 140, ST 130 - ST 140, ST 130 |
| rvk_path_str_mv |
SS, ST, SQ - SU, SS 4000 - SS 5999, SS 4800, ST 120 - ST 140, ST 130 - ST 140, ST 130 |
| series |
Lecture notes in computer science, 656 |
| series2 |
Lecture notes in computer science ; 656 |
| source_id |
183 |
| spelling |
Conditional term rewriting systems third international workshop, CTRS-92, Pont-à-Mousson, France, July 8 - 10, 1992 ; proceedings M. Rusinowitch ... (eds.), Berlin [u.a.] Springer 1993, Online-Ressource (XI, 501 S.), Text txt rdacontent, Computermedien c rdamedia, Online-Ressource cr rdacarrier, Lecture notes in computer science 656, Literaturangaben, Algebraic semantics of rewriting terms and types -- Context rewriting -- Explicit cyclic substitutions -- Simple type inference for term graph rewriting systems -- Consistency and semantics of equational definitions over predefined algebras -- Completeness of combinations of conditional constructor systems -- Collapsed tree rewriting: Completeness, confluence, and modularity -- Combinations of simplifying conditional term rewriting systems -- Sufficient conditions for modular termination of conditional term rewriting systems -- Termination of combined (rewrite and ?-calculus) systems -- Type removal in term rewriting -- Termination of term rewriting by interpretation -- Path orderings for termination of associative-commutative rewriting -- Generic induction proofs -- A constructor-based approach for positive/negative-conditional equational specifications -- Semantics for positive/negative conditional rewrite systems -- Inductive theorem proving by consistency for first-order clauses -- Reduction techniques for first-order reasoning -- Conditional term rewriting and first-order theorem proving -- Decidability of regularity and related properties of ground normal form languages -- Computing linearizations using test sets -- Proving group isomorphism theorems -- Semigroups satisfying x m+n = x n -- Could orders be captured by term rewriting systems? -- A categorical formulation for critical-pair/completion procedures -- Trace rewriting systems -- A calculus for conditional inductive theorem proving -- Implementing contextual rewriting -- Confluence of terminating membership conditional TRS -- Completeness and confluence of order-sorted term rewriting -- Completion for constrained term rewriting systems -- Generalized partial computation using disunification to solve constraints -- Decidability of finiteness properties -- Termination proofs of well-moded logic programs via conditional rewrite systems -- Logic programs with polymorphic types: A condition for static type checking -- Normalization by leftmost innermost rewriting -- A strategy to deal with divergent rewrite systems -- A new approach to general E-unification based on conditional rewriting systems -- An optimal narrowing strategy for general canonical systems -- Set-of-support strategy for higher-order logic., This volume contains the papers preesented at the Third International Workshop on Conditional Term Rewriting Systems, held in Pont- -Mousson, France, July 8-10, 1992. Topics covered include conditional rewriting and its applications to programming languages, specification languages, automated deduction, constrained rewriting, typed rewriting, higher-order rewriting, and graph rewriting. The volume contains 40 papers, including four invited talks: Algebraic semantics of rewriting terms and types, by K. Meinke; Generic induction proofs, by P. Padawitz; Conditional term rewriting and first-order theorem proving, by D. Plaisted; and Decidability of finiteness properties (abstract), by L. Pacholski. The first CTRS workshop was held at the University of Paris in 1987 and the second at Concordia University, Montreal, in 1990. Their proceddings are published as Lecture Notes in Computer Science Volumes 308 and 516 respectively., Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive |2006||||||||||, Computer science, Logic, Symbolic and mathematical, Artificial intelligence, Software engineering., Machine theory., Compilers (Computer programs)., Mathematical logic., Mathematical Logic and Formal Languages, Computer Science, Mathematical Logic and Foundations, Artificial Intelligence (incl. Robotics), Programming Languages, Compilers, Interpreters, Konferenzschrift (DE-588)1071861417 (DE-627)826484824 (DE-576)433375485 gnd-content, s (DE-588)4200454-8 (DE-627)105173541 (DE-576)210135581 Bedingtes Termersetzungssystem gnd, (DE-627), Rusinowitch, Michaël oth, CTRS 3 1992 Pont-à-Mousson (DE-588)2126878-2 (DE-627)121353532 (DE-576)194326438 oth, 3540563938, 9783540563938, Druckausg. Conditional term rewriting systems Berlin : Springer-Verl., 1993 XI, 501 S. (DE-627)12087704X (DE-576)031812538 3540563938 0387563938, Lecture notes in computer science 656 65600 (DE-627)316228877 (DE-576)093890923 (DE-600)2018930-8 1611-3349 ns, http://www.springerlink.com/content/w2pj703818x7 Verlag lizenzpflichtig Volltext, http://www.springerlink.de/openurl.asp?genre=book&isbn=978-3-540-56393-8 Verlag lizenzpflichtig Volltext, http://dx.doi.org/10.1007/3-540-56393-8 Resolving-System lizenzpflichtig Volltext, https://doi.org/10.1007/3-540-56393-8 X:SPRINGER Resolving-System lizenzpflichtig, https://zbmath.org/?q=an:0825.00125 B:ZBM 2021-04-12 Verlag Zentralblatt MATH Inhaltstext |
| spellingShingle |
Conditional term rewriting systems: third international workshop, CTRS-92, Pont-à-Mousson, France, July 8 - 10, 1992 ; proceedings, Lecture notes in computer science, 656, Algebraic semantics of rewriting terms and types -- Context rewriting -- Explicit cyclic substitutions -- Simple type inference for term graph rewriting systems -- Consistency and semantics of equational definitions over predefined algebras -- Completeness of combinations of conditional constructor systems -- Collapsed tree rewriting: Completeness, confluence, and modularity -- Combinations of simplifying conditional term rewriting systems -- Sufficient conditions for modular termination of conditional term rewriting systems -- Termination of combined (rewrite and ?-calculus) systems -- Type removal in term rewriting -- Termination of term rewriting by interpretation -- Path orderings for termination of associative-commutative rewriting -- Generic induction proofs -- A constructor-based approach for positive/negative-conditional equational specifications -- Semantics for positive/negative conditional rewrite systems -- Inductive theorem proving by consistency for first-order clauses -- Reduction techniques for first-order reasoning -- Conditional term rewriting and first-order theorem proving -- Decidability of regularity and related properties of ground normal form languages -- Computing linearizations using test sets -- Proving group isomorphism theorems -- Semigroups satisfying x m+n = x n -- Could orders be captured by term rewriting systems? -- A categorical formulation for critical-pair/completion procedures -- Trace rewriting systems -- A calculus for conditional inductive theorem proving -- Implementing contextual rewriting -- Confluence of terminating membership conditional TRS -- Completeness and confluence of order-sorted term rewriting -- Completion for constrained term rewriting systems -- Generalized partial computation using disunification to solve constraints -- Decidability of finiteness properties -- Termination proofs of well-moded logic programs via conditional rewrite systems -- Logic programs with polymorphic types: A condition for static type checking -- Normalization by leftmost innermost rewriting -- A strategy to deal with divergent rewrite systems -- A new approach to general E-unification based on conditional rewriting systems -- An optimal narrowing strategy for general canonical systems -- Set-of-support strategy for higher-order logic., This volume contains the papers preesented at the Third International Workshop on Conditional Term Rewriting Systems, held in Pont- -Mousson, France, July 8-10, 1992. Topics covered include conditional rewriting and its applications to programming languages, specification languages, automated deduction, constrained rewriting, typed rewriting, higher-order rewriting, and graph rewriting. The volume contains 40 papers, including four invited talks: Algebraic semantics of rewriting terms and types, by K. Meinke; Generic induction proofs, by P. Padawitz; Conditional term rewriting and first-order theorem proving, by D. Plaisted; and Decidability of finiteness properties (abstract), by L. Pacholski. The first CTRS workshop was held at the University of Paris in 1987 and the second at Concordia University, Montreal, in 1990. Their proceddings are published as Lecture Notes in Computer Science Volumes 308 and 516 respectively., Computer science, Logic, Symbolic and mathematical, Artificial intelligence, Software engineering., Machine theory., Compilers (Computer programs)., Mathematical logic., Mathematical Logic and Formal Languages, Computer Science, Mathematical Logic and Foundations, Artificial Intelligence (incl. Robotics), Programming Languages, Compilers, Interpreters, Konferenzschrift, Bedingtes Termersetzungssystem |
| title |
Conditional term rewriting systems: third international workshop, CTRS-92, Pont-à-Mousson, France, July 8 - 10, 1992 ; proceedings |
| title_auth |
Conditional term rewriting systems third international workshop, CTRS-92, Pont-à-Mousson, France, July 8 - 10, 1992 ; proceedings |
| title_full |
Conditional term rewriting systems third international workshop, CTRS-92, Pont-à-Mousson, France, July 8 - 10, 1992 ; proceedings M. Rusinowitch ... (eds.) |
| title_fullStr |
Conditional term rewriting systems third international workshop, CTRS-92, Pont-à-Mousson, France, July 8 - 10, 1992 ; proceedings M. Rusinowitch ... (eds.) |
| title_full_unstemmed |
Conditional term rewriting systems third international workshop, CTRS-92, Pont-à-Mousson, France, July 8 - 10, 1992 ; proceedings M. Rusinowitch ... (eds.) |
| title_in_hierarchy |
656. Conditional term rewriting systems: third international workshop, CTRS-92, Pont-à-Mousson, France, July 8 - 10, 1992 ; proceedings (1993) |
| title_short |
Conditional term rewriting systems |
| title_sort |
conditional term rewriting systems third international workshop, ctrs-92, pont-à-mousson, france, july 8 - 10, 1992 ; proceedings |
| title_sub |
third international workshop, CTRS-92, Pont-à-Mousson, France, July 8 - 10, 1992 ; proceedings |
| title_unstemmed |
Conditional term rewriting systems: third international workshop, CTRS-92, Pont-à-Mousson, France, July 8 - 10, 1992 ; proceedings |
| topic |
Computer science, Logic, Symbolic and mathematical, Artificial intelligence, Software engineering., Machine theory., Compilers (Computer programs)., Mathematical logic., Mathematical Logic and Formal Languages, Computer Science, Mathematical Logic and Foundations, Artificial Intelligence (incl. Robotics), Programming Languages, Compilers, Interpreters, Konferenzschrift, Bedingtes Termersetzungssystem |
| topic_facet |
Computer science, Logic, Symbolic and mathematical, Artificial intelligence, Software engineering., Machine theory., Compilers (Computer programs)., Mathematical logic., Mathematical Logic and Formal Languages, Computer Science, Mathematical Logic and Foundations, Artificial Intelligence (incl. Robotics), Programming Languages, Compilers, Interpreters, Konferenzschrift, Bedingtes Termersetzungssystem |
| url |
http://www.springerlink.com/content/w2pj703818x7, http://www.springerlink.de/openurl.asp?genre=book&isbn=978-3-540-56393-8, http://dx.doi.org/10.1007/3-540-56393-8, https://doi.org/10.1007/3-540-56393-8, https://zbmath.org/?q=an:0825.00125 |
| work_keys_str_mv |
AT rusinowitchmichael conditionaltermrewritingsystemsthirdinternationalworkshopctrs92pontamoussonfrancejuly8101992proceedings, AT ctrspontamousson conditionaltermrewritingsystemsthirdinternationalworkshopctrs92pontamoussonfrancejuly8101992proceedings |