Sciweavers

1187 search results - page 39 / 238
» Graph-Based Procedural Abstraction
Sort
View
CONCUR
1999
Springer
15 years 2 months ago
An Unfolding Algorithm for Synchronous Products of Transition Systems
Abstract. The unfolding method, initially introduced for systems modelled by Petri nets, is applied to synchronous products of transition systems, a model introduced by Arnold [2]....
Javier Esparza, Stefan Römer
AMW
2009
14 years 10 months ago
Stop the Chase: Short Contribution
Abstract. The chase procedure, an algorithm proposed 25+ years ago to fix constraint violations in database instances, has been successfully applied in a variety of contexts, such ...
Michael Meier 0002, Michael Schmidt, Georg Lausen
JETAI
2008
86views more  JETAI 2008»
14 years 9 months ago
Weighting strategy for non-clausal resolution
Abstract. This paper describes a proof search procedure for propositional nonclausal resolution based on a new weighting strategy that utilizes search methods for propositional sat...
Zbigniew Stachniak, Anton Belov
CADE
2010
Springer
14 years 7 months ago
Terminating Tableaux for Hybrid Logic with Eventualities
x-free and employs a novel clausal form that abstracts away from propositional reasoning. It comes with an elegant correctness proof. We discuss some optimizations for decision pro...
Mark Kaminski, Gert Smolka
IJCNN
2006
IEEE
15 years 3 months ago
Predictive Random Graph Ranking on the Web
Abstract— The incomplete information about the Web structure causes inaccurate results of various ranking algorithms. In this paper, we propose a solution to this problem by form...
Haixuan Yang, Irwin King, Michael R. Lyu