3914 search results - page 462 / 783 » Automating SLA modeling |
278
click to vote
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...
177
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
Abstract. Tableau calculi are the state-of-the-art for reasoning in description logics (DL). Despite recent improvements, tableau-based reasoners still cannot process certain knowl...
172
click to vote
FM
2009
Springer
16 years 1 months ago
2009
Springer
Statecharts and Petri nets are two popular visual formalisms for modelling complex systems that exhibit concurrency. Both formalisms are supported by various design tools. To enabl...
167
click to vote
RR
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we present an embedding of propositional production systems into µ-calculus, and first-order production systems into fixed-point logic, with the aim of using these...
193
click to vote
RR
2009
Springer
16 years 1 months ago
2009
Springer
Open Answer Set Programming (OASP) can be seen as a framework to represent tightly integrated combined knowledge bases of ontologies and rules that are not necessarily DL-safe. The...