Info
Frontiers of combining systems : 6th international symposium, frocos 2007, liverpool, uk, september 10-12, 2007. Proceedings / / edited by Boris Konev, Frank Wolter
| Frontiers of combining systems : 6th international symposium, frocos 2007, liverpool, uk, september 10-12, 2007. Proceedings / / edited by Boris Konev, Frank Wolter |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Germany ; ; New York, United States : , : Springer, , [2007] |
| Descrizione fisica | 1 online resource (X, 286 p.) |
| Disciplina | 511.3 |
| Collana | Lecture notes in computer science. Lecture notes in artificial intelligence ; 4720 |
| Soggetto topico |
Computer science
Logic, Symbolic and mathematical |
| ISBN | 3-540-74621-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Section 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. |
| Altri titoli varianti | FroCos 2007 |
| Record Nr. | UNINA-9910483346103321 |
| Berlin, Germany ; ; New York, United States : , : Springer, , [2007] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Frontiers of combining systems : 6th international symposium, frocos 2007, liverpool, uk, september 10-12, 2007. Proceedings / / edited by Boris Konev, Frank Wolter
| Frontiers of combining systems : 6th international symposium, frocos 2007, liverpool, uk, september 10-12, 2007. Proceedings / / edited by Boris Konev, Frank Wolter |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Germany ; ; New York, United States : , : Springer, , [2007] |
| Descrizione fisica | 1 online resource (X, 286 p.) |
| Disciplina | 511.3 |
| Collana | Lecture notes in computer science. Lecture notes in artificial intelligence ; 4720 |
| Soggetto topico |
Computer science
Logic, Symbolic and mathematical |
| ISBN | 3-540-74621-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Section 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. |
| Altri titoli varianti | FroCos 2007 |
| Record Nr. | UNISA-996465926103316 |
| Berlin, Germany ; ; New York, United States : , : Springer, , [2007] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||