Sciweavers

1941 search results - page 168 / 389
» Reasoning about Computations Using Two-Levels of Logic
Sort
View
148
Voted
LPAR
2005
Springer
15 years 9 months ago
Comparative Similarity, Tree Automata, and Diophantine Equations
The notion of comparative similarity ‘X is more similar or closer to Y than to Z’ has been investigated in both foundational and applied areas of knowledge representation and r...
Mikhail Sheremet, Dmitry Tishkovsky, Frank Wolter,...
154
Voted
SEMWEB
2004
Springer
15 years 9 months ago
Working with Multiple Ontologies on the Semantic Web
The standardization of the second generation Web Ontology Language, OWL, leaves a crucial issue for Web-based ontologies unsatisfactorily resolved: how to represent and reason with...
Bernardo Cuenca Grau, Bijan Parsia, Evren Sirin
151
Voted
SIGMOD
1998
ACM
180views Database» more  SIGMOD 1998»
15 years 7 months ago
Integration of Heterogeneous Databases Without Common Domains Using Queries Based on Textual Similarity
Most databases contain “name constants” like course numbers, personal names, and place names that correspond to entities in the real world. Previous work in integration of het...
William W. Cohen
144
Voted
LICS
2005
IEEE
15 years 9 months ago
Model-Checking Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Markus Lohrey
CAV
2012
Springer
227views Hardware» more  CAV 2012»
13 years 6 months ago
Minimum Satisfying Assignments for SMT
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
Isil Dillig, Thomas Dillig, Kenneth L. McMillan, A...