Italiano (Italian) English (Inglese)
domenica, 17 dicembre 2017

Rapporti Tecnici

Dettagli rapporto tecnico
Autori:Laura Giordano
Alberto Martelli
Daniele Theseider Dupré
Area Scientifica:Knowledge Representation
Logic-Based Reasoning
Temporal Reasoning
Titolo:Achieving completeness in bounded model checking of action theories in ASP
Apparso su:TR-INF-2011-12-04-UNIPMN
Editore:Computer Science Department, UPO
Sommario: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 of the domain. In this paper, we exploit bounded model checking (BMC) techniques in the verification of dynamic linear time temporal logic (DLTL) properties of an action theory, which is formulated in a temporal extension of answer set programming (ASP). To achieve completeness, in this paper, we propose an approach to BMC which exploits the Buechi automaton construction while searching for a counterexample. The paper provides an encoding in ASP of the temporal action domain and of bounded model checking of DLTL formulas.