Results 1  10
of
111,806
Proof Generalization and Proof Reuse
"... This paper presents some experiments about the notion of generalization in proof assistants based on proof theory. We propose a mechanism which, starting from a proved theorem, allows to get a less specific result that can be instantiated and reused in other contexts. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This paper presents some experiments about the notion of generalization in proof assistants based on proof theory. We propose a mechanism which, starting from a proved theorem, allows to get a less specific result that can be instantiated and reused in other contexts.
Proof Reuse for Deductive Program Verification
"... We present a proof reuse mechanism for deductive program verification calculi. It reuses proofs incrementally (one proof step at a time) and is employs a similarity measure for the points (formulas, terms, programs) where a rule is applied. ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
We present a proof reuse mechanism for deductive program verification calculi. It reuses proofs incrementally (one proof step at a time) and is employs a similarity measure for the points (formulas, terms, programs) where a rule is applied.
Type Isomorphisms and Proof Reuse in Dependent Type Theory
, 2001
"... We propose a theoretical foundation for proof reuse, based on the novel idea of a computational interpretation of type isomorphisms. ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
We propose a theoretical foundation for proof reuse, based on the novel idea of a computational interpretation of type isomorphisms.
A logical framework for software proof reuse
 Proceedings of the ACM SIGSOFT Symposium on Software Reusability
, 1995
"... We describe a logical framework PR for verification of reusable software components. Within our system, developers can employ the advantages traditionally associated with software reuse to reduce the cost of software verification by reusing abstract proofs and specifications. One can construct an ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We describe a logical framework PR for verification of reusable software components. Within our system, developers can employ the advantages traditionally associated with software reuse to reduce the cost of software verification by reusing abstract proofs and specifications. One can construct
Logic Programming with Focusing Proofs in Linear Logic
 Journal of Logic and Computation
, 1992
"... The deep symmetry of Linear Logic [18] makes it suitable for providing abstract models of computation, free from implementation details which are, by nature, oriented and non symmetrical. I propose here one such model, in the area of Logic Programming, where the basic computational principle is C ..."
Software Reuse
 ACM Computing Surveys
, 1992
"... Software reuse is the process ofcreating software systems from existing software rather than building software systems from scratch. ‘l’his simple yet powerful vision was introduced in 1968. Software reuse has, however, failed to become a standard software engineering practice. In an attempt to unde ..."
Abstract

Cited by 303 (2 self)
 Add to MetaCart
Software reuse is the process ofcreating software systems from existing software rather than building software systems from scratch. ‘l’his simple yet powerful vision was introduced in 1968. Software reuse has, however, failed to become a standard software engineering practice. In an attempt
Adaptive clustering for mobile wireless networks
 IEEE Journal on Selected Areas in Communications
, 1997
"... This paper describes a selforganizing, multihop, mobile radio network, which relies on a code division access scheme for multimedia support. In the proposed network architecture, nodes are organized into nonoverlapping clusters. The clusters are independently controlled and are dynamically reconfig ..."
Abstract

Cited by 556 (11 self)
 Add to MetaCart
reconfigured as nodes move. This network architecture has three main advantages. First, it provides spatial reuse of the bandwidth due to node clustering. Secondly, bandwidth can be shared or reserved in a controlled fashion in each cluster. Finally, the cluster algorithm is robust in the face of topological
Ontologies: Principles, methods and applications
 KNOWLEDGE ENGINEERING REVIEW
, 1996
"... This paper is intended to serve as a comprehensive introduction to the emerging field concerned with the design and use of ontologies. We observe that disparate backgrounds, languages, tools, and techniques are a major barrier to effective communication among people, organisations, and/or software s ..."
Abstract

Cited by 570 (3 self)
 Add to MetaCart
systems. We show how the development and implementation of an explicit account of a shared understanding (i.e. an `ontology') in a given subject area, can improve such communication, which in turn, can give rise to greater reuse and sharing, interoperability, and more reliable software. After
Logical foundations of objectoriented and framebased languages
 JOURNAL OF THE ACM
, 1995
"... We propose a novel formalism, called Frame Logic (abbr., Flogic), that accounts in a clean and declarative fashion for most of the structural aspects of objectoriented and framebased languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods, ..."
Abstract

Cited by 880 (64 self)
 Add to MetaCart
, encapsulation, and others. In a sense, Flogic stands in the same relationship to the objectoriented paradigm as classical predicate calculus stands to relational programming. Flogic has a modeltheoretic semantics and a sound and complete resolutionbased proof theory. A small number of fundamental concepts
A Theory of Diagnosis from First Principles
 ARTIFICIAL INTELLIGENCE
, 1987
"... Suppose one is given a description of a system, together with an observation of the system's behaviour which conflicts with the way the system is meant to behave. The diagnostic problem is to determine those components of the system which, when assumed to be functioning abnormally, will explain ..."
Abstract

Cited by 1117 (5 self)
 Add to MetaCart
Suppose one is given a description of a system, together with an observation of the system's behaviour which conflicts with the way the system is meant to behave. The diagnostic problem is to determine those components of the system which, when assumed to be functioning abnormally, will explain the discrepancy between the observed and correct system behaviour. We propose a general theory for this problem. The theory requires only that the system be described in a suitable logic. Moreover, there are many such suitable logics, e.g. firstorder, temporal, dynamic, etc. As a result, the theory accommodates diagnostic reasoning in a wide variety of practical settings, including digital and analogue circuits, medicine, and database updates. The theory leads to an algorithm for computing all diagnoses, and to various results concerning principles of measurement for discriminating among competing diagnoses. Finally, the theory reveals close connections between diagnostic reasoning and nonmonotonic reasoning.
Results 1  10
of
111,806