Equivalence Between Systems Stronger Than Resolution-Reference-Cited by-同舟云学术

Equivalence Between Systems Stronger Than Resolution

Published:2020 Issue: Volume: Page:166-181
ISSN:0302-9743
Container-title:Theory and Applications of Satisfiability Testing – SAT 2020
language:
Short-container-title:

Author:

Bonet Maria Luisa^ORCID,Levy Jordi^ORCID

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-51825-7_13

Reference15 articles.

1. Lecture Notes in Computer Science;A Atserias,2019

2. Atserias, A., Müller, M.: Automating resolution is NP-hard. In: Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, pp. 498–509 (2019). https://doi.org/10.1109/FOCS.2019.00038

3. Bonet, M.L., Buss, S., Ignatiev, A., Marques-Silva, J., Morgado, A.: MaxSAT resolution with the dual rail encoding. In: Proceedings of the 32nd AAAI Conference on Artificial Intelligence, AAAI 2018, pp. 6565–6572 (2018)

4. Lecture Notes in Computer Science;ML Bonet,2006

5. Bonet, M.L., Pitassi, T., Raz, R.: On interpolation and automatization for Frege systems. SIAM J. Comput. 29(6), 1939–1967 (2000). https://doi.org/10.1137/S0097539798353230

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. MaxSAT resolution for regular propositional logic;International Journal of Approximate Reasoning;2023-11

2. Circular (Yet Sound) Proofs in Propositional Logic;ACM Transactions on Computational Logic;2023-04-07

3. MaxSAT Resolution and Subcube Sums;ACM Transactions on Computational Logic;2023-01-18

4. A Tableau Calculus for MaxSAT Based on Resolution;Frontiers in Artificial Intelligence and Applications;2022-10-17

5. On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02