Results 291 to 300 of about 1,320,893 (348)

On meta complexity of propositional formulas and propositional proofs

Archive for Mathematical Logic, 2008
A new approach to defining complexity of propositional formulas and proofs is suggested. Instead of measuring the size of these syntactical structures in the propositional language, the article suggests to define the complexity by the size of external descriptions of such constructions.
openaire   +3 more sources

Existence of simple propositional formulas

Information Processing Letters, 1990
Abstract First we discuss the problem of deciding whether there exists an equivalent Horn-, definite Horn- or quadratic formula for a propositional formula. Furthermore we consider renaming of formulas, i.e., atoms of the formula can be replaced by their complements, and show that for Horn-formulas the renaming-equivalence can be solved in O(n3) time
openaire   +2 more sources

Scalable formula decomposition for propositional satisfiability

Proceedings of the Third C* Conference on Computer Science and Software Engineering, 2010
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or probabilistic reasoning. The depth-first search DPLL procedure is in practice the most efficient complete algorithm to date.
Roger Villemaire, Anthony Monnet
openaire   +2 more sources

Reducing Separation Formulas to Propositional Logic [PDF]

, 2003
Abstract : We show a reduction to propositional logic from a Boolean combination of inequalities of the form Vi is greater or equal Vj + C and Vi is less than Vj + C where C is a constant, and Vi, Vj are variables of type real or integer. Equalities and uninterpreted functions can be expressed in this logic as well.
Ofer Strichman, Sanjit A. Seshia, Randal E. Bryant   +2 more
openaire   +1 more source

Propositions on the robustness of multistep formulae

Numerical Functional Analysis and Optimization, 1996
Classical analysis of linear multistep formulae (LMFs) for initial-value problems in ordinary differential equations (ODES) has concentrated on problems satisfying uniform Lipschitz or one-sided Lipschitz conditions, and corresponding stability models.
openaire   +2 more sources

CONJUNCTIVELY INDECOMPOSABLE FORMULAS IN PROPOSITIONAL CALCULI

Mathematics of the USSR-Izvestiya, 1969
Formulas in intuitionistic propositional calculus and its subsystems are studied that cannot be decomposed into a proper conjunction.
openaire   +3 more sources

Public and Secret Forgetting of Propositional Formulas [PDF]

, 2015
This paper presents two operations over Kripke models for representing the act of an agent forgetting the truth-value of a given propositional formula. The first is a form of 'public' forgetting built over previous monoagent proposals after which all agents know that the forgetful one has indeed forgotten the given formula; the second is a form of ...
Fernando R. Velázquez-Quesada, Ángel Nepomuceno-Fernández, Enrique Sarrión-Morrillo, Fernando Soler-Toscano   +3 more
openaire   +1 more source

Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters (Short Paper)

International Conference on Principles and Practice of Constraint Programming, 2021
T. Korhonen, Matti Järvisalo
semanticscholar   +1 more source

Proposition of a General Formula for Price Indices

Communications in Statistics - Theory and Methods, 2012
In this article, we propose a general formula for aggregative price indices that satisfies most postulates coming from the axiomatic price index theory. We show that the ideal Fisher index, Laspeyres and Paasche formulas, and a lot of other indices are particular cases of the proposed formula.
openaire   +2 more sources

On formulas of one variable in intuitionistic propositional calculus

Journal of Symbolic Logic, 1960
McKinsey and Tarski [3] described Gödel's proof that the number of Brouwerian-algebraic functions is infinite. They gave an example of a sequence of infinitely many distinct Brouwerian-algebraic functions of one argument, which means that there are infinitely many non-equivalent formulas of one variable in the intuitionistic propositional calculus LJ ...
openaire   +3 more sources