Sciweavers

5671 search results - page 1016 / 1135
» A Semantic Approach to Interpolation
Sort
View
KR
1992
Springer
15 years 10 months ago
Learning Useful Horn Approximations
While the task of answering queries from an arbitrary propositional theory is intractable in general, it can typicallybe performed e ciently if the theory is Horn. This suggests t...
Russell Greiner, Dale Schuurmans
ICLP
1990
Springer
15 years 10 months ago
Extending Definite Clause Grammars with Scoping Constructs
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...
Remo Pareschi, Dale Miller
AGTIVE
2007
Springer
15 years 10 months ago
Visualization, Simulation and Analysis of Reconfigurable Systems
Meta-modeling is well known to define the basic concepts of domain-specific languages in an object-oriented way. Based on graph transformation, an abstract meta-model may be enhanc...
Claudia Ermel, Karsten Ehrig
ASMTA
2009
Springer
114views Mathematics» more  ASMTA 2009»
15 years 10 months ago
Improving the Efficiency of the Proxel Method by Using Individual Time Steps
Discrete stochastic models (DSM) are widely used in various application fields today. Proxel-based simulation can outperform discrete event-based approaches in the analysis of smal...
Claudia Krull, Robert Buchholz, Graham Horton
APSEC
2007
IEEE
15 years 10 months ago
Definition of an Executable SPEM 2.0
One major advantage of executable models is that once constructed, they can be run, checked, validated and improved in short incremental and iterative cycles. In the field of Soft...
Reda Bendraou, Benoît Combemale, Xavier Cr&e...
« Prev « First page 1016 / 1135 Last » Next »