74 search results - page 4 / 15 » Conceptual Graph Rules and Equivalent Rules: A Synthesis |
AGTIVE
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. This paper deals with knowledge-based computer aided design. A novel method giving additional support for conceptual design is presented. In this method, a designer firs...
CONCUR
2006
Springer
13 years 9 months ago
2006
Springer
Several applications of graph rewriting systems (notably, some encodings of calculi with name passing) require rules which, besides deleting and generating graph items, are able to...
KR
2010
Springer
13 years 10 months ago
2010
Springer
We consider positive rules in which the conclusion may contain existentially quantified variables, which makes reasoning tasks (such as Deduction) undecidable. These rules have t...
IJSWIS
2007
13 years 5 months ago
2007
This paper presents a hybrid, extensional and asymmetric matching approach designed to find out semantic relations (equivalence and subsumption) between entities issued from two ...
GG
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Local confluence is an important property in many rewriting and transformation systems. The notion of critical pairs is central for being able to verify local confluence ...