Impossible futures equivalence is the semantic equivalence on labelled transition systems that identifies systems iff they have the same "AGEF" properties: temporal logic...
The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to the development of answer set programming. In th...
In this paper a definition of n-valued system in the context of the algebraizable logics is proposed. We define and study the variety V3, showing that it is definitionally equivale...
In this paper we describe a rule-based approach to semantic specification that can be used to establish semantic agreement between a source and receiver. Query processing techniqu...
Abstract. In complex multi agent systems, the agents may be heterogeneous and possibly designed by different programmers. Thus, the importance of defining a standard framework for ...