Sciweavers

99 search results - page 11 / 20
» Reasoning over Extended ER Models
Sort
View
ICLP
1997
Springer
13 years 12 months ago
The Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
HYBRID
1998
Springer
14 years 1 days ago
Hybrid cc with Interval Constraints
Abstract. Hybrid cc is a constraint programming language suitable for modeling, controlling and simulating hybrid systems, i.e. systems with continuous and discrete state changes. ...
Björn Carlson, Vineet Gupta
ENTCS
2002
77views more  ENTCS 2002»
13 years 7 months ago
The variety of variables in computer-aided real-time programming
The refinement calculus is a well-established theory for translating specifications to program code. Recent research has extended the calculus to handle real-time requirements and...
Luke Wildman, Colin J. Fidge
GI
2009
Springer
13 years 5 months ago
A BPMN Case Study: Paper Review and Submission System
: We explore the expressiveness of the BPMN workflow modelling language by applying it to MuCoMS, a paper submission system. This well known application domain is a suitable exampl...
Markus Kirchberg, Ove Sörensen, Bernhard Thal...
IJAR
2008
83views more  IJAR 2008»
13 years 7 months ago
Decision-theoretic specification of credal networks: A unified language for uncertain modeling with sets of Bayesian networks
Credal networks are models that extend Bayesian nets to deal with imprecision in probability, and can actually be regarded as sets of Bayesian nets. Credal nets appear to be power...
Alessandro Antonucci, Marco Zaffalon