I am not a big fan of LLMs so I try them once in a while, asking to "implement blocked clause decomposition in Haskell." They can recite a paper (and several other papers, with references) almost verbatim, but they do not posess enough comprehension of what is going on in these papers. As time passes by, with each new LLM, the level of comprehension drops. Last time LLM tried to persuade me to write code instead of providing me with code.
-- Example usage:
let clause1 = Set.fromList [1, 2] -- represents (x1 ∨ x2)
let clause2 = Set.fromList [-1, 3] -- represents (¬x1 ∨ x3)
let formula = Set.fromList [clause1, clause2]
-- Decompose the formula
let (nonBlocked, blocked) = decompose formula
[1] https://arxiv.org/abs/2404.03502
I am not a big fan of LLMs so I try them once in a while, asking to "implement blocked clause decomposition in Haskell." They can recite a paper (and several other papers, with references) almost verbatim, but they do not posess enough comprehension of what is going on in these papers. As time passes by, with each new LLM, the level of comprehension drops. Last time LLM tried to persuade me to write code instead of providing me with code.