Fast theorem proving in intuitionistic propositional logic:
Abstract: "The decision problem for Intuitionistic Propositional Logic Int is considered: (i) A computational semantics is introduced for relational knowledge bases. Our semantics naturally arises from practical experience of databases and knowledge bases. It is stated that the corresponding lo...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1991
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
91,57 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "The decision problem for Intuitionistic Propositional Logic Int is considered: (i) A computational semantics is introduced for relational knowledge bases. Our semantics naturally arises from practical experience of databases and knowledge bases. It is stated that the corresponding logic coincides exactly with the intuitionistic one. (ii) Our methods of proof of the general theorems turn out to be very useful for designing new efficient algorithms In particular, on the basis of a specific Calculus of Tasks related to this computational interpretation, an efficient prove-or- disprove algorithm is designed with the following properties: For an arbitrary intuitionistic propositional formula, the algorithm runs in linear deterministic space, For every 'reasonable' formula, the algorithm runs in 'reasonable' time, despite of the fact that in theory it has an 'exponential' uniform lower bound. Note that in view of the PSPACE- completeness of Propositional Intuitionistic Logic an exponential execution time can be expected in the worst case But such cases only arise for very unnatural formulas, i.e., for formulas that even in their best solutions need maximal cross-linking of all their possible subtasks. The theorem prover has been implemented in PASCAL. |
| Beschreibung: | 16 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008993175 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)27471552 | ||
| 035 | |a (DE-599)BVBBV008993175 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Kanovich, Max I. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Fast theorem proving in intuitionistic propositional logic |c M. I. Kanovich |
| 264 | 1 | |a Amsterdam |c 1991 | |
| 300 | |a 16 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 91,57 | |
| 520 | 3 | |a Abstract: "The decision problem for Intuitionistic Propositional Logic Int is considered: (i) A computational semantics is introduced for relational knowledge bases. Our semantics naturally arises from practical experience of databases and knowledge bases. It is stated that the corresponding logic coincides exactly with the intuitionistic one. (ii) Our methods of proof of the general theorems turn out to be very useful for designing new efficient algorithms | |
| 520 | 3 | |a In particular, on the basis of a specific Calculus of Tasks related to this computational interpretation, an efficient prove-or- disprove algorithm is designed with the following properties: For an arbitrary intuitionistic propositional formula, the algorithm runs in linear deterministic space, For every 'reasonable' formula, the algorithm runs in 'reasonable' time, despite of the fact that in theory it has an 'exponential' uniform lower bound. Note that in view of the PSPACE- completeness of Propositional Intuitionistic Logic an exponential execution time can be expected in the worst case | |
| 520 | 3 | |a But such cases only arise for very unnatural formulas, i.e., for formulas that even in their best solutions need maximal cross-linking of all their possible subtasks. The theorem prover has been implemented in PASCAL. | |
| 650 | 4 | |a Automatic theorem proving | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 91,57 |w (DE-604)BV008928356 |9 91,57 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005941998 | ||
Datensatz im Suchindex
| _version_ | 1804123335689240576 |
|---|---|
| any_adam_object | |
| author | Kanovich, Max I. |
| author_facet | Kanovich, Max I. |
| author_role | aut |
| author_sort | Kanovich, Max I. |
| author_variant | m i k mi mik |
| building | Verbundindex |
| bvnumber | BV008993175 |
| ctrlnum | (OCoLC)27471552 (DE-599)BVBBV008993175 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02279nam a2200313 cb4500</leader><controlfield tag="001">BV008993175</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27471552</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008993175</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-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kanovich, Max I.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Fast theorem proving in intuitionistic propositional logic</subfield><subfield code="c">M. I. Kanovich</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16 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">91,57</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The decision problem for Intuitionistic Propositional Logic Int is considered: (i) A computational semantics is introduced for relational knowledge bases. Our semantics naturally arises from practical experience of databases and knowledge bases. It is stated that the corresponding logic coincides exactly with the intuitionistic one. (ii) Our methods of proof of the general theorems turn out to be very useful for designing new efficient algorithms</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">In particular, on the basis of a specific Calculus of Tasks related to this computational interpretation, an efficient prove-or- disprove algorithm is designed with the following properties: For an arbitrary intuitionistic propositional formula, the algorithm runs in linear deterministic space, For every 'reasonable' formula, the algorithm runs in 'reasonable' time, despite of the fact that in theory it has an 'exponential' uniform lower bound. Note that in view of the PSPACE- completeness of Propositional Intuitionistic Logic an exponential execution time can be expected in the worst case</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">But such cases only arise for very unnatural formulas, i.e., for formulas that even in their best solutions need maximal cross-linking of all their possible subtasks. The theorem prover has been implemented in PASCAL.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic theorem proving</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">91,57</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">91,57</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005941998</subfield></datafield></record></collection> |
| id | DE-604.BV008993175 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:08Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005941998 |
| oclc_num | 27471552 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 16 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Kanovich, Max I. Verfasser aut Fast theorem proving in intuitionistic propositional logic M. I. Kanovich Amsterdam 1991 16 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 91,57 Abstract: "The decision problem for Intuitionistic Propositional Logic Int is considered: (i) A computational semantics is introduced for relational knowledge bases. Our semantics naturally arises from practical experience of databases and knowledge bases. It is stated that the corresponding logic coincides exactly with the intuitionistic one. (ii) Our methods of proof of the general theorems turn out to be very useful for designing new efficient algorithms In particular, on the basis of a specific Calculus of Tasks related to this computational interpretation, an efficient prove-or- disprove algorithm is designed with the following properties: For an arbitrary intuitionistic propositional formula, the algorithm runs in linear deterministic space, For every 'reasonable' formula, the algorithm runs in 'reasonable' time, despite of the fact that in theory it has an 'exponential' uniform lower bound. Note that in view of the PSPACE- completeness of Propositional Intuitionistic Logic an exponential execution time can be expected in the worst case But such cases only arise for very unnatural formulas, i.e., for formulas that even in their best solutions need maximal cross-linking of all their possible subtasks. The theorem prover has been implemented in PASCAL. Automatic theorem proving Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 91,57 (DE-604)BV008928356 91,57 |
| spellingShingle | Kanovich, Max I. Fast theorem proving in intuitionistic propositional logic Automatic theorem proving |
| title | Fast theorem proving in intuitionistic propositional logic |
| title_auth | Fast theorem proving in intuitionistic propositional logic |
| title_exact_search | Fast theorem proving in intuitionistic propositional logic |
| title_full | Fast theorem proving in intuitionistic propositional logic M. I. Kanovich |
| title_fullStr | Fast theorem proving in intuitionistic propositional logic M. I. Kanovich |
| title_full_unstemmed | Fast theorem proving in intuitionistic propositional logic M. I. Kanovich |
| title_short | Fast theorem proving in intuitionistic propositional logic |
| title_sort | fast theorem proving in intuitionistic propositional logic |
| topic | Automatic theorem proving |
| topic_facet | Automatic theorem proving |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT kanovichmaxi fasttheoremprovinginintuitionisticpropositionallogic |