| 000 | 02865nam a22004455i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-39240-8 | ||
| 003 | DE-He213 | ||
| 005 | 20160624101943.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121227s1982 gw | s |||| 0|eng d | ||
| 020 |
_a9783540392408 _9978-3-540-39240-8 |
||
| 024 | 7 |
_a10.1007/BFb0000048 _2doi |
|
| 050 | 4 | _aQA8.9-QA10.3 | |
| 072 | 7 |
_aUYA _2bicssc |
|
| 072 | 7 |
_aMAT018000 _2bisacsh |
|
| 072 | 7 |
_aCOM051010 _2bisacsh |
|
| 082 | 0 | 4 |
_a005.131 _223 |
| 245 | 1 | 0 |
_a6th Conference on Automated Deduction _h[electronic resource] : _bNew York, USA, June 7–9, 1982 / _cedited by D. W. Loveland. |
| 260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1982. |
|
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1982. |
|
| 300 |
_aVII, 389 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v138 |
|
| 505 | 0 | _aSolving open questions with an automated theorem-proving program -- STP: A mechanized logic for specification and verification -- A look at TPS -- Logic machine architecture: Kernel functions -- Logic machine architecture: Inference mechanisms -- Procedure implementation through demodulation and related tricks -- The application of Homogenization to simultaneous equations -- Meta-level inference and program verification -- An example of FOL using metatheory -- Comparison of natural deduction and locking resolution implementations -- Derived preconditions and their use in program synthesis -- Automatic construction of special purpose programs -- Deciding combinations of theories -- Exponential improvement of efficient backtracking -- Exponential improvement of exhaustive backtracking: data structure and implementation -- Intuitionistic basis for non-monotonic logic -- Knowledge retrieval as limited inference -- On indefinite databases and the closed world assumption -- Proof by matrix reduction as plan + validation -- Improvements of a tautology-testing algorithm -- Representing infinite sequences of resolvents in recursive First-Order Horn Databases -- The power of the Church-Rosser property for string rewriting systems -- Universal unification and a classification of equational theories. | |
| 650 | 0 | _aComputer science. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
| 700 | 1 |
_aLoveland, D. W. _eeditor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540115588 |
| 786 | _dSpringer | ||
| 830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v138 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/BFb0000048 |
| 942 |
_2EBK4611 _cEBK |
||
| 999 |
_c33905 _d33905 |
||