Higher order annotated terms for proof search:
Abstract: "A notion of embedding appropriate to higher-order syntax is described. This provides a representation of annotated formulae in terms of the difference between pairs of formulae. We define substitution and unification for such annotated terms. Using this representation of annotated te...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Edinburgh
1996
|
| Series: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
799 |
| Subjects: | |
| Summary: | Abstract: "A notion of embedding appropriate to higher-order syntax is described. This provides a representation of annotated formulae in terms of the difference between pairs of formulae. We define substitution and unification for such annotated terms. Using this representation of annotated terms, the proof search guidance technique of rippling can be extended to higher-order theorems. We illustrate this by several examples based on an implementation of these ideas in [lambda]Prolog." |
| Physical Description: | [13] S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011049754 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 961111s1996 |||| 00||| engod | ||
| 035 | |a (OCoLC)35736608 | ||
| 035 | |a (DE-599)BVBBV011049754 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Smaill, Alan |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Higher order annotated terms for proof search |c Smaill, A. ; Green, I. |
| 264 | 1 | |a Edinburgh |c 1996 | |
| 300 | |a [13] S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |v 799 | |
| 520 | 3 | |a Abstract: "A notion of embedding appropriate to higher-order syntax is described. This provides a representation of annotated formulae in terms of the difference between pairs of formulae. We define substitution and unification for such annotated terms. Using this representation of annotated terms, the proof search guidance technique of rippling can be extended to higher-order theorems. We illustrate this by several examples based on an implementation of these ideas in [lambda]Prolog." | |
| 650 | 7 | |a Applied statistics, operational research |2 sigle | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 4 | |a Automatic theorem proving | |
| 650 | 4 | |a Embeddings (Mathematics) | |
| 650 | 4 | |a Logic, Symbolic and mathematical | |
| 650 | 4 | |a Prolog (Computer program language) | |
| 700 | 1 | |a Green, Ian |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 799 |w (DE-604)BV010450646 |9 799 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007400192 | ||
Record in the Search Index
| _version_ | 1804125539503439872 |
|---|---|
| any_adam_object | |
| author | Smaill, Alan Green, Ian |
| author_facet | Smaill, Alan Green, Ian |
| author_role | aut aut |
| author_sort | Smaill, Alan |
| author_variant | a s as i g ig |
| building | Verbundindex |
| bvnumber | BV011049754 |
| ctrlnum | (OCoLC)35736608 (DE-599)BVBBV011049754 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01717nam a2200361 cb4500</leader><controlfield tag="001">BV011049754</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961111s1996 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35736608</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011049754</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="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Smaill, Alan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Higher order annotated terms for proof search</subfield><subfield code="c">Smaill, A. ; Green, I.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">[13] 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">University <Edinburgh> / Department of Artificial Intelligence: DAI research paper</subfield><subfield code="v">799</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "A notion of embedding appropriate to higher-order syntax is described. This provides a representation of annotated formulae in terms of the difference between pairs of formulae. We define substitution and unification for such annotated terms. Using this representation of annotated terms, the proof search guidance technique of rippling can be extended to higher-order theorems. We illustrate this by several examples based on an implementation of these ideas in [lambda]Prolog."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Applied statistics, operational research</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</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">Embeddings (Mathematics)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic, Symbolic and mathematical</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Prolog (Computer program language)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Green, Ian</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Artificial Intelligence: DAI research paper</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">799</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">799</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007400192</subfield></datafield></record></collection> |
| id | DE-604.BV011049754 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:03:10Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007400192 |
| oclc_num | 35736608 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | [13] S. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Smaill, Alan Verfasser aut Higher order annotated terms for proof search Smaill, A. ; Green, I. Edinburgh 1996 [13] S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 799 Abstract: "A notion of embedding appropriate to higher-order syntax is described. This provides a representation of annotated formulae in terms of the difference between pairs of formulae. We define substitution and unification for such annotated terms. Using this representation of annotated terms, the proof search guidance technique of rippling can be extended to higher-order theorems. We illustrate this by several examples based on an implementation of these ideas in [lambda]Prolog." Applied statistics, operational research sigle Computer software sigle Automatic theorem proving Embeddings (Mathematics) Logic, Symbolic and mathematical Prolog (Computer program language) Green, Ian Verfasser aut Department of Artificial Intelligence: DAI research paper University <Edinburgh> 799 (DE-604)BV010450646 799 |
| spellingShingle | Smaill, Alan Green, Ian Higher order annotated terms for proof search Applied statistics, operational research sigle Computer software sigle Automatic theorem proving Embeddings (Mathematics) Logic, Symbolic and mathematical Prolog (Computer program language) |
| title | Higher order annotated terms for proof search |
| title_auth | Higher order annotated terms for proof search |
| title_exact_search | Higher order annotated terms for proof search |
| title_full | Higher order annotated terms for proof search Smaill, A. ; Green, I. |
| title_fullStr | Higher order annotated terms for proof search Smaill, A. ; Green, I. |
| title_full_unstemmed | Higher order annotated terms for proof search Smaill, A. ; Green, I. |
| title_short | Higher order annotated terms for proof search |
| title_sort | higher order annotated terms for proof search |
| topic | Applied statistics, operational research sigle Computer software sigle Automatic theorem proving Embeddings (Mathematics) Logic, Symbolic and mathematical Prolog (Computer program language) |
| topic_facet | Applied statistics, operational research Computer software Automatic theorem proving Embeddings (Mathematics) Logic, Symbolic and mathematical Prolog (Computer program language) |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT smaillalan higherorderannotatedtermsforproofsearch AT greenian higherorderannotatedtermsforproofsearch |