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 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.
Author(s): Sava Krstić, Amit Goel (auth.), Boris Konev, Frank Wolter (eds.)
Series: Lecture Notes in Computer Science 4720 : Lecture Notes in Artificial Intelligence
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2007
Language: English
Pages: 286
Tags: Artificial Intelligence (incl. Robotics); Mathematical Logic and Formal Languages; Programming Techniques; Software Engineering
Front Matter....Pages -
Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL....Pages 1-27
From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain....Pages 28-46
Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extensions....Pages 47-71
Temporalising Logics: Fifteen Years After....Pages 72-72
Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs....Pages 73-87
A Compressing Translation from Propositional Resolution to Natural Deduction....Pages 88-102
Combining Algorithms for Deciding Knowledge in Security Protocols....Pages 103-117
Combining Classical and Intuitionistic Implications....Pages 118-132
Towards an Automatic Analysis of Web Service Security....Pages 133-147
Certification of Automated Termination Proofs....Pages 148-162
Temporal Logic with Capacity Constraints....Pages 163-177
Idempotent Transductions for Modal Logics....Pages 178-192
A Temporal Logic of Robustness....Pages 193-205
Noetherianity and Combination Problems....Pages 206-220
Languages Modulo Normalization....Pages 221-236
Combining Proof-Producing Decision Procedures....Pages 237-251
Visibly Pushdown Languages and Term Rewriting....Pages 252-266
Proving Termination Using Recursive Path Orders and SAT Solving....Pages 267-282
Back Matter....Pages -