A decomposition based algorithm for maximal contractions
From MaRDI portal
(Redirected from Publication:2418656)
Recommendations
- A general framework for computing maximal contractions
- Approximation algorithms via contraction decomposition
- scientific article; zbMATH DE number 6381654
- A representative model based algorithm for maximal contractions
- scientific article; zbMATH DE number 5846648
- On the parameterized complexity of maximum degree contraction problem
- On the Parameterized Complexity of Maximum Degree Contraction Problem.
- An approximate decomposition algorithm for convex minimization
- A Decomposition Method and Its Application to Convex Programming
- An algorithm approach to maximal monotone operators and pseudo-contractions
Cites work
- \textbf{R}-calculus without the cut rule
- A consistency-based approach for belief change
- A development calculus for specifications
- A general framework for computing maximal contractions
- A representative model based algorithm for maximal contractions
- An algorithm to compute maximal contractions for Horn clauses
- scientific article; zbMATH DE number 140406 (Why is no real title available?)
- scientific article; zbMATH DE number 4187148 (Why is no real title available?)
- Logical verification of scientific discovery
- On the logic of iterated belief revision
- On the logic of theory change: Partial meet contraction and revision functions
Cited in
(5)
This page was built for publication: A decomposition based algorithm for maximal contractions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2418656)
