Sciweavers

1582 search results - page 210 / 317
» On Higher-Order Description Logics
Sort
View
IPPS
2007
IEEE
15 years 4 months ago
A Study of Design Efficiency with a High-Level Language for FPGAs
Over the years reconfigurable computing devices such as FPGAs have evolved from gate-level glue logic to complex reprogrammable processing architectures. However, the tools used f...
Zain-ul-Abdin, Bertil Svensson
AIIA
2007
Springer
15 years 4 months ago
Instance-Based Query Answering with Semantic Knowledge Bases
A procedure founded in instance-based learning is presented, for performing a form of analogical reasoning on knowledge bases expressed in a wide range of ontology languages. The p...
Nicola Fanizzi, Claudia d'Amato, Floriana Esposito
CIE
2007
Springer
15 years 4 months ago
RZ: A Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
Andrej Bauer, Christopher A. Stone
SEMWEB
2005
Springer
15 years 3 months ago
Debugging OWL-DL Ontologies: A Heuristic Approach
Abstract. After becoming a W3C Recommendation, OWL is becoming increasingly widely accepted and used. However most people still find it difficult to create and use OWL ontologies...
Hai Wang, Matthew Horridge, Alan L. Rector, Nick D...
GECCO
2004
Springer
134views Optimization» more  GECCO 2004»
15 years 3 months ago
A New Universal Cellular Automaton Discovered by Evolutionary Algorithms
In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers p...
Emmanuel Sapin, Olivier Bailleux, Jean-Jacques Cha...