Sciweavers

268 search results - page 38 / 54
» Expressive Power of Grammatical Formalisms
Sort
View
AAAI
2006
15 years 1 months ago
Inconsistencies, Negations and Changes in Ontologies
Ontology management and maintenance are considered cornerstone issues in current Semantic Web applications in which semantic integration and ontological reasoning play a fundament...
Giorgos Flouris, Zhisheng Huang, Jeff Z. Pan, Dimi...
DLOG
1996
15 years 1 months ago
Resolving Semantic Heterogeneity in Databases with a Terminological Model: Correspondence Refinement
The success of schema integration in multidatabase systems relies heavily on the determination of complete and refined correspondence relationships between them. So, the candidate...
Ounissa Larab, Aïcha-Nabila Benharkat
121
Voted
LICS
2010
IEEE
14 years 10 months ago
Alternating Timed Automata over Bounded Time
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
Mark Jenkins, Joël Ouaknine, Alexander Rabino...
GECCO
2008
Springer
120views Optimization» more  GECCO 2008»
15 years 26 days ago
Genetic programming with polymorphic types and higher-order functions
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
Franck Binard, Amy P. Felty
93
Voted
CADE
2001
Springer
16 years 3 days ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther