Sciweavers

1544 search results - page 258 / 309
» Automated Evaluation of Description Logic Reasoning Systems
Sort
View
CADE
2006
Springer
16 years 4 days ago
Solving Sparse Linear Constraints
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
Shuvendu K. Lahiri, Madanlal Musuvathi
TIME
2006
IEEE
15 years 5 months ago
DyST: Dynamic and Scalable Temporal Text Indexing
An increasing number of documents in companies and other organizations are now only available electronically, and exist in several versions updated at different times. In order to...
Kjetil Nørvåg, Albert Overskeid Nyb&o...
CADE
2002
Springer
16 years 4 days ago
A Gradual Approach to a More Trustworthy, Yet Scalable, Proof-Carrying Code
Abstract. Proof-carrying code (PCC) allows a code producer to associate to a program a machine-checkable proof of its safety. In the original approach to PCC, the safety policy inc...
Robert R. Schneck, George C. Necula
DLOG
2009
14 years 9 months ago
Explaining by Example: Model Exploration for Ontology Comprehension
Abstract. In this paper, we describe an approach for ontology comprehension support called model exploration in which models for ontologies are generated and presented interactivel...
Johannes Bauer, Ulrike Sattler, Bijan Parsia
SEMWEB
2009
Springer
15 years 6 months ago
ASMOV: Results for OAEI 2009
The Automated Semantic Mapping of Ontologies with Validation (ASMOV) algorithm for ontology alignment was one of the top performing algorithms in the 2007 and 2008 Ontology Alignme...
Yves R. Jean-Mary, E. Patrick Shironoshita, Mansur...