Frontiers of Combining Systems
6th International Symposium, FroCoS 2007, Liverpool, UK, September 10-12, 2007. Proceedings
Published on 23. August 2007
Book
Paperback/Softback
X, 286 pages
978-3-540-74620-1 (ISBN)
Description
This book constitutes the refereed proceedings of the 6th International Symposium on Frontiers of Combining Systems, FroCoS 2007, held in Liverpool, UK, September 2007. The 14 revised full papers presented were carefully selected and 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.
More details
Series
Edition
2007 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
X, 286 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 17 mm
Weight
452 gr
ISBN-13
978-3-540-74620-1 (9783540746201)
DOI
10.1007/978-3-540-74621-8
Schweitzer Classification
Content
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.