Sciweavers

1175 search results - page 138 / 235
» Abstract computability and algebraic specification
Sort
View
AI
2008
Springer
13 years 9 months ago
Modelling and solving temporal reasoning as propositional satisfiability
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
Duc Nghia Pham, John Thornton, Abdul Sattar
BMCBI
2008
242views more  BMCBI 2008»
13 years 9 months ago
New time-scale criteria for model simplification of bio-reaction systems
Background: Quasi-steady state approximation (QSSA) based on time-scale analysis is known to be an effective method for simplifying metabolic reaction system, but the conventional...
Junwon Choi, Kyung-won Yang, Tai-yong Lee, Sang Yu...
DSVIS
2000
Springer
14 years 1 months ago
Wisdom - A UML Based Architecture for Interactive Systems
Abstract. The UML is recognized to be the dominant diagrammatic modeling language in the software industry. However, it’s support for building interactive systems is still acknow...
Nuno Jardim Nunes, João Falcão e Cun...
CPAIOR
2006
Springer
14 years 21 days ago
The Range Constraint: Algorithms and Implementation
Abstract. We recently proposed a simple declarative language for specifying a wide range of counting and occurrence constraints. The language uses just two global primitives: the R...
Christian Bessière, Emmanuel Hebrard, Brahi...
AINA
2010
IEEE
14 years 8 days ago
YASA-M: A Semantic Web Service Matchmaker
Abstract--In this paper, we present new algorithms for matching Web services described in YASA4WSDL (YASA for short). We have already defined YASA that overcomes some issues missin...
Yassin Chabeb, Samir Tata, Alain Ozanne