40 search results - page 2 / 8 » Analysis of Rule Refinement Conflicts |
TPLP
2002
13 years 5 months ago
2002
In this paper, we consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under the answer set semantics. In this approach, new informat...
ECEASST
2008
13 years 5 months ago
2008
: The main idea behind Reconfigurable Object Nets (RONs) is to support the visual specification of controlled rule-based net transformations of place/transition nets (P/T nets). RO...
ENTCS
2006
13 years 5 months ago
2006
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are often required properties. Only under ...
FMCAD
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. We consider the problem of refinement checking for asynchronous processes where refinement corresponds to stutter-closed language inclusion. Since an efficient algorithmi...
DEXA
2003
Springer
13 years 10 months ago
2003
Springer
This paper presents an algorithm for termination static analysis of active rules with priorities. Active rules termination is an undecidable problem. Several recent works have sugg...