Satisfiability on mixed instances
type: Item
instance of: scholarly article
zbMATH Open document ID: 1334.68093
DOI: 10.1145/2840728.2840768
author: Ruiwen Chen
author: Rahul Santhanam
published in: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science
publication date: 2016-04-15T00:00:00Z
full work available at URL: TR15 192.pdf
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 94C10
zbMATH DE Number: 6569717
zbMATH Keywords: Boolean satisfiability algorithm
zbMATH Keywords: mixed instance
zbMATH Keywords: quantified Boolean formula
MaRDI profile type: Publication
OpenAlex ID: W2296658079
Recommended article: Satisfiability of mixed Horn formulas
Recommended article: Satisfiability in multi-valued circuits
Recommended article: Satisfiability in MultiValued Circuits
Recommended article: Q4369485
Recommended article: Solving mixed and conditional constraint satisfaction problems
Recommended article: Combined Satisfiability Modulo Parametric Theories
Recommended article: A constructive investigation of satisfiability
Recommended article: Satisfiability modulo theories and assignments
Recommended article: Q4992507
Recommended article: Satisfiability Procedures for Combination of Theories Sharing Integer Offsets
title: Satisfiability on mixed instances
description: scientific article; zbMATH DE number 6569717