Sciweavers

248 search results - page 33 / 50
» Checking e-service consistency using Description Logics
Sort
View
CP
2007
Springer
14 years 2 months ago
The Log-Support Encoding of CSP into SAT
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
Marco Gavanelli
FASE
2008
Springer
13 years 10 months ago
An Algebraic Semantics for MOF
Abstract. Model-driven development is a field within software engineering in which software artifacts are represented as models in order to improve productivity, quality, and cost ...
Artur Boronat, José Meseguer
DLOG
2003
13 years 10 months ago
Implementing Matching in ALE--First Results
Matching problems in Description Logics are theoretically well understood, with a variety of algorithms available for different DLs. Nevertheless, still no implementation of a ge...
Sebastian Brandt
RTAS
2009
IEEE
14 years 3 months ago
The System-Level Simplex Architecture for Improved Real-Time Embedded System Safety
Embedded systems in safety-critical environments demand safety guarantees while providing many useful services that are too complex to formally verify or fully test. Existing appl...
Stanley Bak, Deepti K. Chivukula, Olugbemiga Adeku...
KES
2004
Springer
14 years 1 months ago
Representing Knowledge in Controlled Natural Language: A Case Study
In this case study I argue for the usage of a machine-oriented controlled natural language as interface language to knowledge systems. Instead of using formal languages that are di...
Rolf Schwitter