{'fraction_non_alphanumeric': 0.0125, 'fraction_numerical': 0.0, 'mean_word_length': 5.307086614173229, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Using Meta-inference with Prolog to Preserve Accuracy in Numerical Equation Solving

In this paper, we explore the powerful bidirectional interface between Prolog and C to build an equation solver that mixes infinite precision and numerical methods. Meta-inference rules in Prolog control the numerical process in C, so that exact methods of solution are used preferably to numerical approximations, leading to the preservation of as much significant digits as possible during the computations. On the other hand, the possibility to access numerical resources when symbolic treatment fails allowed us to handle a much wider range of equations than with a purely symbolic system. Another advantage of this hybrid approach is the possibility of recording previous results to aid in future computations.