Sciweavers

421 search results - page 51 / 85
» Extension of Ontologies Assisted by Automated Reasoning Syst...
Sort
View
95
Voted
LICS
2002
IEEE
15 years 4 months ago
A Syntactic Approach to Foundational Proof-Carrying Code
Proof-Carrying Code (PCC) is a general framework for verifying the safety properties of machine-language programs. PCC proofs are usually written in a logic extended with language...
Nadeem Abdul Hamid, Zhong Shao, Valery Trifonov, S...
99
Voted
BMCBI
2007
104views more  BMCBI 2007»
14 years 11 months ago
Using contextual and lexical features to restructure and validate the classification of biomedical concepts
Background: Biomedical ontologies are critical for integration of data from diverse sources and for use by knowledge-based biomedical applications, especially natural language pro...
Jung-Wei Fan, Hua Xu, Carol Friedman
LPAR
2005
Springer
15 years 4 months ago
Termination of Fair Computations in Term Rewriting
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
Salvador Lucas, José Meseguer
87
Voted
LICS
1999
IEEE
15 years 3 months ago
Subtyping Recursive Types in Kernel Fun
The problem of defining and checking a subtype relation between recursive types was studied in [3] for a first order type system, but for second order systems, which combine subty...
Dario Colazzo, Giorgio Ghelli
FLOPS
2004
Springer
15 years 2 months ago
Implementing Natural Rewriting and Narrowing Efficiently
Abstract. Outermost-needed rewriting/narrowing is a sound and complete optimal demand-driven strategy for the class of inductively sequential constructor systems. Its parallel exte...
Santiago Escobar