The Complexity of Minimal Inference Problem for Conservative Constraint Languages. Proceedings of the Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).
Tytuł:
The Complexity of Minimal Inference Problem for Conservative Constraint Languages. Proceedings of the Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).
Konferencja:
IEEE Symposium on Logic in Computer Science [LICS]
Rok:
2017
Opis:
Proceedings of the Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2017)