Sciweavers

694 search results - page 33 / 139
» Open Graphs and Computational Reasoning
Sort
View
DLOG
2009
13 years 6 months ago
Quasi-Classical Semantics for Expressive Description Logics
Abstract. Inconsistency handling in expressive description logics is an important problem because inconsistency may naturally occur in an open world. In this paper, we present the ...
Xiaowang Zhang, Guilin Qi, Yue Ma, Zuoquan Lin
ICCS
2009
Springer
14 years 3 months ago
Default Conceptual Graph Rules: Preliminary Results for an Agronomy Application
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...
Jean-François Baget, Madalina Croitoru, J&e...
CSI
2007
89views more  CSI 2007»
13 years 9 months ago
Writing and executing ODP computational viewpoint specifications using Maude
The Reference Model of Open Distributed Processing (RM-ODP) is a joint standardization effort by ITU-T and ISO/IEC for the specification of large open distributed systems. RM-ODP ...
José Raúl Romero, Antonio Vallecillo...
SGAI
2004
Springer
14 years 2 months ago
A combinatorial approach to conceptual graph projection checking
We exploit the combinatorial structure of conceptual graphs in order to obtain faster execution time when computing projection, which is a core generalisation-specialisation relat...
Madalina Croitoru, Ernesto Compatangelo
JCO
2011
113views more  JCO 2011»
13 years 4 months ago
Hardness and algorithms for rainbow connection
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...