000 | 03460nam a22006015i 4500 | ||
---|---|---|---|
001 | 978-3-319-40229-1 | ||
003 | DE-He213 | ||
005 | 20200421112222.0 | ||
007 | cr nn 008mamaa | ||
008 | 160611s2016 gw | s |||| 0|eng d | ||
020 |
_a9783319402291 _9978-3-319-40229-1 |
||
024 | 7 |
_a10.1007/978-3-319-40229-1 _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 |
_aAutomated Reasoning _h[electronic resource] : _b8th International Joint Conference, IJCAR 2016, Coimbra, Portugal, June 27 - July 2, 2016, Proceedings / _cedited by Nicola Olivetti, Ashish Tiwari. |
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2016. |
|
300 |
_aXX, 580 p. 101 illus. _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 ; _v9706 |
|
505 | 0 | _aSatisfiabiliy of Boolean Formulas -- Satisfiability Modulo Theory -- Rewriting -- Arithmetic Reasoning and Mechanizing Mathematics -- First-order Logic and Proof Theory -- First-order Theorem Proving -- Higher-order Theorem Proving -- Modal and Temporal Logics -- Non-classical Logics -- Verification. | |
520 | _aThis book constitutes the refereed proceedings of the 8th International Joint Conference on Automated Reasoning, IJCAR 2016, held in Coimbra, Portugal, in June/July 2016. IJCAR 2014 was a merger of three leading events in automated reasoning, namely CADE (International Conference on Automated Deduction), FroCoS (International Symposium on Frontiers of Combining Systems) and TABLEAUX (International Conference on Automated Reasoning with Analytic Tableaux and Related Methods). The 26 revised full research papers and 9 system descriptions presented together with 4 invited talks were carefully reviewed and selected from 79 submissions. The papers have been organized in topical sections on satisfiability of Boolean formulas, satisfiability modulo theory, rewriting, arithmetic reasoning and mechanizing mathematics, first-order logic and proof theory, first-order theorem proving, higher-order theorem proving, modal and temporal logics, non-classical logics, and verification. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aProgramming languages (Electronic computers). | |
650 | 0 | _aComputer logic. | |
650 | 0 | _aMathematical logic. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aArtificial intelligence. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
650 | 2 | 4 | _aLogics and Meanings of Programs. |
650 | 2 | 4 | _aArtificial Intelligence (incl. Robotics). |
650 | 2 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aMathematics of Computing. |
650 | 2 | 4 | _aProgramming Languages, Compilers, Interpreters. |
700 | 1 |
_aOlivetti, Nicola. _eeditor. |
|
700 | 1 |
_aTiwari, Ashish. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783319402284 |
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v9706 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-319-40229-1 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-LNC | ||
942 | _cEBK | ||
999 |
_c57456 _d57456 |