Frontiers of Combining Systems  6th International Symposium, FroCoS 2007, Liverpool, UK, September 10-12, 2007. Proceedings /  [electronic resource] : 
edited by Boris Konev, Frank Wolter. 
 - 1st ed. 2007. 
 - X, 286 p.  online resource. 
 - Lecture Notes in Artificial Intelligence,  4720  2945-9141 ; .
 - Lecture Notes in Artificial Intelligence,  4720 .
<br/><br/>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. 
<br/><br/><label>ISBN: </label>9783540746218 
<br/><br/><label>Standard No.: </label>10.1007/978-3-540-74621-8  doi 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer science.<br/>Artificial intelligence.<br/>Machine theory.<br/>Computer programming.<br/>Software engineering.<br/>Theory of Computation.<br/>Artificial Intelligence.<br/>Formal Languages and Automata Theory.<br/>Programming Techniques.<br/>Software Engineering.
<br/><br/><label>LC Class. No.: </label>QA75.5-76.95 
<br/><br/><label>Dewey Class. No.: </label>004.0151