scientific article; zbMATH DE number 1140675
From MaRDI portal
Publication:4385440
zbMath0945.03011MaRDI QIDQ4385440
Publication date: 8 October 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
constraint programmingdecomposition algorithmrule-based algorithmcombination of nondisjoint equational theoriessatisfiability of constraints
Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Classical propositional logic (03B05)
Related Items (6)
Strategies for combining decision procedures ⋮ Combining nonstably infinite theories ⋮ Partition-based logical reasoning for first-order and propositional theories ⋮ Unnamed Item ⋮ A New approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method ⋮ Unions of non-disjoint theories and combinations of satisfiability procedures
This page was built for publication:
