Frontiers of Combining Systems
Subtitle: Third International Workshop, FroCoS 2000 Nancy, France, March 22-24, 2000 Proceedings (Lecture Notes in Computer Science)
Contributors: Helene Kirchner (Editor); Christophe Ringeissen (Editor)
Edition: 1 edition
Publisher: Springer
Published: April 13, 2000
Language: eng
Format: Paperback
Number of pages: 291
ISBN-13: 9783540672814
Subjects: Mathematical logic; Science/Mathematics; Congresses; Computer Logic; Mathematical And Symbolic Logic; Computers; Computers - General Information; Logic, Symbolic and mathematical; Logic; Artificial Intelligence - General; AI logics; Automated deduction; Computers / Artificial Intelligence; constraint solving; declarative programming; mathematical logics; Computer Science; Logic, Symbolic and mathematic
First sentence: Cutting planes were introduced in a seminal paper of Gomory (1958) in order to solve linear optimization problems over the integer numbers.
Description: Frontiers of Combining Systems: Third International Workshop, FroCoS 2000, Nancy, France, March 22-24, 2000. Proceedings<br />Author: Hélène Kirchner, Christophe Ringeissen<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-67281-4<br /> DOI: 10.1007/10720084<br /><br />Table of Contents:<p></p><ul><li>Combining Logic and Optimization in Cutting Plane Theory
</li><li>Towards Cooperative Interval Narrowing
</li><li>Integrating Constraint Solving into Proof Planning
</li><li>Termination of Constraint Contextual Rewriting
</li><li>Axioms vs. Rewrite Rules: From Completeness to Cut Elimination
</li><li>Normal Forms and Proofs in Combined Modal and Temporal Logics
</li><li>Structured Sequent Calculi for Combining Intuitionistic and Classical First-Order Logic
</li><li>Handling Differential Equations with Constraints for Decision Support
</li><li>Non-trivial Symbolic Computations in Proof Planning
</li><li>Integrating Computer Algebra and Reasoning through the Type System of Aldor
</li><li>Combinations of Model Checking and Theorem Proving
</li><li>Compiling Multi-paradigm Declarative Programs into Prolog
</li><li>Modular Redundancy for Theorem Proving
</li><li>Composing and Controlling Search in Reasoning Theories Using Mappings
</li><li>Why Combined Decision Problems Are Often Intractable
</li><li>Congruence Closure Modulo Associativity and Commutativity
</li><li>Combining Equational Theories Sharing Non-Collapse-Free Constructors
</li><li>Comparing Expressiveness of Set Constructor Symbols</li></ul>