J.Acad.(N.Y.)4,2:52-87 2014 (36 pages) Abdelwahab et al. 1 Copyright © 2016 Journal Academica Foundation. All rights reserved. With perpetual, non-exclusive license to distribute for arxiv.org Originally received December 12 2013 - accepted May 7 2014 - published May 16 2014 J.Acad.(N.Y.)4,2:52-87 (36 pages) - Theoretical Computer Science - permalink: http://journalacademica.org/?smd_process_download=1&download_id=753 The Algorithm of Islamic Jurisprudence (Fiqh) with Validation of an Entscheidungsproblem Elnaserledinellah Mahmood Abdelwahab a*, Karim Daghbouche a, b Nadra Ahmad Shannan a makmad.org e.V., Hanover (Germany) b Faculty of Shariah, Umm Al-Qura University, Makkah (Kingdom of Saudi Arabia) Corresponding author:
[email protected] ABSTRACT The historic background of algorithmic processing with regard to etymology and methodology is translated into terms of mathematical logic and Computer Science. A formal logic structure is introduced by exemplary questions posed to Fiqh-chapters to define a logic query language. As a foundation, a generic algorithm for deciding Fiqh- rulings is designed to enable and further leverage rule of law (vs. rule by law) with full transparency and complete algorithmic coverage of Islamic law eventually providing legal security, legal equality, and full legal accountability. This is implemented by disentangling and reinstating classic Fiqh-methodology (usul al-Fiqh) with the expressive power of subsets of First Order Logic (FOL) sustainably substituting ad hoc reasoning with falsifiable rational argumentation. The results are discussed in formal terms of completeness, decidability and complexity of formal Fiqh-systems. An Entscheidungsproblem for formal Fiqh-Systems is formulated and validated. Keywords: algorithm, Khwarizmi, Islam, balance, algebra, Shariah, Islamic law, jurisprudence, logic, syntax, semantics, Entscheidungsproblem, complexity, decidability, SAT-problem, transparency, security, accountability, rule of law, rule by law, Fiqh, usul al-Fiqh 1.