000 | 03306nam a22005895i 4500 | ||
---|---|---|---|
001 | 978-3-540-74621-8 | ||
003 | DE-He213 | ||
005 | 20240423125802.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2007 gw | s |||| 0|eng d | ||
020 |
_a9783540746218 _9978-3-540-74621-8 |
||
024 | 7 |
_a10.1007/978-3-540-74621-8 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aFrontiers of Combining Systems _h[electronic resource] : _b6th International Symposium, FroCoS 2007, Liverpool, UK, September 10-12, 2007. Proceedings / _cedited by Boris Konev, Frank Wolter. |
250 | _a1st ed. 2007. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2007. |
|
300 |
_aX, 286 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 Artificial Intelligence, _x2945-9141 ; _v4720 |
|
505 | 0 | _aSection 1. Invited Contributions -- Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL -- From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain -- Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extensions -- Temporalising Logics: Fifteen Years After -- Section 2. Technical Papers -- Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs -- A Compressing Translation from Propositional Resolution to Natural Deduction -- Combining Algorithms for Deciding Knowledge in Security Protocols -- Combining Classical and Intuitionistic Implications -- Towards an Automatic Analysis of Web Service Security -- Certification of Automated Termination Proofs -- Temporal Logic with Capacity Constraints -- Idempotent Transductions for Modal Logics -- A Temporal Logic of Robustness -- Noetherianity and Combination Problems -- Languages Modulo Normalization -- Combining Proof-Producing Decision Procedures -- Visibly Pushdown Languages and Term Rewriting -- Proving Termination Using Recursive Path Orders and SAT Solving. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aArtificial intelligence. | |
650 | 0 | _aMachine theory. | |
650 | 0 | _aComputer programming. | |
650 | 0 | _aSoftware engineering. | |
650 | 1 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aArtificial Intelligence. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
650 | 2 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aSoftware Engineering. |
700 | 1 |
_aKonev, Boris. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aWolter, Frank. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540746201 |
776 | 0 | 8 |
_iPrinted edition: _z9783540843214 |
830 | 0 |
_aLecture Notes in Artificial Intelligence, _x2945-9141 ; _v4720 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-540-74621-8 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c181677 _d181677 |