Sciweavers

8094 search results - page 12 / 1619
» Improvements in Formula Generalization
Sort
View
LICS
2009
IEEE
14 years 2 months ago
The General Vector Addition System Reachability Problem by Presburger Inductive Invariants
The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the class...
Jérôme Leroux
AIML
2006
13 years 9 months ago
A General Semantics for Quantified Modal Logic
In [9] we developed a semantics for quantified relevant logic that uses general frames. In this paper, we adapt that model theory to treat quantified modal logics, giving a complet...
Robert Goldblatt, Edwin D. Mares
LICS
2002
IEEE
14 years 17 days ago
Semantic Minimization of 3-Valued Propositional Formulae
This paper presents an algorithm for a non-standard logicminimization problem that arises in £ -valued propositional logic. The problem is motivated by the potential for obtainin...
Thomas W. Reps, Alexey Loginov, Shmuel Sagiv
ICCS
2004
Springer
14 years 1 months ago
Improving Generalization Level in UML Models Iterative Cross Generalization in Practice
FCA has been successfully applied to software engineering tasks such as source code analysis and class hierarchy re-organization. Most notably, FCA hematics behind the mechanism of...
Michel Dao, Marianne Huchard, Mohamed Rouane Hacen...
CORR
2011
Springer
144views Education» more  CORR 2011»
12 years 11 months ago
Analyzing Walksat on random formulas
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from [16, 17] finds a satisfying assignment of Φ in pol...
Amin Coja-Oghlan, Alan M. Frieze