{"id":"119057be-5e6d-426c-995e-137c7553a2cb","arxiv_id":"2611.17235","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":6.0,"correctness_risk":"high","formal_verification":"none","parameter_count":2,"one_line_summary":"Al-Ghasali proves that closed Fiqh chapters collapse to deterministic finite state automata, enabling O(1) verdict extraction and hallucination-free LLM summarization via grammar-guided constrained decoding.","lead":"This paper presents Al-Ghasali, a computational framework that formalizes Islamic jurisprudential rulings (Fiqh) into deterministic finite state automata (FSA) and uses large language models (LLMs) for human-readable summaries under strict constraints. The framework claims to guarantee constant-time verdict extraction and mathematically eliminate LLM hallucination risks through grammar-guided constrained decoding.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek/deepseek-v4-flash","headline":"Lemma 1 is not proved as stated: Equation 3's preventer constraints make the Horn theory inconsistent, or classically entail H, in exactly the invalid states that should be excluded, so P|=H cannot define the accepting set without a nonmonotonic semantics the paper never specifies.","rationale":"The paper's central computational claim rests on Lemma 1: that the semantics of the defined Horn program collapse to a deterministic FSA with accepting set F={s | P|=H}. For that to be true, the preventer clauses of Equation 3 must have a semantics under which an active preventer makes H false rather than making the theory inconsistent. Classical Horn logic is monotonic and cannot deliver this. In the invalid state S∧I∧W, the definite clause derives H and the constraint forbids H∧W, so the theory has no classical model; consequently P|=H holds vacuously under the standard reading. Thus the accepting-set definition in Lemma 1 is not sound for the paper's own program. This is a more direct, internal objection than the Closed Chapter Assumption: it does not depend on whether any real Fiqh chapter is closed, and it cannot be resolved by more empirical evidence about jurisprudential ontology. The paper's Section 5.2 algorithm, which checks membership in M+, is a correct and simpler FSA construction, so the framework is likely repairable, but the formal theorem as stated is not. For this reason the appropriate adjustment is CONDITIONAL rather than unconditional rejection: the authors should either give an explicit nonmonotonic semantics for Equations 1-3 and reprove Lemma 1 under it, or drop the Horn-program characterization and define F directly as M+. Only after that repair, and ideally with a concrete instantiation of at least one closed chapter, can the O(1) and no-hallucination claims be evaluated as proven.","tokens_in":15207,"tokens_out":17385,"duration_ms":140406,"concrete_test":"Implement the Section 2.1 construction for the minimal preventer example with S=true, I=true, W=true and intended ruling H=false. In a standard first-order or Horn-logic prover, add the valuation facts and check whether P|=H under Lemma 1's definition. If the prover returns 'inconsistent' or 'entails H', then the F of Lemma 1 includes the invalid state and the claimed collapse fails. Alternatively, ask the authors to specify the intended nonmonotonic semantics and re-prove Lemma 1 under that semantics; if the only consistent reading is F=M+ direct lookup, then Equations 1-3 should be revised or the formal claim should be restated without the defective entailment relation.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The load-bearing flaw is in Lemma 1 (Section 2.2) as applied to the program defined in Section 2.1. Equation 3 encodes preventers as Horn integrity constraints of the form ←H∧W+. Under the classical entailment the lemma uses (P|=H), take a closed chapter with a valuation satisfying the condition S, the cause I, and a preventer W. The definite clause H←S∧I derives H, while the constraint requires ¬(H∧W); the theory is inconsistent. Classical entailment from an inconsistent theory is vacuous, so P|=H and P|=¬H both hold, and the state would be placed in F, exactly the wrong answer, since the truth table puts it in M−. Standard Horn-clause logic is monotonic and cannot express \"W prevents H\" by a negative clause. A nonmonotonic semantics, such as stable models, program completion, or default rules, is needed, but none is defined in the paper; the citations in [2,10,11] do not supply such a semantics. The later system description (Section 5.2) sidesteps this by checking membership in M+ directly, so the implemented lookup may be correct, but Lemma 1's claimed equivalence P|=H ⇔ q∈F is not established for the program as defined. This is independent of the Closed Chapter Assumption: even for a genuinely finite closed chapter, the lemma as stated does not prove what it claims.","agreement_with_reader":"disagree"},"referee_report":{"model":"deepseek/deepseek-v4-flash","summary":"The paper presents Al-Ghasali, a framework for simulating Islamic jurisprudential rulings using finite state automata and LLMs. It claims that closed Fiqh chapters can be collapsed to deterministic FSAs, enabling O(1) verdict extraction, and that the FSA-LLM architecture with constrained decoding guarantees absolute absence of hallucination.","tokens_in":15673,"tokens_out":1155,"duration_ms":12030,"significance":"If the claims hold, the framework could provide a computationally efficient and formally grounded tool for Islamic jurisprudence. The theoretical contributions include the finite-state collapse lemma and the safety conditions for LLM integration.","major_comments":[{"comment":"The proof of Lemma 1 relies on the equivalence P |= H ⇔ q ∈ F. However, the Horn program P defined in §2.1 includes integrity constraints (Eq. 3) of the form ← H ∧ W_j^+. Under classical entailment, if a valuation satisfies both S ∧ I_i (deriving H) and W_j^+, the theory becomes inconsistent, making P |= H and P |= ¬H both true vacuously. This would place the state in F incorrectly. The paper does not specify a nonmonotonic semantics to handle preventers. The later system description (§5.2) sidesteps this by checking membership in M+ directly, but Lemma 1 as stated is not established for the program as defined. This is a load-bearing issue for the central claim of finite-state collapse.","section":"§2.2, Lemma 1","authors_acknowledge":null,"authors_acknowledge_p":null},{"comment":"The proof of Theorem 1 relies on the grammar G_{Σ_h} being constructed such that terminal nodes representing Juristic Facts are strictly drawn from J(Σ_h). However, the mapping function f defined in §8.2 is described algorithmically but not formally verified. The claim that 'the LLM is physically incapable of outputting a false condition' depends on the correctness of the grammar generation and the constrained decoding mechanism. No empirical evaluation or formal verification of the implementation is provided. The theorem is a theoretical guarantee under idealized assumptions, not a proven property of any actual system.","section":"§8.3, Theorem 1","authors_acknowledge":null,"authors_acknowledge_p":null},{"comment":"The representation of preventers as Horn integrity constraints (← H ∧ W_j^+) is problematic. In standard Horn-clause logic, such constraints are not clauses; they are denials. The paper cites [2,10,11] for 'Horn integrity constraints', but these references do not provide a semantics that makes the program well-behaved under classical entailment. The paper should clarify the logical framework used (e.g., logic programming with negation as failure, or a different nonmonotonic formalism) and how Lemma 1 is intended to apply.","section":"§2.1, Eq. 3","authors_acknowledge":null,"authors_acknowledge_p":null},{"comment":"The paper acknowledges the Closed Chapter Assumption as foundational. However, the claim that 'a significant portion of the Fiqh corpus operates within these permanently closed conceptual bounds' is not supported by empirical evidence or citation. The assumption is theological/epistemological, not mathematical. While the paper is upfront about this, the practical applicability of the framework depends on the extent to which real Fiqh chapters satisfy this assumption. The paper would benefit from a discussion of how to identify closed chapters and what the consequences are if a chapter is not closed.","section":"§1, Closed Chapter Assumption","authors_acknowledge":null,"authors_acknowledge_p":null}],"minor_comments":[{"comment":"The paper contains several typographical errors and formatting issues (e.g., 'al sabr wa al Taqsim' vs 'al-sabr wa al-Taqsim', inconsistent use of italics). These should be corrected.","section":"General","authors_acknowledge":null,"authors_acknowledge_p":null},{"comment":"The proof of Lemma 1 states that 'P |= H under valuations' but does not define what it means for a Horn program with integrity constraints to entail H. The notation should be clarified.","section":"§2.2","authors_acknowledge":null,"authors_acknowledge_p":null},{"comment":"The example grammar for Tayammum ruling uses non-terminals like 'Connector1', 'Connector2', but the Bounded Neutral Lexicon is not explicitly listed. The paper should provide the full set of allowed connectors.","section":"§8.2","authors_acknowledge":null,"authors_acknowledge_p":null},{"comment":"Reference [1] is self-cited and described as 'to appear' or similar. The paper should clarify the status of this reference. If it is unpublished, the dependency on it should be noted.","section":"References","authors_acknowledge":null,"authors_acknowledge_p":null},{"comment":"The extraction of rulings (FSA Logic) is described as checking the current state against M+ array. This is a lookup, not the entailment-based evaluation claimed in Lemma 1. The paper should reconcile this discrepancy.","section":"§5.2","authors_acknowledge":null,"authors_acknowledge_p":null}],"recommendation":"major_revision"},"author_rebuttal":null,"desk_editor":{"model":"deepseek/deepseek-v4-flash","letter":"Read this one if you want a clear example of a domain-motivated architecture whose formal packaging overstates its actual content. The useful core is the design: compile truth-table rules into a deterministic automaton, flatten temporal requirements such as Tartib into boolean state variables, and then let the FSA constrain an LLM's text generation via a right-linear grammar and a whitelist of neutral connectors. The Tartib construction is the best part. It is simple, correct, and shows real understanding of how juristic order can be modeled as a condition or preventer rather than as memory. The hierarchical composition argument is fine as far as it goes. What is genuinely new is not the mathematics—finite propositional Horn theories are finite-state for standard reasons—but the domain mapping.\n\nThe stress-test note is right. Lemma 1 does not prove what it claims. Equation 3 encodes preventers as constraints of the form <-H∧W+. Under the classical entailment P|=H used in the lemma, any valuation with an active preventer makes the theory inconsistent, and classical entailment from an inconsistent theory is vacuous. So the equivalence P|=H iff s is in F is not established; the proof would need a nonmonotonic semantics, and none is specified. Interpreting those constraints as external integrity checks rather than clauses does not fix it, because then they are not part of the entailment relation the lemma reasons about. The system in Section 5.2 sidesteps this by checking M+ directly, which is operationally sensible, but that makes the formal claim in Lemma 1 largely decorative. This is a load-bearing issue, not a stylistic slip.\n\nTwo other soft spots, in proportion. First, there is no implementation, data, or evaluation. Saying the LLM endpoint was tested with GLM-4.6 without showing a single run means the hallucination claims remain a design argument. Theorem 1's \"absolute absence\" is conditional on an idealized constrained decoder, and its own Remark 1 already carves out linguistic artifacts; the Bounded Neutral Lexicon is clever but is not an empirical safety guarantee. Second, the O(1) extraction is a finite-lookup result; the offline table grows exponentially in the number of variables, which the sub-chapter decomposition mitigates but does not remove.\n\nThe paper is honest about the Closed Chapter Assumption and about its dependence on [1], so I would not call those hidden flaws. The dependency is real and worth checking, but it is acknowledged. Who gets value from this: people working on computational Islamic jurisprudence, and perhaps researchers designing constrained-decoding guardrails for domain-specific LLM use. I would not cite it in its current form, and I would bring it to a reading group only as a case study in formal overreach. Still, I would send it to a serious referee rather than desk-reject: a competent reviewer could push the author to either replace Lemma 1 with a correct nonmonotonic formulation or drop the entailment framing and present the table-lookup construction directly. The domain application is unusual enough to deserve one careful round.","headline":"A well-structured domain architecture whose formal claims are stronger than the proofs support; the finite-state lemma has a real semantic gap, and there is no implementation behind the LLM guarantees.","tokens_in":16149,"tokens_out":6820,"duration_ms":56861},"pith_extraction":null,"created_at":"2026-11-13T09:03:30.352693+00:00","model_set":{"reader":"deepseek/deepseek-v4-flash"},"pipeline_version":"pith-pipeline@v1.4.1-daily-deepseek-or-medium","input_kind":null,"input_chars":null,"input_total_chars":null,"passes_missing":null,"published_standing":null,"published_confidence":null,"objection_audit":null,"run_record":null,"basis":{"kind":"not_recorded","source":null,"chars_given":null,"chars_total":null},"receipt":null,"falsifier":null,"supporting_citations":[],"lane_accuracy":{"status":"not yet measured","lane":{"model":"deepseek/deepseek-v4-flash","input_kind":null},"url":"https://pith.science/accuracy"},"review_version":1}