Resolution Principle in Uncertain Random Environment

2018 ◽  
Vol 26 (3) ◽  
pp. 1578-1588 ◽  
Author(s):  
Xiangfeng Yang ◽  
Jinwu Gao ◽  
Yaodong Ni
1999 ◽  
Vol 09 (PR10) ◽  
pp. Pr10-85-Pr10-87
Author(s):  
V. M. Vinokur

1999 ◽  
Vol 09 (PR10) ◽  
pp. Pr10-69-Pr10-71 ◽  
Author(s):  
P. Chauve ◽  
T. Giamarchi ◽  
P. Le Doussal

1978 ◽  
Vol 112 (987) ◽  
pp. 897-909 ◽  
Author(s):  
John H. Gillespie ◽  
Harry A. Guess
Keyword(s):  

1980 ◽  
Vol 3 (2) ◽  
pp. 235-268
Author(s):  
Ewa Orłowska

The central method employed today for theorem-proving is the resolution method introduced by J. A. Robinson in 1965 for the classical predicate calculus. Since then many improvements of the resolution method have been made. On the other hand, treatment of automated theorem-proving techniques for non-classical logics has been started, in connection with applications of these logics in computer science. In this paper a generalization of a notion of the resolution principle is introduced and discussed. A certain class of first order logics is considered and deductive systems of these logics with a resolution principle as an inference rule are investigated. The necessary and sufficient conditions for the so-called resolution completeness of such systems are given. A generalized Herbrand property for a logic is defined and its connections with the resolution-completeness are presented. A class of binary resolution systems is investigated and a kind of a normal form for derivations in such systems is given. On the ground of the methods developed the resolution system for the classical predicate calculus is described and the resolution systems for some non-classical logics are outlined. A method of program synthesis based on the resolution system for the classical predicate calculus is presented. A notion of a resolution-interpretability of a logic L in another logic L ′ is introduced. The method of resolution-interpretability consists in establishing a relation between formulas of the logic L and some sets of formulas of the logic L ′ with the intention of using the resolution system for L ′ to prove theorems of L. It is shown how the method of resolution-interpretability can be used to prove decidability of sets of unsatisfiable formulas of a given logic.


2002 ◽  
Vol 16 (3) ◽  
pp. 325-338 ◽  
Author(s):  
David Perry ◽  
M.J.M. Posner

We consider two model variants of a production-inventory system. The system is characterized by a producing machine which is susceptible to failure following which it must be repaired to make it operative again. The machine's production can also be stopped deliberately because of stocking capacity limitations. During ON periods the input into the buffer is continuous and uniform (until a threshold is reached), whereas during OFF periods the output from the buffer is a compound Poisson process. We are interested in computing the equilibrium content level process under the assumption that full backlogging is allowed. In the first model, variant OFF periods are independent of the demand process, and in the second variant, they are determined and controlled in accordance with a certain level crossing stopping rule.


Sign in / Sign up

Export Citation Format

Share Document