The Inverse Satisfiability Problem
From MaRDI portal
Publication:4210141
DOI10.1137/S0097539795285114zbMATH Open0917.68079OpenAlexW2034069868MaRDI QIDQ4210141FDOQ4210141
Martha Sideri, Dimitris J. Kavvadias
Publication date: 21 September 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539795285114
Recommendations
Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30) Parallel algorithms in computer science (68W10) Number-theoretic algorithms; complexity (11Y16)
Cited In (19)
- The complexity of minimal satisfiability problems
- Deciding quantifier-free definability in finite algebraic structures
- A Dichotomy Theorem for the Inverse Satisfiability Problem
- Title not available (Why is that?)
- Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem
- Generating all maximal models of a Boolean expression
- Inverse Unfold Problem and Its Heuristic Solving
- \textsc{Inverse Hamiltonian cycle} and inverse \textsc{3Dimensional matching} are coNP-complete
- Mathematical Foundations of Computer Science 2003
- Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete
- Computational Short Cuts in Infinite Domain Constraint Satisfaction
- Structure identification of Boolean relations and plain bases for co-clones
- An efficient algorithm for Horn description
- Isomorphic implication
- On the Boolean connectivity problem for Horn relations
- Title not available (Why is that?)
- The inequality-satisfiability problem
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?
- The Complexity of Satisfaction Problems in Reverse Mathematics
This page was built for publication: The Inverse Satisfiability Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210141)
