## Frontiers of Combining Systems: 4th International Workshop, FroCoS 2002, Santa Margherita Ligure, Italy, April 8-10, 2002. Proceedings, Volume 4This volume contains the proceedings of FroCoS 2002, the 4th International Workshop on Frontiers of Combining Systems, held April 8-10, 2002 in Santa Margherita Ligure (near Genova), Italy. Like its predecessors, organized in - nich (1996), Amsterdam (1998), and Nancy (2000), FroCoS 2002 o?ered a c- mon forum for the presentation and discussion of research activities on the c- bination and integration of systems in various areas of computer science, such as logic, computation, program development and proof, arti?cial intelligence, mechanical veri?cation, and symbolic computation. There were 35 submissions of high quality, authored by researchers from countries including Australia, Belgium, Brazil, Finland, France, Germany, Italy, Portugal, Spain, Singapore, United Kingdom, United States of America, and - goslavia. All the submissions were thoroughly evaluated on the basis of at least three referee reports, and an electronic program committee meeting was held through the Internet. The program committee selected 14 research contributions. The topics covered by the selected papers include: combination of logics, c- bination of constraint solving techniques, combination of decision procedures, combination problems in veri?cation, modular properties of theorem proving, integration of decision procedures and other solving processes into constraint programming and deduction systems. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Foundations of a ConstraintBased Illustrator | 1 |

Integrating HolCaslinto the Development Graph Manager MAYA | 2 |

Monads and Modularity | 18 |

A Modular Approach to Proving Confluence | 33 |

Integrating BDDBased and SATBased Symbolic Model Checking | 49 |

Heuristics for Efficient Manipulation of Composite Constraints | 57 |

ConstraintBased Model Checking for Parameterized Synchronous Systems | 72 |

A Rewrite Rule Based Framework for Combining Decision Procedures | 87 |

Combining Relational Algebra SQL and Constraint Programming | 147 |

Computational Complexity of Propositional Linear Temporal Logics Based on Qualitative Spatial or Temporal Reasoning | 162 |

Exploiting Constraints for Domain Managing in CLPFD | 177 |

Reasoning with about and for Constraint Handling Rules | 193 |

PROSPER An Investigation into Software Architecture for Embedded Proof Engines | 193 |

ConstraintLambda Calculi | 207 |

Labelled Deduction over Algebras of TruthValues | 222 |

A Temporal Modal Approachto the Definability of Properties of Functions | 239 |

Combining Sets with Integers | 103 |

Solving Nonlinear Equations by Abstraction Gaussian Elimination and Interval Methods | 117 |

A Generalization of Shostaks Method for Combining Decision Procedures | 132 |

### Other editions - View all

Frontiers of Combining Systems: 4th International Workshop, FroCoS ..., Volume 4 Alessandro Armando No preview available - 2002 |

### Common terms and phrases

abstract algebra algorithm applied arithmetic axioms BDDs boolean box consistency canonical form Casl combination composite atom composite formula Computer Science confluent consider constraint programming constraint satisfaction problem constraint solver constraint-lambda calculus constraint-lambda term constructors coproduct decision procedure deﬁned Deﬁnition denotational semantics denote development graph disjunctive domain efficient elements equations equivalence equivalence relation example finite formal framework FroCoS function given global implemented integers interval labelled lambda calculus lambda term language layers Lecture Notes Lemma linear linear temporal logic LNAI Maya modal model checking modular monad node NP-Alg NuSMV obtained operations parameterized Presburger arithmetic problem Proc proof engine properties propositional prove reachability reasoning reduction relation restricted constraint-lambda rewrite rules satisﬁable Section semantics Shostak’s signature solution specification Springer-Verlag structure subset check subterm symbolic model symbolic representations theorem prover theory tool truth-value tuple uninterpreted ur-elements variables verification