On generic representation of implicit induction procedures:
Abstract: "We develop a generic representation of implicit induction proof procedures within the cover set induction framework. Our work further develops the approach of cover set induction on propositional orderings. We show that in order to represent a substantially wide range of implicit ind...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1996
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
96,20 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We develop a generic representation of implicit induction proof procedures within the cover set induction framework. Our work further develops the approach of cover set induction on propositional orderings. We show that in order to represent a substantially wide range of implicit induction procedures it is neccessary to generalize the induction on formulas (propositions) to the induction on formula instances. We present a generic induction procedure which captures virtually all the existing implicit induction procedures developed from the inductive completion framework. We establish the formal relationship between the generic induction procedure and the cover set induction scheme. We also demonstrate that the developed generic framework allows for easy generalization/modification of the existing procedures." |
| Beschreibung: | 31 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011033000 | ||
| 003 | DE-604 | ||
| 005 | 19961104 | ||
| 007 | t | ||
| 008 | 961104s1996 |||| 00||| engod | ||
| 035 | |a (OCoLC)1069075650 | ||
| 035 | |a (DE-599)BVBBV011033000 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Naidich, Dimitri |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a On generic representation of implicit induction procedures |c D. Naidich |
| 264 | 1 | |a Amsterdam |c 1996 | |
| 300 | |a 31 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 96,20 | |
| 520 | 3 | |a Abstract: "We develop a generic representation of implicit induction proof procedures within the cover set induction framework. Our work further develops the approach of cover set induction on propositional orderings. We show that in order to represent a substantially wide range of implicit induction procedures it is neccessary to generalize the induction on formulas (propositions) to the induction on formula instances. We present a generic induction procedure which captures virtually all the existing implicit induction procedures developed from the inductive completion framework. We establish the formal relationship between the generic induction procedure and the cover set induction scheme. We also demonstrate that the developed generic framework allows for easy generalization/modification of the existing procedures." | |
| 650 | 4 | |a Algebra, Abstract | |
| 650 | 4 | |a Automatic theorem proving | |
| 650 | 4 | |a Rewriting systems (Computer science) | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 96,20 |w (DE-604)BV008928356 |9 96,20 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007387955 | ||
Datensatz im Suchindex
| _version_ | 1804125523479101440 |
|---|---|
| any_adam_object | |
| author | Naidich, Dimitri |
| author_facet | Naidich, Dimitri |
| author_role | aut |
| author_sort | Naidich, Dimitri |
| author_variant | d n dn |
| building | Verbundindex |
| bvnumber | BV011033000 |
| ctrlnum | (OCoLC)1069075650 (DE-599)BVBBV011033000 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01863nam a2200301 cb4500</leader><controlfield tag="001">BV011033000</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19961104 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961104s1996 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1069075650</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011033000</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Naidich, Dimitri</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On generic representation of implicit induction procedures</subfield><subfield code="c">D. Naidich</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">31 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">96,20</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We develop a generic representation of implicit induction proof procedures within the cover set induction framework. Our work further develops the approach of cover set induction on propositional orderings. We show that in order to represent a substantially wide range of implicit induction procedures it is neccessary to generalize the induction on formulas (propositions) to the induction on formula instances. We present a generic induction procedure which captures virtually all the existing implicit induction procedures developed from the inductive completion framework. We establish the formal relationship between the generic induction procedure and the cover set induction scheme. We also demonstrate that the developed generic framework allows for easy generalization/modification of the existing procedures."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algebra, Abstract</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic theorem proving</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rewriting systems (Computer science)</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">96,20</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">96,20</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007387955</subfield></datafield></record></collection> |
| id | DE-604.BV011033000 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:02:55Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007387955 |
| oclc_num | 1069075650 |
| open_access_boolean | |
| physical | 31 S. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Naidich, Dimitri Verfasser aut On generic representation of implicit induction procedures D. Naidich Amsterdam 1996 31 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 96,20 Abstract: "We develop a generic representation of implicit induction proof procedures within the cover set induction framework. Our work further develops the approach of cover set induction on propositional orderings. We show that in order to represent a substantially wide range of implicit induction procedures it is neccessary to generalize the induction on formulas (propositions) to the induction on formula instances. We present a generic induction procedure which captures virtually all the existing implicit induction procedures developed from the inductive completion framework. We establish the formal relationship between the generic induction procedure and the cover set induction scheme. We also demonstrate that the developed generic framework allows for easy generalization/modification of the existing procedures." Algebra, Abstract Automatic theorem proving Rewriting systems (Computer science) Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 96,20 (DE-604)BV008928356 96,20 |
| spellingShingle | Naidich, Dimitri On generic representation of implicit induction procedures Algebra, Abstract Automatic theorem proving Rewriting systems (Computer science) |
| title | On generic representation of implicit induction procedures |
| title_auth | On generic representation of implicit induction procedures |
| title_exact_search | On generic representation of implicit induction procedures |
| title_full | On generic representation of implicit induction procedures D. Naidich |
| title_fullStr | On generic representation of implicit induction procedures D. Naidich |
| title_full_unstemmed | On generic representation of implicit induction procedures D. Naidich |
| title_short | On generic representation of implicit induction procedures |
| title_sort | on generic representation of implicit induction procedures |
| topic | Algebra, Abstract Automatic theorem proving Rewriting systems (Computer science) |
| topic_facet | Algebra, Abstract Automatic theorem proving Rewriting systems (Computer science) |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT naidichdimitri ongenericrepresentationofimplicitinductionprocedures |