Results 151 to 160 of about 1,320,893 (348)
MCP: Learning Propositional Formulas from Binarized Data
, 2023 Miki Hermann, Gernot Salzer
openalex +2 more sources
Recipe‐Free Synthesis of Optimal Operation Trajectories for Batch Processes Based on Process Models
Chemie Ingenieur Technik, EarlyView.Optimal operation strategies for complete batch cycles that start and end in a cold and empty state are obtained based on an explicit formulation of all constraints and optimization. Benefits and limitations of the approach are assessed. A case study on a batch distillation column demonstrates improvement over a traditional recipe‐based benchmark ...
Torben Talis +3 more
wiley +1 more source
A Transformational Decision Procedure for Non-Clausal Propositional Formulas
, 2003 A. Sakharov
openalex +2 more sources
An efficient algorithm for testing propositional formulas
COMPUTING AND INFORMATICS, 2012 The paper deals with testing satisfiability of propositional logic programs represented as \(\alpha =C_1\land \dots \land C_n\), where the \(C_i\)'s are clauses. S.~Andrei introduced the following definitions and proved the following theorem. Denote: \[ \begin{aligned} r(C_1,\dots ,C_k) &= \Biggl|\text{atom}(\alpha)\setminus \Biggl \{A\mid A\in \bigcup
openaire +2 more sources
Random discrete probability measures based on a negative binomial process
Canadian Journal of Statistics, EarlyView.Abstract A distinctive functional of the Poisson point process is the negative binomial process for which the increments are not independent but are independent conditional on an underlying gamma variable. Using a new point process representation for the negative binomial process, we generalize the Poisson–Kingman distribution and its corresponding ...
Sadegh Chegini, Mahmoud Zarepour
wiley +1 more source
On the decidability of monadic first order logic in sequent calculus
O Que Nos Faz Pensar, 2016 In this article, a syntactical proof of decidability ofmonadic first-order logic (and of its completeness for finite models) is given. Theproof is obtained by adapting to the case of monadic logic, the proof given byKetonen/Schütte for first-order logic
Jean-Baptiste Joinet
doaj
How to measure statistical evidence and its strength: Bayes factors or relative belief ratios?
Canadian Journal of Statistics, EarlyView.Abstract Both the Bayes factor and the relative belief ratio satisfy the principle of evidence and are therefore valid measures of statistical evidence. Which of these measures of evidence is more appropriate? We argue here that there are questions concerning the validity of a commonly used definition of the Bayes factor based on a mixture prior, and ...
Luai Al‐Labadi +2 more
wiley +1 more source
Efficient digital quadratic unconstrained binary optimization solvers for SAT problems
New Journal of PhysicsBoolean satisfiability (SAT) is a propositional logic problem of determining whether an assignment of variables satisfies a Boolean formula. Many combinatorial optimization problems can be formulated in Boolean SAT logic—either as k -SAT decision ...
Robert Simon Fong +2 more
doaj +1 more source
A Logical Modeling of Severe Ignorance. [PDF]
J Philos Logic, 2023 Bonzio S +3 more
europepmc +1 more source
Modular reasoning about heap paths via effectively propositional formulas
, 2014 Shachar Itzhaky +5 more
openalex +1 more source