Artificial intelligence By Ren
Make sense of what AI is becoming.
The research, products, policy, and people changing artificial intelligence — explained clearly, with sources you can follow.
Explore the coverage
Find a story by topic or search the full archive.
Conflict-Driven SAT Solving with XOR‑OR‑AND Normal Forms
Xorricane solves XOR‑heavy SAT instances with XNF and XLIN
Read storyEU Sets August 27 Deadline for General‑Purpose AI Models
The European Commission will require providers of general‑purpose AI models to notify regulators by Aug 27 2026.
Read storyReview Maps 257 Text‑Generation Papers Across Five Tasks
A new systematic review catalogs 257 text‑generation studies covering five core tasks and highlights persistent challenges such as bias, hallucinations, and evaluation subjectivity.
Read storyFairness Audit Method Uses Only Population Statistics
Researchers propose a way to lower‑bound classifier unfairness without accessing individual predictions or model internals.
Read storyNew SAT Solver Targets Cryptographic Constraints
Researchers unveil Xorricane, a SAT solver using XOR‑OR‑AND normal forms that improves efficiency on cryptographic problems.
Read storyNew Fairness Auditing Method Uses Only Aggregate Data
Researchers propose a way to estimate the worst-case bias of black-box classifiers without accessing individual predictions.
Read storyAI Review Catalogues 257 Papers on Text Generation Tasks
The JAIR review covers 257 papers on five core text‑generation tasks and identifies nine recurring challenges including bias and hallucinations.
Read storyNew JAIR Papers Cover Fairness Auditing, SAT Solving, Argumentation Quality
JAIR released three papers covering fairness auditing with population statistics, XOR-based SAT solving, and neuro‑symbolic argument quality assessment.
Read storyNeuro‑Symbolic Models Face New “Reasoning Shortcut” Threat
A recent JAIR paper warns that neuro‑symbolic systems can misground concepts, undermining trust.
Read storyComplexité des bornes de complexité clarifient la réponse aux requêtes à chemins avec règles existentielles gardées
Les chercheurs montrent que répondre à des requêtes régulières à deux sens sous règles linéaires ou gardées a une complexité en données NL‑complète mais peut atteindre 2ExpTime en scénario combiné, ce qui influence les applications de graphe de connaissances biomédicales.
Read storyDyMAB Improves Multi‑Agent Pathfinding via Adaptive Bandits
Researchers introduce DyMAB, a dynamic multi‑armed bandit algorithm that enhances ALNS-based MAPF solvers by adapting neighborhood selection over time.
Read storyNew Complexity Bounds for Ontology‑Mediated Path Queries
Researchers show linear existential rules keep path query answering in NL data complexity while guarded rules push it to 2ExpTime combined complexity.
Read story