000 | 03787nam a22006255i 4500 | ||
---|---|---|---|
001 | 978-3-030-86205-3 | ||
003 | DE-He213 | ||
005 | 20240730171910.0 | ||
007 | cr nn 008mamaa | ||
008 | 210831s2021 sz | s |||| 0|eng d | ||
020 |
_a9783030862053 _9978-3-030-86205-3 |
||
024 | 7 |
_a10.1007/978-3-030-86205-3 _2doi |
|
050 | 4 | _aQ334-342 | |
050 | 4 | _aTA347.A78 | |
072 | 7 |
_aUYQ _2bicssc |
|
072 | 7 |
_aCOM004000 _2bisacsh |
|
072 | 7 |
_aUYQ _2thema |
|
082 | 0 | 4 |
_a006.3 _223 |
245 | 1 | 0 |
_aFrontiers of Combining Systems _h[electronic resource] : _b13th International Symposium, FroCoS 2021, Birmingham, UK, September 8-10, 2021, Proceedings / _cedited by Boris Konev, Giles Reger. |
250 | _a1st ed. 2021. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2021. |
|
300 |
_aXVI, 307 p. 41 illus., 19 illus. in color. _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 Artificial Intelligence, _x2945-9141 ; _v12941 |
|
505 | 0 | _aCalculi and Unification -- A Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic -- Non-Disjoint Combined Unification and Closure by Equational Paramodulation -- Symbol Elimination and Applications to Parametric Entailment Problems -- On the copy complexity of width 3 Horn constraint systems -- Description Logics Restricted Unification in the Description Logic FL0 -- Combining Event Calculus and Description Logic Reasoning via Logic Programming -- Semantic Forgetting in Expressive Description Logics -- Interactive Theorem Proving Improving Automation for Higher-order Proof Steps -- JEFL: Joint Embedding of Formal Proof Libraries -- Machine Learning Fast and Slow Enigmas and Parental Guidance -- Vampire With a Brain Is a Good ITP Hammer -- Satisfiability Modulo Theories Optimization Modulo Non-Linear Arithmetic via Incremental Linearization -- Quantifier Simplification by Unification in SMT -- Verification Algorithmic Problems in the Symbolic Approach to the Verification of Automatically Synthesized Cryptosystems -- Formal Analysis of Symbolic Authenticity -- Formal Verification of a Java Component Using the RESOLVE Framework. | |
520 | _aThis book constitutes the refereed proceedings of the 13th International Symposium on Frontiers of Combining Systems, FroCoS 2021, held in Birmingham, UK, in September 2021. | ||
650 | 0 |
_aArtificial intelligence. _93407 |
|
650 | 0 |
_aSoftware engineering. _94138 |
|
650 | 0 |
_aComputer engineering. _910164 |
|
650 | 0 |
_aComputer networks . _931572 |
|
650 | 0 |
_aComputer science. _99832 |
|
650 | 0 |
_aMachine theory. _9100816 |
|
650 | 1 | 4 |
_aArtificial Intelligence. _93407 |
650 | 2 | 4 |
_aSoftware Engineering. _94138 |
650 | 2 | 4 |
_aComputer Engineering and Networks. _9100817 |
650 | 2 | 4 |
_aComputer Science Logic and Foundations of Programming. _942203 |
650 | 2 | 4 |
_aFormal Languages and Automata Theory. _9100819 |
700 | 1 |
_aKonev, Boris. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9100820 |
|
700 | 1 |
_aReger, Giles. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9100822 |
|
710 | 2 |
_aSpringerLink (Online service) _9100825 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783030862046 |
776 | 0 | 8 |
_iPrinted edition: _z9783030862060 |
830 | 0 |
_aLecture Notes in Artificial Intelligence, _x2945-9141 ; _v12941 _9100826 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-030-86205-3 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c87874 _d87874 |