Sciweavers

411 search results - page 14 / 83
» Automating the Dependency Pair Method
Sort
View
ICLP
1997
Springer
14 years 1 months ago
Automatic Termination Analysis of Logic Programs
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
Naomi Lindenstrauss, Yehoshua Sagiv
GIS
2005
ACM
14 years 10 months ago
Close pair queries in moving object databases
Databases of moving objects are important for air traffic control, ground traffic, and battlefield configurations. We introduce the (historical and spatial) range close-pair query...
Panfeng Zhou, Donghui Zhang, Betty Salzberg, Gene ...
FMCO
2009
Springer
128views Formal Methods» more  FMCO 2009»
13 years 7 months ago
Patterns for Refinement Automation
Formal modelling is indispensable for engineering highly dependable systems. However, a wider acceptance of formal methods is hindered by their insufficient usability and scalabili...
Alexei Iliasov, Elena Troubitsyna, Linas Laibinis,...
BMCBI
2010
146views more  BMCBI 2010»
13 years 9 months ago
Revealing and avoiding bias in semantic similarity scores for protein pairs
Background: Semantic similarity scores for protein pairs are widely applied in functional genomic researches for finding functional clusters of proteins, predicting protein functi...
Jing Wang 0004, Xianxiao Zhou, Jing Zhu, Chenggui ...
TKDE
2008
121views more  TKDE 2008»
13 years 9 months ago
Schema Matching Using Interattribute Dependencies
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
Jaewoo Kang, Jeffrey F. Naughton