Sciweavers

4737 search results - page 592 / 948
» The LOGIC negotiation model
Sort
View
BPSC
2009
152views Business» more  BPSC 2009»
15 years 8 months ago
A Formal Temporal Semantics for Microsoft Project based on Allen's Interval Algebra
Process modelling systems are complex and difficult to compare. A key attribute of any process modelling formalism or tool is time which involves how it handles and represents tem...
Denis Gagné, André Trudel
APAL
2008
104views more  APAL 2008»
15 years 7 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
AMAI
2006
Springer
15 years 7 months ago
Possibilistic uncertainty handling for answer set programming
In this work, we introduce a new framework able to deal with a reasoning that is at the same time non monotonic and uncertain. In order to take into account a certainty level assoc...
Pascal Nicolas, Laurent Garcia, Igor Stépha...
ENTCS
2008
102views more  ENTCS 2008»
15 years 7 months ago
Programming Languages For Interactive Computing
Traditional programming languages are algorithmic: they are best suited to writing programs that acquire all their inputs before executing and only produce a result on termination...
Roly Perera
IEE
2008
91views more  IEE 2008»
15 years 7 months ago
Story-driven approach to software evolution
: From a maintenance perspective, only software that is well understood can evolve in a controlled and high-quality manner. Software evolution itself is a knowledge-driven process ...
Juergen Rilling, Wen Jun Meng, René Witte, ...