{'fraction_non_alphanumeric': 0.010380622837370242, 'fraction_numerical': 0.0, 'mean_word_length': 5.382352941176471, '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}}
Achieving completeness in the verification of action theories by Bounded Model Checking in ASP

Temporal logics are well suited for reasoning about actions, as they allow for the specification of domain descriptions including temporal constraints as well as for the verification of temporal properties. The paper deals with verification of action theories defined in a temporal extension of answer set programming which combines ASP with a dynamic linear time temporal logic (DLTL). The paper proposes an approach to bounded model checking which exploits the Buchi automaton construction while searching for a counterexample, with the aim of achieving completeness. The paper provides an encoding in ASP of the temporal action domains and of Bounded Model Checking of DLTL formulas. The paper also deals with reasoning about epistemic knowledge and incomplete states.