Cantitate/Preț
Produs

Frontiers of Combining Systems: 6th International Symposium, FroCoS 2007, Liverpool, UK, September 10-12, 2007. Proceedings: Lecture Notes in Computer Science, cartea 4720

Editat de Boris Konev, Frank Wolter
en Limba Engleză Paperback – 23 aug 2007

Din seria Lecture Notes in Computer Science

Preț: 33340 lei

Preț vechi: 41675 lei
-20% Nou

Puncte Express: 500

Preț estimativ în valută:
6380 6621$ 5333£

Carte tipărită la comandă

Livrare economică 15-29 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540746201
ISBN-10: 354074620X
Pagini: 296
Ilustrații: X, 286 p.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.45 kg
Ediția:2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.