A Gentle Non-disjoint Combination of Satisfiability Procedures

DOI10.1007/978-3-319-08587-6_9zbMath1423.68441OpenAlexW2210320991MaRDI QIDQ3192185

Christophe Ringeissen, Pascal Fontaine, Paula Chocron

Publication date: 26 September 2014

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08587-6_9

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combined logics (03B62)

Related Items (6)

A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited ⋮ Spectra and satisfiability for logics with successor and a unary function ⋮ A Rewriting Approach to the Combination of Data Structures with Bridging Theories ⋮ Many-sorted equivalence of shiny and strongly polite theories ⋮ Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates ⋮ Politeness and combination methods for theories with bridging functions

This page was built for publication: A Gentle Non-disjoint Combination of Satisfiability Procedures