(2026). On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories. Logical Methods in Computer Science.
Successfully copied to clipboard
Copying to clipboard failed
Chicago Style (17th ed.) Citation
"On Polynomial-Time Decidability of K-Negations Fragments of First-Order Theories."
Logical Methods in Computer Science 2026.
Successfully copied to clipboard
Copying to clipboard failed
MLA (9th ed.) Citation
"On Polynomial-Time Decidability of K-Negations Fragments of First-Order Theories."
Logical Methods in Computer Science, 2026.
Successfully copied to clipboard
Copying to clipboard failed
Warning: These citations may not always be 100% accurate.