In this paper we investigate the relationship between two prioritized knowledge bases by measuring both the conflict and the agreement between them. First of all, a quantity of co...
act Interpretation Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy The Paige and Tarjan algorithm (PT) for comp...
In order to capture the full fledge semantic of complicated product data model, the expressive language ALCNHR+ K(D) is introduced. It cannot only be able to represent knowledge a...
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...