Tractable combinations of theories via sampling

DOI10.1007/978-3-030-75775-5_10OpenAlexW3165573590MaRDI QIDQ2055788

Johannes Greiner, Manuel Bodirsky

Publication date: 1 December 2021

Full work available at URL: https://arxiv.org/abs/2012.01199

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (2)

Unnamed Item ⋮ Tractable combinations of theories via sampling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal k-consistency algorithm
• Complexity, convexity and combinations of theories
• Constraints, consistency and closure
• Unions of non-disjoint theories and combinations of satisfiability procedures
• Tractable combinations of theories via sampling
• Constraint satisfaction tractability from semi-lattice operations on infinite sets
• Constraint Satisfaction with Countable Homogeneous Templates
• Non-dichotomies in Constraint Satisfaction Complexity
• Simplification by Cooperating Decision Procedures
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• On minimal n-universal graphs
• The Max-Atom Problem and Its Relevance

This page was built for publication: Tractable combinations of theories via sampling