Constraint automata have been used as an operational model for component connectors described in the coordination language Reo which specifies the cooperation and communication of...
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...
Along with the popularity of software-intensive systems, the interactions between system components and between humans and software applications are becoming more and more complex...
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an ...