Document is current

Any future updates will be listed below

The complexities of the satisfiability checking problems of feature diagram sublanguages

Crossref DOI link: https://doi.org/10.1007/s10270-022-01048-3

Published Online: 2022-10-11

Published Print: 2023-08

Update policy: https://doi.org/10.1007/springer_crossmark_policy

About CrossMark