This paper continues the power ordering approach to verisimilitude. We define a parameterized verisimilar ordering of theories in the finite propositional case, both semantically and syntactically. The syntactic definition leads to an algorithm for computing verisimilitude. Since the power ordering approach to verisimilitude can be translated into a standard notion of belief revision, the algorithm thereby also allows the computation of membership of a belief-revised theory.
"Computing Verisimilitude." Notre Dame J. Formal Logic 36 (1) 30 - 43, Winter 1995. https://doi.org/10.1305/ndjfl/1040308827