Sciweavers

736 search results - page 114 / 148
» A Science of Reasoning (Extended Abstract)
Sort
View
CAISE
2004
Springer
13 years 11 months ago
Simple and Minimum-Cost Satisfiability for Goal Models
Abstract. Goal models have been used in Computer Science in order to represent software requirements, business objectives and design qualities. In previous work we have presented a...
Roberto Sebastiani, Paolo Giorgini, John Mylopoulo...
AUTOMATICA
2008
154views more  AUTOMATICA 2008»
13 years 7 months ago
Approximately bisimilar symbolic models for nonlinear control systems
Control systems are usually modeled by differential equations describing how physical phenomena can be influenced by certain control parameters or inputs. Although these models ar...
Giordano Pola, Antoine Girard, Paulo Tabuada
BIB
2006
84views more  BIB 2006»
13 years 7 months ago
Computational methodologies for modelling, analysis and simulation of signalling networks
This article is a critical review of computational techniques used to model, analyse and simulate signalling networks. We propose a conceptual framework, and discuss the role of s...
David R. Gilbert, Hendrik Fuß, Xu Gu, Richar...
JUCS
2010
133views more  JUCS 2010»
13 years 6 months ago
Knowledge Authoring with ORE: Testing, Debugging and Validating Knowledge Rules in a Semantic Web Framework
Abstract: Ontology rule editing, testing, debugging and validation are still handcrafted and painful tasks. Nowadays, there is a lack of tools that take these tasks into considerat...
Andrés Muñoz Ortega, Jose M. Alcaraz...
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 5 months ago
Solving satisfiability problems with preferences
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...