Sciweavers

10 search results - page 2 / 2
» Efficient First-Order Model-Checking Using Short Labels
Sort
View
JAL
2006
100views more  JAL 2006»
13 years 5 months ago
Distance and routing labeling schemes for non-positively curved plane graphs
Distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the distance between any two vertices u and v can be determined effic...
Victor Chepoi, Feodor F. Dragan, Yann Vaxès
ESSLLI
2009
Springer
13 years 2 months ago
POP* and Semantic Labeling Using SAT
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
Martin Avanzini
SIGIR
2005
ACM
13 years 10 months ago
Automatic web query classification using labeled and unlabeled training data
Accurate topical categorization of user queries allows for increased effectiveness, efficiency, and revenue potential in general-purpose web search systems. Such categorization be...
Steven M. Beitzel, Eric C. Jensen, Ophir Frieder, ...
APN
2008
Springer
13 years 7 months ago
Hierarchical Set Decision Diagrams and Automatic Saturation
Shared decision diagram representations of a state-space have been shown to provide efficient solutions for model-checking of large systems. However, decision diagram manipulation ...
Alexandre Hamez, Yann Thierry-Mieg, Fabrice Kordon
IJCAI
2003
13 years 6 months ago
Automated Reasoning: Past Story and New Trends
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
Andrei Voronkov