Sciweavers

3564 search results - page 401 / 713
» Evaluating a Formal Modelling Language
Sort
View
FUIN
2007
123views more  FUIN 2007»
15 years 4 months ago
Analysis of Approximate Petri Nets by Means of Occurrence Graphs
Abstract. Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approa...
Zbigniew Suraj, Barbara Fryc
FASE
2010
Springer
15 years 8 months ago
Incremental Consistency Checking of Dynamic Constraints
Software design models are routinely adapted to domains, companies, and applications. This requires customizable consistency checkers that allow engineers to dynamically adapt mode...
Iris Groher, Alexander Reder, Alexander Egyed
EACL
1989
ACL Anthology
15 years 5 months ago
On The Generative Power Of Two-Level Morphological Rules
Koskenniemi's model of two-level morphology has been very influential in recent years, but definitions of the formalism have generally been phrased in terms of a compilation ...
Graeme D. Ritchie
SCP
1998
163views more  SCP 1998»
15 years 3 months ago
Computing with Continuous Change
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat
PODS
2007
ACM
131views Database» more  PODS 2007»
16 years 4 months ago
Provenance semirings
We show that relational algebra calculations for incomplete databases, probabilistic databases, bag semantics and whyprovenance are particular cases of the same general algorithms...
Todd J. Green, Gregory Karvounarakis, Val Tannen