Sciweavers

TOPNOC
2008
13 years 7 months ago
Time Recursive Petri Nets
Recursive Petri Nets (RPNs) allow to design and analyze complex discrete event systems. Indeed, RPNs enable to model patterns of discrete event systems related to the dynamic struc...
Djaouida Dahmani, Jean-Michel Ilié, Malika ...
TOPNOC
2008
13 years 7 months ago
Assessing State Spaces Using Petri-Net Synthesis and Attribute-Based Visualization
State spaces are commonly used representations of system behavior. A state space may be derived from a model of system behavior but can also be obtained through process mining. For...
H. M. W. (Eric) Verbeek, A. Johannes Pretorius, Wi...
TOCL
2008
128views more  TOCL 2008»
13 years 7 months ago
A comprehensive combination framework
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...
Silvio Ghilardi, Enrica Nicolini, Daniele Zucchell...
AMAI
2005
Springer
13 years 7 months ago
Robust inference of trees
Abstract. This paper is concerned with the reliable inference of optimal treeapproximations to the dependency structure of an unknown distribution generating data. The traditional ...
Marco Zaffalon, Marcus Hutter
AMAI
2005
Springer
13 years 7 months ago
Semantics for a theory of defeasible reasoning
Quoc Bao Vo, Norman Y. Foo, Joe Thurbon
AMAI
2005
Springer
13 years 7 months ago
Generalizations of matched CNF formulas
A CNF formula is called matched if its associated bipartite graph (whose vertices are clauses and variables) has a matching that covers all clauses. Matched CNF formulas are satisf...
Stefan Szeider
AMAI
2005
Springer
13 years 7 months ago
The SAT2002 competition
SAT Competition 2002 held in March
Laurent Simon, Daniel Le Berre, Edward A. Hirsch
AMAI
2005
Springer
13 years 7 months ago
A SAT approach to query optimization in mediator systems
Mediator systems integrate distributed, heterogeneous and autonomous data sources, but their e ective use requires the solution of hard query optimization problems. This is usuall...
Steven David Prestwich, Stéphane Bressan
AMAI
2005
Springer
13 years 7 months ago
Auction design with costly preference elicitation
We consider auction design in a setting with costly preference elicitation. Well designed auctions can help to avoid unnecessary elicitation while determining efficient allocations...
David C. Parkes