Frontiers of Combining Systems: 6th International Symposium, FroCoS 2007, Liverpool, UK, September 10-12, 2007. Proceedings / Edition 1

Frontiers of Combining Systems: 6th International Symposium, FroCoS 2007, Liverpool, UK, September 10-12, 2007. Proceedings / Edition 1

ISBN-10:
354074620X
ISBN-13:
9783540746201
Pub. Date:
10/03/2007
Publisher:
Springer Berlin Heidelberg
ISBN-10:
354074620X
ISBN-13:
9783540746201
Pub. Date:
10/03/2007
Publisher:
Springer Berlin Heidelberg
Frontiers of Combining Systems: 6th International Symposium, FroCoS 2007, Liverpool, UK, September 10-12, 2007. Proceedings / Edition 1

Frontiers of Combining Systems: 6th International Symposium, FroCoS 2007, Liverpool, UK, September 10-12, 2007. Proceedings / Edition 1

Paperback

$54.99
Current price is , Original price is $54.99. You
$54.99 
  • SHIP THIS ITEM
    In stock. Ships in 1-2 days.
  • PICK UP IN STORE

    Your local store may have stock of this item.


Overview

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.


Product Details

ISBN-13: 9783540746201
Publisher: Springer Berlin Heidelberg
Publication date: 10/03/2007
Series: Lecture Notes in Computer Science , #4720
Edition description: 2007
Pages: 286
Product dimensions: 6.10(w) x 9.30(h) x 0.70(d)

Table of Contents

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 Prools.- 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.
From the B&N Reads Blog

Customer Reviews