000 | 03243nam a22003855i 4500 | ||
---|---|---|---|
001 | 297593 | ||
003 | MX-SnUAN | ||
005 | 20170705134240.0 | ||
007 | cr nn 008mamaa | ||
008 | 150903s2007 gw | o |||| 0|eng d | ||
020 |
_a9783540746218 _99783540746218 |
||
024 | 7 |
_a10.1007/9783540746218 _2doi |
|
035 | _avtls000350899 | ||
039 | 9 |
_a201509030420 _bVLOAD _c201405060242 _dVLOAD _y201402171108 _zstaff |
|
040 |
_aMX-SnUAN _bspa _cMX-SnUAN _erda |
||
050 | 4 | _aQ334-342 | |
100 | 1 |
_aKonev, Boris. _eeditor. _9331891 |
|
245 | 1 | 0 |
_aFrontiers of Combining Systems : _b6th International Symposium, FroCoS 2007 Liverpool, UK, September 10-12, 2007 Proceedings / _cedited by Boris Konev, Frank Wolter. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2007. |
|
300 |
_ax, 283 páginas Also available online. _brecurso en línea. |
||
336 |
_atexto _btxt _2rdacontent |
||
337 |
_acomputadora _bc _2rdamedia |
||
338 |
_arecurso en línea _bcr _2rdacarrier |
||
347 |
_aarchivo de texto _bPDF _2rda |
||
490 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v4720 |
|
500 | _aSpringer eBooks | ||
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. | |
520 | _aThis book constitutes the refereed proceedings of the 6th International Symposium on Frontiers of Combining Systems, FroCoS 2007, held in Liverpool, UK, September 10-12, 2007. The 14 revised full papers presented were carefully reviewed and selected. The papers are organized in topical sections on combinations of logics, theories, and decision procedures; constraint solving and programming; combination issues in rewriting and programming as well as in logical frameworks and theorem proving systems. | ||
590 | _aPara consulta fuera de la UANL se requiere clave de acceso remoto. | ||
700 | 1 |
_aWolter, Frank. _eeditor. _9333431 |
|
710 | 2 |
_aSpringerLink (Servicio en línea) _9299170 |
|
776 | 0 | 8 |
_iEdición impresa: _z9783540746201 |
856 | 4 | 0 |
_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-540-74621-8 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL) |
942 | _c14 | ||
999 |
_c297593 _d297593 |