scientific article; zbMATH DE number 1140675

MaRDI QIDQ4385440zbMATH OpenFDO

Authors Christophe Ringeissen

Publication date 8 October 2000

zbMATH Keywords

combination of nondisjoint equational theoriesconstraint programmingdecomposition algorithmrule-based algorithmsatisfiability of constraints

Mathematics Subject Classification ID

Classical propositional logic (03B05) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Unions of non-disjoint theories and combinations of satisfiability procedures
• Theory combination: beyond equality sharing
• Model-theoretic methods in combined constraint satisfiability
• scientific article; zbMATH DE number 3898849
• Satisfiability modulo theories and assignments

Cited in

(8)

• Unions of non-disjoint theories and combinations of satisfiability procedures
• Strategies for combining decision procedures
• Satisfiability modulo theories and assignments
• Partition-based logical reasoning for first-order and propositional theories
• Tractable combinations of temporal CSPs
• A New approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method
• DNN verification, reachability, and the exponential function problem
• Combining nonstably infinite theories

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385440)