Sciweavers

830 search results - page 143 / 166
» Topological Reasoning and The Logic of Knowledge
Sort
View
FOSSACS
2007
Springer
14 years 1 months ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard
FM
1999
Springer
93views Formal Methods» more  FM 1999»
13 years 11 months ago
Group Principals and the Formalization of Anonymity
We introduce the concept of a group principal and present a number of different classes of group principals, including threshold-group-principals. These appear to naturally usefu...
Paul F. Syverson, Stuart G. Stubblebine
KES
2008
Springer
13 years 7 months ago
Ontology-Based Design Pattern Recognition
This paper presents ontology-based architecture for pattern recognition in the context of static source code analysis. The proposed system has three subsystems: parser, OWL ontolog...
Damir Kirasic, Danko Basch
IEEECIT
2006
IEEE
14 years 1 months ago
A Service Retrieval Model with Enhanced Dominance-Based Rough Sets
As an important part of service-oriented software engineering, service retrieval receives much attention from industry and academia, but which still leaves much to be expected: ho...
Bin Tang, Leqiu Qian, Ruzhi Xu, Yunjiao Xue, Hui T...
ESWS
2004
Springer
14 years 28 days ago
The HCONE Approach to Ontology Merging
Existing efforts on ontology mapping, alignment and merging vary from methodological and theoretical frameworks, to methods and tools that support the semi-automatic coordination o...
Konstantinos Kotis, George A. Vouros