This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
Dante Augusto Couto Barone, Terry Caelli, Tib&eacu...
Abstract. In this paper, we extend Simple Conceptual Graphs with Reiter’s default rules. The motivation for this extension came from the type of reasonings involved in an agronom...
The Unified Modeling Language UML is a rich language so that it seem not feasible to give a single semantics for the complete language in one ste In order to define the semantics,...
The Conceptual Programming environment, CP, being developed at the Computing Research Laboratory (CRL), is a complete knowledge representation visual programming environment for u...
We consider four different models of process interactions that unify and generalise models introduced and studied by Angluin et al. [AAD+ 04] and models introduced and studied by ...