Sciweavers

37 search results - page 4 / 8
» Partial Order Semantics of Sequence Diagrams for Mobility
Sort
View
ENTCS
2007
126views more  ENTCS 2007»
14 years 9 months ago
Modelling Calculi with Name Mobility using Graphs with Equivalences
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
Paolo Baldan, Fabio Gadducci, Ugo Montanari
ICTAI
2000
IEEE
15 years 1 months ago
Building efficient partial plans using Markov decision processes
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
Pierre Laroche
CONCUR
2006
Springer
15 years 1 months ago
Concurrent Rewriting for Graphs with Equivalences
Several applications of graph rewriting systems (notably, some encodings of calculi with name passing) require rules which, besides deleting and generating graph items, are able to...
Paolo Baldan, Fabio Gadducci, Ugo Montanari
FROCOS
2000
Springer
15 years 1 months ago
Structured Sequent Calculi for Combining Intuitionistic and Classical First-Order Logic
We define a sound and complete logic, called FO , which extends classical first-order predicate logic with intuitionistic implication. As expected, to allow the interpretation of i...
Paqui Lucio
74
Voted
DOCENG
2003
ACM
15 years 2 months ago
Creating reusable well-structured PDF as a sequence of component object graphic (COG) elements
Portable Document Format (PDF) is a page-oriented, graphically rich format based on PostScript semantics and it is also the format interpreted by the Adobe Acrobat viewers. Althou...
Steven R. Bagley, David F. Brailsford, Matthew R. ...