Presented herein is an efficient simulation technique enabling systematic investigation of the soft programming over-erased flash EEPROM cells. the simulation provides a method by which to find the optimal soft progra...
详细信息
this paper deals withthe two-level, partially stochastic optimization method named Two Level Adaptive Evolutionary Computation (TLAEC). New adaptation mechanism is embedded in the method. the aim of the paper is to p...
详细信息
ISBN:
(数字)9783540248446
ISBN:
(纸本)3540221239
this paper deals withthe two-level, partially stochastic optimization method named Two Level Adaptive Evolutionary Computation (TLAEC). New adaptation mechanism is embedded in the method. the aim of the paper is to present an algorithm based on TLAEC method, solving so-called development problem. A mathematical model of this problem assumes the form of mixed discrete-continuous programming. A concept of the algorithm is described in the paper and the proposed, new adaptation mechanism that is introduced in the algorithm is described in detail. the results of computation experiments as well as their analysis are also given.
We investigate rule dependency graphs and their colorings for characterizing the computation of answer sets of logic programs. We start from a characterization of answer sets in terms of totally colored dependency gra...
详细信息
ISBN:
(纸本)354020721X
We investigate rule dependency graphs and their colorings for characterizing the computation of answer sets of logic programs. We start from a characterization of answer sets in terms of totally colored dependency graphs. To a turn, we develop a series of operational characterizations of answer sets in terms of operators on partial colorings. In analogy to the notion of a derivation in proof theory, our operational characterizations are expressed as (non-deterministically formed) sequences of colorings, turning an uncolored graph into a totally colored one. this results in an operational framework in which different combinations of operators result in different formal properties. Among others, we identify the basic strategy employed by the noMoRe system and justify its algorithmic approach. Also, we distinguish Fitting's and well-founded semantics.
In the paper multi-robot environment with STRIPS representation is considered. Under some assumptions such problems can be modelled as a STRIPS system (for instance Block World environment) with one initial state and ...
详细信息
ISBN:
(纸本)3540221239
In the paper multi-robot environment with STRIPS representation is considered. Under some assumptions such problems can be modelled as a STRIPS system (for instance Block World environment) with one initial state and disjunction of goal states. If STRIPS planning problem is invertible then it is possible to apply machinery for planning in the presence of incomplete information to solve the inverted problem and then to find a solution for the original problem. To reduce computational complexity of this approach a transformation to Linear programming problem is proposed. Simulations illustrate the reduced problem.
Process of implementing operations' algorithms for ordered fuzzy numbers (OFN's)are presented. First version of the program in the Delphi environment is created that uses algorithms dedicated to trapezoidal-ty...
详细信息
ISBN:
(数字)9783540248446
ISBN:
(纸本)3540221239
Process of implementing operations' algorithms for ordered fuzzy numbers (OFN's)are presented. First version of the program in the Delphi environment is created that uses algorithms dedicated to trapezoidal-type membership relations (functions). More useful implementation is a Fuzzy Calculator which allows counting with OFN's of general type membership relations and is equipped with a graphical shell.
Present a corresponding point match algorithm based on "the Regulation of the Minimum Summation of Euclid Distance". this algorithm gives the regulation that makes the corresponding points match to the highe...
详细信息
ISBN:
(纸本)0780384075
Present a corresponding point match algorithm based on "the Regulation of the Minimum Summation of Euclid Distance". this algorithm gives the regulation that makes the corresponding points match to the highest accuracy according to the condition that the relative position is almost fixed for corresponding points in adjoining area if two images are acquired by means of multi-view. this match algorithm is realized by evolutionary programming. By experiment on PC, the result demonstrates that it can match the most corresponding points in low time cost.
Strong equivalence is an important property for nonmonotonic formalisms, allowing safe local changes to a nonmonotonic theory. this paper considers strong equivalence for nonmonotonic causal theories of the kind intro...
详细信息
ISBN:
(纸本)354020721X
Strong equivalence is an important property for nonmonotonic formalisms, allowing safe local changes to a nonmonotonic theory. this paper considers strong equivalence for nonmonotonic causal theories of the kind introduced by McCain and Turner. Causal theories T-1 and T-2 are strongly equivalent if, for every causal theory T, T-1 boolean OR T and T-2 boolean OR T are equivalent (that is, have the same causal models). the paper introduces a convenient characterization of this property in terms of so-called SE-models, much as was done previously for answer set programs and default theories. A similar result is provided for the nonmonotonic modal logic UCL. the paper also introduces a reduction from the problem of deciding strong equivalence of two causal theories to the problem of deciding equivalence of two sets of propositional formulas.
the language of nonmonotonic causal theories, defined by Norman McCain and Hudson Turner, is an important formalism for representing properties of actions. For causal theories of a special kind, called definite, a sim...
详细信息
ISBN:
(纸本)354020721X
the language of nonmonotonic causal theories, defined by Norman McCain and Hudson Turner, is an important formalism for representing properties of actions. For causal theories of a special kind, called definite, a simple translation into the language of logic programs under the answer set semantics is available. In this paper we define a similar translation for causal theories of a more general form, called almost definite. Such theories can be used, for instance, to characterize the transitive closure of a binary relation. the new translation leads to an implementation of a subclass of almost definite causal theories that employs the answer set solver SMODELS as the search engine.
We consider the simplification of logic programs under the stable-model semantics, with respect to the notions of strong and uniform equivalence between logic programs, respectively. Both notions have recently been co...
详细信息
ISBN:
(纸本)354020721X
We consider the simplification of logic programs under the stable-model semantics, with respect to the notions of strong and uniform equivalence between logic programs, respectively. Both notions have recently been considered for nonmonotonic logic programs (the latter dates back to the 1980s, though) and provide semantic foundations for optimizing programs with input. Extending previous work, we investigate syntactic and semantic rules for program transformation, based on proper notions of consequence. We furthermore provide encodings of these notions in answer-set programming, and give characterizations of programs which are semantically equivalent to positive and Horn programs, respectively. Finally, we investigate the complexity of program simplification and determining semantical equivalence, showing that the problems range between coNP and II2P complexity, and we present some tractable cases.
An extension of DLV by aggregates to simplify the encoding of the frequently occuring concepts is discussed. DLV is an efficient Answer Set programming (ASP) system which can implement the answer set semantics with va...
详细信息
ISBN:
(纸本)354020721X
An extension of DLV by aggregates to simplify the encoding of the frequently occuring concepts is discussed. DLV is an efficient Answer Set programming (ASP) system which can implement the answer set semantics with various language extensions. the semantics of programs without aggregates is provided in BLR00 as an extension of the classical answer set semantics given in GL91. the strong point of DLV is its robust and efficient implementation, which integrates algorithms and heuristics from the field of nonmonotic reasoning.
暂无评论