Latest Research in Logic in Computer Science

Top Research Topics in Logic in Computer Science

• Data Structures and Algorithms — 8 papers
• Logic in Computer Science — 5 papers
• Logic, programming, and type systems — 4 papers
• Computability, Logic, AI Algorithms — 4 papers
• Complexity and Algorithms in Graphs — 2 papers
• Logic, Reasoning, and Knowledge — 2 papers
• Computational Complexity — 2 papers
• Logic — 2 papers
• Formal Languages and Automata Theory — 2 papers
• Constraint Satisfaction and Optimization — 1 papers

Highest-Cited Papers

1. An Exponential Value-Oracle Lower Bound for \({k}\)-Submodular Function Minimization
2. KNOCKING DOWN BOXES: THE FMP FOR K ⊕ ◻ m + k p → ◻ m p $\mathbf {K}\oplus \Box ^{m+k} p\to \Box ^m p$ bold upper K circled plus white medium square Superscript m plus k Baseline p right arrow white medium square Superscript m Baseline p
3. Genuinely Non-traditional Logics
4. Systematic Data Structure Lower Bounds via the Query-with-Sketch Model
5. Counting on Nowhere Dense Classes
6. Descriptive Complexity in Lean: Completeness by First-Order Reductions
7. A Theory of a Two-Dimensional Typed Lambda Calculus
8. Locality Causes Tractability? An Intervention Study on the Variable-Interaction Radius in Geometric Random Satisfiability (Compact Version)
9. Separating Non-redundancy and Chain Length
10. Bridging the Gap Between Plain VASS and Branching VASS
11. Constructive solvability and the P versus NP problem
12. A Formal Theory of Transputation Closure, Internal Adjudication, and Non-Algorithmic Continuation Selection
13. From NEMS to MFRR: { A Machine-Checked Bridge Between Semantic Closure and Reflexive Reality}
14. Degree-Parameterized Analysis of Sampling-Based Online Matching
15. Bipolar Turiyam Graph
16. Non-Relativizing Proofs Required for P vs NP Separation — E8 Intelligence Research
17. Non-Relativizing Proofs Required for P vs NP Separation — E8 Intelligence Research
18. A Non-constant Lower Bound for Grammar-Based Compression with Greedy
19. A Sharp Barrier for Consistent Submodular Maximization: Any Improvement over $2-\sqrt{2}$ Entails Exponential Queries or Linear Recourse
20. Non-elementary modal logics, assuming P $ eq$ NP