The logical basis for computer programming. Volume 1: deductive reasoning
The logical basis for computer programming. Volume 1: deductive reasoning
Constraint programming languages: their specification and generation
Constraint programming languages: their specification and generation
Constraint satisfaction from a deductive viewpoint (Research Note)
Artificial Intelligence
TEAM: a support environment for testing, evaluation, and analysis
SDE 3 Proceedings of the third ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
Journal of Symbolic Computation
Unification in a combination of arbitrary disjoint equational theories
Journal of Symbolic Computation
Constraint logic programming languages
Communications of the ACM
The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the SUP-INF Method for Proving Presburger Formulas
Journal of the ACM (JACM)
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Deciding Combinations of Theories
Proceedings of the 6th Conference on Automated Deduction
Methods and Applications of Interval Analysis (SIAM Studies in Applied and Numerical Mathematics) (Siam Studies in Applied Mathematics, 2.)
| Hi-index | 0.00 |
Constraint satisfaction systems are usually designed to work within a single-theory. This paper presents an approach to multi-theory constraint satisfaction characterized by cooperation among a variety of single-theory specialists. The system consists of three main components: a blackboard, a controlling Refine procedure, and a set of specialists. Two essential techniques used in our system are item propagation and case splitting. Potential applications of this system include software testing and analysis tools.