Sciweavers

2783 search results - page 55 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
JAR
2002
77views more  JAR 2002»
15 years 5 months ago
Proof Reflection in Coq
We formalise natural deduction for first-order logic in the proof assistant Coq, using De Bruijn indices for variable binding. The main judgement we model is of the form d [:] , ...
Dimitri Hendriks
ICTAI
2007
IEEE
16 years 13 days ago
Enriching OWL Ontologies with Linguistic and User-Related Annotations: The ELEON System
This paper introduces ELEON, an editor that allows the enrichment of OWL ontologies with linguistic and user-related annotations. The enriched ontologies are used by natural langu...
Dimitris Bilidas, Maria Theologou, Vangelis Karkal...
ICCS
2007
Springer
16 years 9 days ago
Supporting Lexical Ontology Learning by Relational Exploration
Designing and refining ontologies becomes a tedious task, once the boundary to real-world-size knowledge bases has been crossed. Hence semi-automatic methods supporting those task...
Sebastian Rudolph, Johanna Völker, Pascal Hit...
FDL
2005
IEEE
15 years 11 months ago
Architecture description in related standards
Abstract. With this paper we intend to present a brief overview of the current means to describe architecture in different standards. We cover AADL as an example of Architecture De...
David Servat, Frédéric Loiret, S&eac...
ESA
1998
Springer
145views Algorithms» more  ESA 1998»
15 years 10 months ago
Moving-Target TSP and Related Problems
Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent ...
Christopher S. Helvig, Gabriel Robins, Alexander Z...