Sciweavers

616 search results - page 57 / 124
» Bounded Model Checking with Description Logic Reasoning
Sort
View
ER
2004
Springer
90views Database» more  ER 2004»
14 years 2 months ago
Semantic Interpretation and Matching of Web Services
A major issue in the study of semantic Web services concerns the matching problem of Web services. Various techniques for this problem have been proposed. Typical ones include FSM ...
Chang Xu, Shing-Chi Cheung, Xiangye Xiao
POPL
2005
ACM
14 years 9 months ago
Dynamic partial-order reduction for model checking software
We present a new approach to partial-order reduction for model checking software. This approach is based on initially exploring an arbitrary interleaving of the various concurrent...
Cormac Flanagan, Patrice Godefroid
JALC
2006
95views more  JALC 2006»
13 years 8 months ago
On the Decidability of Model-Checking for P Systems
Membrane computing is a branch of molecular computing that aims to develop models and paradigms that are biologically motivated. It identifies an unconventional computing model, n...
Zhe Dang, Oscar H. Ibarra, Cheng Li, Gaoyan Xie
CSL
2010
Springer
13 years 10 months ago
New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures
We present a new algorithm for model-checking weak monadic second-order logic on inductive structures, a class of structures of bounded clique width. Our algorithm directly manipul...
Tobias Ganzow, Lukasz Kaiser
FUIN
2007
130views more  FUIN 2007»
13 years 8 months ago
A Logic-Based Approach to Finding Explanations for Discrepancies in Optimistic Plan Execution
Abstract. Consider an agent executing a plan with nondeterministic actions, in a dynamic environment, which might fail. Suppose that she is given a description of this action domai...
Thomas Eiter, Esra Erdem, Wolfgang Faber, Já...