Sciweavers

5084 search results - page 688 / 1017
» Proving Possibility Properties
Sort
View
MMB
2010
Springer
185views Communications» more  MMB 2010»
15 years 8 months ago
Correctness Issues of Symbolic Bisimulation Computation for Markov Chains
Abstract. Bisimulation reduction is a classical means to fight the infamous state space explosion problem, which limits the applicability of automated methods for verification li...
Ralf Wimmer, Bernd Becker
AUSAI
2006
Springer
15 years 8 months ago
An Efficient Alternative to SVM Based Recursive Feature Elimination with Applications in Natural Language Processing and Bioinfo
The SVM based Recursive Feature Elimination (RFE-SVM) algorithm is a popular technique for feature selection, used in natural language processing and bioinformatics. Recently it wa...
Justin Bedo, Conrad Sanderson, Adam Kowalczyk
ICALP
2010
Springer
15 years 8 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou
AIIA
2007
Springer
15 years 8 months ago
Similarity-Guided Clause Generalization
Few works are available in the literature to define similarity criteria between First-Order Logic formulæ, where the presence of relations causes various portions of one descript...
Stefano Ferilli, Teresa Maria Altomare Basile, Nic...
CONCUR
2008
Springer
15 years 8 months ago
Unfolding-Based Diagnosis of Systems with an Evolving Topology
Abstract. We propose a framework for model-based diagnosis of systems with mobility and variable topologies, modelled as graph transformation systems. Generally speaking, model-bas...
Paolo Baldan, Thomas Chatain, Stefan Haar, Barbara...