A decomposition based algorithm for maximal contractions
From MaRDI portal
Publication:2418656
DOI10.1007/S11704-013-3089-ZzbMATH Open1425.68393OpenAlexW2039120963MaRDI QIDQ2418656FDOQ2418656
Zhengzhong Liao, Jie Luo, Yihua Lou, Dongchen Jiang, Wei Li
Publication date: 28 May 2019
Published in: Frontiers of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11704-013-3089-z
Recommendations
- A general framework for computing maximal contractions
- Approximation algorithms via contraction decomposition
- scientific article
- A representative model based algorithm for maximal contractions
- scientific article
- 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
- On the logic of theory change: Partial meet contraction and revision functions
- On the logic of iterated belief revision
- \textbf{R}-calculus without the cut rule
- An algorithm to compute maximal contractions for Horn clauses
- A consistency-based approach for belief change
- Title not available (Why is that?)
- Title not available (Why is that?)
- A development calculus for specifications
- Logical verification of scientific discovery
- A general framework for computing maximal contractions
- A representative model based algorithm for maximal contractions
Cited In (4)
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)
