Slicing knowledge-based systems: techniques and applications

Vasconcelos, Wamberto; Aragão, Marcelo A. T.

doi:10.1016/s0950-7051(00)00058-7

Cited by 1 publication

(4 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We did not find in the literature a correctness proof for the particular algorithm we used here (hence we leave it as a conjecture), but there are such proofs for similar algorithms, e.g. the one in [49]. Therefore, although we here rely on this conjecture, this is not unreasonable as we could have used those alternative algorithms, which would provide us with the same dependency information, but with known correctness results.…”

Section: Lemma 33mentioning

confidence: 95%

“…An approach similar to Schoenig and Ducassé's was introduced by Vasconcelos and Aragão [49]; both approaches apply slicing to Prolog programs at the level of predicate arguments, and generate executable slices. An advantage of the work by Vasconcelos and Aragão is that they proved correctness of their slicing algorithms.…”

Section: Slicing Logic Programsmentioning

confidence: 99%

“…The approaches by Schoening and Ducassé [42] and Vasconcelos and Aragão [49] both work for Prolog programs. Although AgentSpeak is quite similar to Prolog in many respects, which suggests that we might be able to base our algorithm on those approaches, an AgentSpeak plan has in fact essentially the same structure of a guarded clause.…”

Section: Slicing Logic Programsmentioning

confidence: 99%

“…Zhao et al [56] proposed a slicing algorithm that is specific to Guarded Horn Clauses, so their approach is a better candidate as a basis for ours. Again, we do not need to generate executable slices (an important motivation in both [42] and [49]), as we are only interested in preserving the truth of certain properties of the system. Further, the graph-based approach in [56] provides a very clear algorithm.…”

Section: Slicing Logic Programsmentioning

confidence: 99%

See 3 more Smart Citations

Property-based Slicing for Agent Verification

Bordini

Fisher

Wooldridge

et al. 2009

Journal of Logic and Computation

View full text Add to dashboard Cite

Programming languages designed specifically for multi-agent systems represent a new programming paradigm that has gained popularity over recent years, with some multi-agent programming languages being used in increasingly sophisticated applications, often in critical areas. To support this, we have developed a set of tools to allow the use of model-checking techniques in the verification of systems directly implemented in one particular language called AgentSpeak. The success of model checking as a verification technique for large software systems is dependent partly on its use in combination with various state-space reduction techniques, an important example of which is property-based slicing. This article introduces an algorithm for property-based slicing of AgentSpeak multi-agent systems. The algorithm uses literal dependence graphs, as developed for slicing logic programs, and generates a program slice whose state space is stuttering-equivalent to that of the original program; the slicing criterion is a property in a logic with LTL operators and (shallow) BDI modalities. In addition to showing correctness and characterizing the complexity of the slicing algorithm, we apply it to an AgentSpeak program based on autonomous planetary exploration rovers, and we discuss how slicing reduces the model-checking state space. The experiment results show a significant reduction in the state space required for model checking that agent, thus indicating that this approach can have an important impact on the future practicality of agent verification.

show abstract

Section: Lemma 33mentioning

confidence: 95%

Section: Slicing Logic Programsmentioning

confidence: 99%