Mohamed Maizia

A Fine-Grained Complexity View on Propositional Abduction - Algorithms and Lower Bounds

The Boolean satisfiability problem (SAT) is a well-known example of monotonic reasoning, of intense practical interest due to fast solvers, complemented by rigorous fine-grained complexity results. However, for non-monotonic reasoning, e.g., abductive reasoning, comparably little is known outside cl