Counting Minimal Unsatisfiable Subsets
10.1007/978-3-030-81688-9_15
Saved in:
Main Authors: | Bendík, J., Meel, Kuldeep S. |
---|---|
Other Authors: | DEPARTMENT OF COMPUTER SCIENCE |
Format: | Conference or Workshop Item |
Published: |
Springer Science and Business Media Deutschland GmbH
2022
|
Online Access: | https://scholarbank.nus.edu.sg/handle/10635/233330 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Mining patterns of unsatisfiable constraints to detect infeasible paths
by: DING, Sun, et al.
Published: (2015) -
Yablo’s Paradox in Second-Order Languages: Consistency and Unsatisfiability
by: LAVINIA MARIA PICOLLO
Published: (2021) -
Approximate Model Counting: Is SAT Oracle More Powerful Than NP Oracle?
by: Chakraborty, Diptarka, et al.
Published: (2023) -
Analysis of T Cell Subsets in Adult Primary/Idiopathic Minimal Change Disease: A Pilot Study
by: Salcido-Ochoa, F, et al.
Published: (2020) -
Subsets close to invariant subsets for group actions
by: Brailovsky, Leonid., et al.
Published: (2011)