Connection calculi for automated theorem proving in classical and non-classical logics:
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis Book |
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Physical Description: | 145 S. graph. Darst. |
Staff View
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV041996861 | ||
| 003 | DE-604 | ||
| 005 | 20141001 | ||
| 007 | t | ||
| 008 | 140728s2013 d||| m||| 00||| eng d | ||
| 035 | |a (OCoLC)889798975 | ||
| 035 | |a (DE-599)GBV790768828 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-188 |a DE-12 | ||
| 082 | 0 | |a 511.36 |2 22/ger | |
| 100 | 1 | |a Otten, Jens |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Connection calculi for automated theorem proving in classical and non-classical logics |c by Jens Otten |
| 264 | 1 | |c 2013 | |
| 300 | |a 145 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |a Potsdam, Univ., Diss., 2013 | ||
| 650 | 0 | 7 | |a Automatisches Beweisverfahren |0 (DE-588)4069034-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Nichtklassische Logik |0 (DE-588)4197462-1 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Automatisches Beweisverfahren |0 (DE-588)4069034-9 |D s |
| 689 | 0 | 1 | |a Nichtklassische Logik |0 (DE-588)4197462-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027438983&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027438983 | ||
Record in the Search Index
| _version_ | 1804152404734640128 |
|---|---|
| adam_text | CONTENTS
1 INTRODUCTION 1
1.1 CLASSICAL AND NON-CLASSICAL LOGICS 1
1.2 AUTOMATED THEOREM PROVING 2
1.3 CONNECTION CALCULI 4
1.4 MOTIVATION AND OVERVIEW OF PUBLICATIONS 5
2 PUBLICATIONS 7
2.1 LEANCOP: LEAN CONNECTION-BASED THEOREM PROVING 8
2.2 CONNECTION-BASED THEOREM PROVING IN INTUITIONISTIC LOGIC 32
2.3 LEANCOP 2.0 & ILEANCOP 1.2: HIGH PERFORMANCE LEAN THEOREM PROVING 50
2.4 RESTRICTING BACKTRACKING IN CONNECTION CALCULI 60
2.5 A NON-CLAUSAL CONNECTION CALCULUS 85
2.6 IMPLEMENTING CONNECTION CALCULI FOR FIRST-ORDER MODAL LOGICS 102
2.7 IMPLEMENTING AND EVALUATING PROVERS FOR MODAL LOGICS 118
3 SUMMARY 125
3.1 CLAUSAL CONNECTION CALCULI 125
3.1.1 CONNECTION CALCULUS FOR CLASSICAL LOGIC 125
3.1.2 CONNECTION CALCULUS FOR INTUITIONISTIC LOGIC 127
3.1.3 CONNECTION CALCULI FOR MODAL LOGICS 129
3.1.4 RESTRICTED BACKTRACKING , 131
3.2 IMPLEMENTING CLAUSAL CONNECTION CALCULI 132
3.2.1 LEANCOP FOR CLASSICAL LOGIC 132
3.2.2 ILEANCOP FOR INTUITIONISTIC LOGIC 134
3.2.3 MLEANCOP FOR MODAL LOGICS 135
3.3 THE NON-CLAUSAL CONNECTION CALCULUS 136
4 CONCLUSION 139
HTTP://D-NB.INFO/1054659966
|
| any_adam_object | 1 |
| author | Otten, Jens |
| author_facet | Otten, Jens |
| author_role | aut |
| author_sort | Otten, Jens |
| author_variant | j o jo |
| building | Verbundindex |
| bvnumber | BV041996861 |
| ctrlnum | (OCoLC)889798975 (DE-599)GBV790768828 |
| dewey-full | 511.36 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.36 |
| dewey-search | 511.36 |
| dewey-sort | 3511.36 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01366nam a2200349 c 4500</leader><controlfield tag="001">BV041996861</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20141001 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">140728s2013 d||| m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)889798975</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV790768828</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-188</subfield><subfield code="a">DE-12</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.36</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Otten, Jens</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Connection calculi for automated theorem proving in classical and non-classical logics</subfield><subfield code="c">by Jens Otten</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">145 S.</subfield><subfield code="b">graph. Darst.</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="502" ind1=" " ind2=" "><subfield code="a">Potsdam, Univ., Diss., 2013</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Automatisches Beweisverfahren</subfield><subfield code="0">(DE-588)4069034-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Nichtklassische Logik</subfield><subfield code="0">(DE-588)4197462-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Automatisches Beweisverfahren</subfield><subfield code="0">(DE-588)4069034-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Nichtklassische Logik</subfield><subfield code="0">(DE-588)4197462-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027438983&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027438983</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV041996861 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T01:10:11Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027438983 |
| oclc_num | 889798975 |
| open_access_boolean | |
| owner | DE-188 DE-12 |
| owner_facet | DE-188 DE-12 |
| physical | 145 S. graph. Darst. |
| publishDate | 2013 |
| publishDateSearch | 2013 |
| publishDateSort | 2013 |
| record_format | marc |
| spelling | Otten, Jens Verfasser aut Connection calculi for automated theorem proving in classical and non-classical logics by Jens Otten 2013 145 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Potsdam, Univ., Diss., 2013 Automatisches Beweisverfahren (DE-588)4069034-9 gnd rswk-swf Nichtklassische Logik (DE-588)4197462-1 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Automatisches Beweisverfahren (DE-588)4069034-9 s Nichtklassische Logik (DE-588)4197462-1 s DE-604 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027438983&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Otten, Jens Connection calculi for automated theorem proving in classical and non-classical logics Automatisches Beweisverfahren (DE-588)4069034-9 gnd Nichtklassische Logik (DE-588)4197462-1 gnd |
| subject_GND | (DE-588)4069034-9 (DE-588)4197462-1 (DE-588)4113937-9 |
| title | Connection calculi for automated theorem proving in classical and non-classical logics |
| title_auth | Connection calculi for automated theorem proving in classical and non-classical logics |
| title_exact_search | Connection calculi for automated theorem proving in classical and non-classical logics |
| title_full | Connection calculi for automated theorem proving in classical and non-classical logics by Jens Otten |
| title_fullStr | Connection calculi for automated theorem proving in classical and non-classical logics by Jens Otten |
| title_full_unstemmed | Connection calculi for automated theorem proving in classical and non-classical logics by Jens Otten |
| title_short | Connection calculi for automated theorem proving in classical and non-classical logics |
| title_sort | connection calculi for automated theorem proving in classical and non classical logics |
| topic | Automatisches Beweisverfahren (DE-588)4069034-9 gnd Nichtklassische Logik (DE-588)4197462-1 gnd |
| topic_facet | Automatisches Beweisverfahren Nichtklassische Logik Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027438983&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT ottenjens connectioncalculiforautomatedtheoremprovinginclassicalandnonclassicallogics |