Sciweavers

232 search results - page 29 / 47
» Set approximations in fuzzy formal concept analysis
Sort
View
CLA
2004
14 years 11 months ago
A Semi-automatic Method to Ontology Design by Using FCA
Ontology design is a complex and time-consuming process. It is extremely difficult for human experts to discover ontology from given data or texts. This paper presents a semi-autom...
Hele-Mai Haav
75
Voted
SAS
2005
Springer
118views Formal Methods» more  SAS 2005»
15 years 2 months ago
Inference of Well-Typings for Logic Programs with Application to Termination Analysis
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
Maurice Bruynooghe, John P. Gallagher, Wouter Van ...
ICDE
1998
IEEE
108views Database» more  ICDE 1998»
15 years 10 months ago
Efficient Discovery of Functional and Approximate Dependencies Using Partitions
Discovery of functionaldependencies from relations has been identified as an important database analysis technique. In this paper, we present a new approach for finding functional...
Ykä Huhtala, Juha Kärkkäinen, Pasi ...
FM
2001
Springer
108views Formal Methods» more  FM 2001»
15 years 1 months ago
Improvements in BDD-Based Reachability Analysis of Timed Automata
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
Dirk Beyer
CORR
2011
Springer
192views Education» more  CORR 2011»
14 years 4 months ago
Improved Approximation Guarantees for Lower-Bounded Facility Location
d Abstract) Sara Ahmadian∗ Chaitanya Swamy∗ We consider the lower-bounded facility location (LBFL) problem (also sometimes called load-balanced facility location), which is a ...
Sara Ahmadian, Chaitanya Swamy