Sciweavers

20 search results - page 2 / 4
» Extensions of Simple Conceptual Graphs: the Complexity of Ru...
Sort
View
CSCLP
2006
Springer
13 years 9 months ago
A Constraint Model for State Transitions in Disjunctive Resources
Abstract. Traditional resources in scheduling are simple machines where a capacity is the main restriction. However, in practice there frequently appear resources with more complex...
Roman Barták, Ondrej Cepek
ICCS
1998
Springer
13 years 9 months ago
Handling Specification Knowledge Evolution Using Context Lattices
Internet-based information technologies have considerable potential for improving collaboration in professional communities. In this paper, we explain the concept of user-driven sp...
Aldo de Moor, Guy W. Mineau
MSCS
2007
91views more  MSCS 2007»
13 years 5 months ago
A rewriting calculus for cyclic higher-order term graphs
Introduced at the end of the nineties, the Rewriting Calculus (ρ-calculus, for short) is a simple calculus that fully integrates term-rewriting and λ-calculus. The rewrite rules...
Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, C...
ENTCS
2008
106views more  ENTCS 2008»
13 years 5 months ago
Towards a Sharing Strategy for the Graph Rewriting Calculus
The graph rewriting calculus is an extension of the -calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using u...
Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, C...
IFIP3
1998
151views Education» more  IFIP3 1998»
13 years 6 months ago
Conceptual Workflow Modelling for Remote Courses
Development of a wide spread project intended to teaching Computer Science, integrating a considerable number of students all over a country with big geographical extension and sc...
José Palazzo M. de Oliveira, Mariano Nicola...