Results 221 to 230 of about 112,147 (264)
Some of the next articles are maybe not open access.
Constructive Induction in Theory Refinement
1991Abstract This paper presents constructive induction techniques recently added to the EITHER theory refinement system. These additions allow EITHER to handle arbitrary gaps at the “top,― “middle,― and/or “bottom― of an incomplete domain theory. Intermediate concept utilization employs existing rules in the theory to derive higher-level features for ...
Raymond J. Mooney, Dirk Ourston
openaire +1 more source
On a Theory of Mesh-Refinement Processes
SIAM Journal on Numerical Analysis, 1980A general theory of mesh-refinement processes is developed. The fundamental structure is a locally finite, rooted tree with nodes representing the subdivision cells. The possible meshes then constitute a distributive lattice. Under mild conditions on the given cell-size and error-indicator functions a local Pareto-type optimality property is introduced
openaire +1 more source
Revision Cost for Theory Refinement
1991Abstract This paper describes a new method for incremental refinement of the approximate domain theory. The method presented here is based a concept of on revision cost which is a measure of tree transformation. The method is applied to a new system of integrated learning, which combines empirical learning and explanation-based learning.
openaire +1 more source
Experiments on Theory Refinement
2002In this chapter, we apply the C-IL2P system to two problems of DNA classification, which have become benchmark data sets for testing the accuracy of machine learning systems. We compare the results obtained by different neural, symbolic and hybrid inductive learning systems.
Artur S. d’Avila Garcez +2 more
openaire +1 more source
Refinement theorems in resolution theory
1970The paper discusses some basic refinements of the Resolution Principle which are intended to improve the speed and efficiency of theorem-proving programs based on this rule of inference. It is proved that two of the refinements preserve the logical completeness of the proof procedure when used separately, but not when used in conjunction.
openaire +1 more source
SPIE Proceedings, 1986
Refinements in the theory of XAFS (x-ray absorption fine structure) are discussed. These include spherical wave corrections and multiple scattering contributions. The conventional theory, with these refinements included, can be recovered using effective scattering amplitudes, appropriate Debye-Waller factors, and many-body amplitude reduction factors.
openaire +1 more source
Refinements in the theory of XAFS (x-ray absorption fine structure) are discussed. These include spherical wave corrections and multiple scattering contributions. The conventional theory, with these refinements included, can be recovered using effective scattering amplitudes, appropriate Debye-Waller factors, and many-body amplitude reduction factors.
openaire +1 more source
2020
This chapter presents a thorough introduction to Centering Theory. Centering Theory is a computational semantic theory concerned with local coherence and semantic entity salience. It differentiates various levels of discourse units, such as center, utterance, and discourse segments, within a given discourse.
openaire +1 more source
This chapter presents a thorough introduction to Centering Theory. Centering Theory is a computational semantic theory concerned with local coherence and semantic entity salience. It differentiates various levels of discourse units, such as center, utterance, and discourse segments, within a given discourse.
openaire +1 more source
1997
Examples of both program and data refinement have been shown. We would like to be able to choose at each refinement stage whether to do algorithmic or data refinement. The rules for data refinement given so far only allow specifications to be refined; to develop executable code it is necessary to do all the data refinement first followed by the ...
openaire +1 more source
Examples of both program and data refinement have been shown. We would like to be able to choose at each refinement stage whether to do algorithmic or data refinement. The rules for data refinement given so far only allow specifications to be refined; to develop executable code it is necessary to do all the data refinement first followed by the ...
openaire +1 more source
Theory and Algorithm for Rule Base Refinement
2007Rule base refinement plays an important role in enhancing the efficacy and efficiency of utilizing a rule base. A rule base concerns three types of redundancies: implication-rule redundancy, abstraction-rule redundancy and dead-end-condition redundancy.
Hai Zhuge, Yunchuan Sun, Weiyu Guo
openaire +1 more source
A theory of program refinement.
2004We give a canonical program refinement calculus based on the lambda calculus and classical first-order predicate logic, and study its proof theory and semantics. The intention is to construct a metalanguage for refinement in which basic principles of program development can be studied.
openaire +1 more source