Frontiers of Combining Systems 6th International Symposium, FroCoS 2007, Liverpool, UK, September 10-12, 2007. Proceedings /
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 .
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.
9783540746218
10.1007/978-3-540-74621-8 doi
Computer science.
Artificial intelligence.
Machine theory.
Computer programming.
Software engineering.
Theory of Computation.
Artificial Intelligence.
Formal Languages and Automata Theory.
Programming Techniques.
Software Engineering.
QA75.5-76.95
004.0151
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.
9783540746218
10.1007/978-3-540-74621-8 doi
Computer science.
Artificial intelligence.
Machine theory.
Computer programming.
Software engineering.
Theory of Computation.
Artificial Intelligence.
Formal Languages and Automata Theory.
Programming Techniques.
Software Engineering.
QA75.5-76.95
004.0151