884 search results - page 99 / 177 » The Linear Logic of Multisets |
BPM
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. Mainstream workflow management systems are using procedural languages ranging from BPMN and EPCs to BPEL and YAWL. By demonstrating DECLARE, we will show that it is also ...
ENTCS
2008
13 years 9 months ago
2008
The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisf...
ECCC
2010
13 years 7 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
HASE
2005
IEEE
14 years 2 months ago
2005
IEEE
Checking various temporal requirements is a key dependability concern in safety-critical systems. As modelchecking approaches do not scale well to systems of high complexity the r...
DLOG
2003
13 years 10 months ago
2003
We consider description logic knowledge bases in which the ABox can contain Boolean combinations of traditional ABox assertions (represented as clauses or sequents). A linear redu...