{'fraction_non_alphanumeric': 0.015580736543909348, 'fraction_numerical': 0.0, 'mean_word_length': 5.36936936936937, '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}}
Modelling Assembly Line Balancing Problem in Answer Set Programming

Answer set programming (ASP) is a new programming language paradigm combining the declarative aspect with non-monotonic reasoning. In this paper, we will investigate and evaluate an application of Simple Assembly Line Balancing Problem in Answer Set Programming. The problem is a highly combinatorial and is generally solved by specific programs. We present an approach to solve the simple assembly line balancing problem in Answer Set Programming and compare them with the standard ones. It turns out that, although Answer Set Programming greatly simplifies the problem statement. It is comparable in efficiency to specialized programs.