A comprehensive combination framework
From MaRDI portal
Publication:5277797
DOI10.1145/1342991.1342992zbMath1407.03011OpenAlexW2168177042MaRDI QIDQ5277797
Enrica Nicolini, Silvio Ghilardi, Daniele Zucchelli
Publication date: 12 July 2017
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1342991.1342992
modal logichigher-order logicdescription logiccombinationdecision proceduressatisfiability modulo theory
Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35)
Related Items (9)
Conflict-driven satisfiability for theory combination: lemmas, modules, and proofs ⋮ Modular Termination and Combinability for Superposition Modulo Counter Arithmetic ⋮ Satisfiability Modulo Theories ⋮ Combinable Extensions of Abelian Groups ⋮ Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates ⋮ Satisfiability Procedures for Combination of Theories Sharing Integer Offsets ⋮ Model completeness, covers and superposition ⋮ Data Structures with Arithmetic Constraints: A Non-disjoint Combination ⋮ Combination of convex theories: modularity, deduction completeness, and explanation
This page was built for publication: A comprehensive combination framework
