scholarly journals A General Constructive Proof Technique

2005 ◽  
Vol 120 ◽  
pp. 31-43 ◽  
Author(s):  
Douglas Bridges ◽  
Luminiţa Vîţă
Keyword(s):  
Constructive Proof ◽  
Proof Technique

scholarly journals New Islands of Tractability of Cost-Optimal Planning

2008 ◽  
Vol 32 ◽  
pp. 203-288 ◽  
Author(s):  
M. Katz ◽  
C. Domshlak
Keyword(s):  
Constructive Proof ◽  
Optimal Planning ◽  
Constraint Optimization ◽  
State Variables ◽  
Proof Technique ◽  
Causal Graph ◽  
Intractable Problems ◽  
Causal Graphs ◽  
Almost All ◽  
Planning Problems

We study the complexity of cost-optimal classical planning over propositional state variables and unary-effect actions. We discover novel problem fragments for which such optimization is tractable, and identify certain conditions that differentiate between tractable and intractable problems. These results are based on exploiting both structural and syntactic characteristics of planning problems. Specifically, following Brafman and Domshlak (2003), we relate the complexity of planning and the topology of the causal graph. The main results correspond to tractability of cost-optimal planning for propositional problems with polytree causal graphs that either have O(1)-bounded in-degree, or are induced by actions having at most one prevail condition each. Almost all our tractability results are based on a constructive proof technique that connects between certain tools from planning and tractable constraint optimization, and we believe this technique is of interest on its own due to a clear evidence for its robustness.

scholarly journals Central and Local Limit Theorems for Numbers of the Tribonacci Triangle

Mathematics ◽  
2021 ◽  
Vol 9 (8) ◽  
pp. 880
Author(s):  
Igoris Belovas
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Normal Distribution ◽  
Rate Of Convergence ◽  
Limit Theorems ◽  
Local Limit Theorem ◽  
Local Limit ◽  
Constructive Proof ◽  
The Central Limit Theorem ◽  
Local Limit Theorems

In this research, we continue studying limit theorems for combinatorial numbers satisfying a class of triangular arrays. Using the general results of Hwang and Bender, we obtain a constructive proof of the central limit theorem, specifying the rate of convergence to the limiting (normal) distribution, as well as a new proof of the local limit theorem for the numbers of the tribonacci triangle.

Two variable implicational calculi of prescribed many-one degrees of unsolvability

1976 ◽  
Vol 41 (1) ◽  
pp. 39-44 ◽  
Author(s):  
Charles E. Hughes
Keyword(s):  
Decision Problems ◽  
Constructive Proof ◽  
Distinct Variable ◽  
The Family ◽  
Propositional Calculi ◽  
Degrees Of Unsolvability

AbstractA constructive proof is given which shows that every nonrecursive r.e. many-one degree is represented by the family of decision problems for partial implicational propositional calculi whose well-formed formulas contain at most two distinct variable symbols.

An axiomatic proof technique for parallel programs I

1976 ◽  
Vol 6 (4) ◽  
pp. 319-340 ◽  
Author(s):  
Susan Owicki ◽  
David Gries
Keyword(s):  
Parallel Programs ◽  
Proof Technique ◽  
Axiomatic Proof

A constructive proof for FLP

2004 ◽  
Vol 92 (2) ◽  
pp. 83-87 ◽  
Author(s):  
Hagen Völzer
Keyword(s):  
Constructive Proof

On a Constructive Proof of Kolmogorov’s Superposition Theorem

2009 ◽  
Vol 30 (3) ◽  
pp. 653-675 ◽  
Author(s):  
Jürgen Braun ◽  
Michael Griebel
Keyword(s):  
Constructive Proof ◽  
Superposition Theorem

A New Wet-proof Technique of Gas-diffusion Electrodes

1991 ◽  
Vol 20 (7) ◽  
pp. 1113-1116 ◽  
Author(s):  
Masahiro Watanabe ◽  
Chiyoka Shimura ◽  
Kazunori Tsurumi ◽  
Noriaki Hara
Keyword(s):  
Gas Diffusion ◽  
Proof Technique ◽  
Gas Diffusion Electrodes

Constructive Proof of Preisach Right Inverse With Applications to Inverse Compensation of Smart Actuators With Hysteresis

2014 ◽  
Vol 136 (6) ◽  
Author(s):  
Yangyang Dong ◽  
Hong Hu ◽  
Zijian Zhang
Keyword(s):  
Iterative Algorithm ◽  
Control Design ◽  
Geometric Interpretation ◽  
Constructive Proof ◽  
Preisach Model ◽  
Compensation Scheme ◽  
Fundamental Idea ◽  
Model Inversion ◽  
Significant Challenge ◽  
Piezoelectric Stack Actuator

Hysteresis poses a significant challenge for control of smart material actuators. If unaccommodated, the hysteresis can result in oscillation, poor tracking performance, and potential instability when the actuators are incorporated in control design. To overcome these problems, a fundamental idea in coping with hysteresis is inverse compensation based on the Preisach model. In this paper, we address systematically the problem of Preisach model inversion and its properties, employing the technique of three-step composition mapping and geometric interpretation of the Preisach model. A Preisach right inverse is achieved via the iterative algorithm proposed, which possesses same properties with the Preisach model. Finally, comparative experiments are performed on a piezoelectric stack actuator (PEA) to test the efficacy of the compensation scheme based on the Preisach right inverse.

Sign in / Sign up

Export Citation Format

Share Document