Results 251 to 260 of about 47,472 (286)

Existence of simple propositional formulas

Information Processing Letters, 1990
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On meta complexity of propositional formulas and propositional proofs

Archive for Mathematical Logic, 2008
Proof complexity is usually measured by the number of the symbols used in the proof, or by the number of proof steps. Likewise the size of a formula is taken to be the number of its symbols. The analysis of the minimal proof size as a function of the tautology size is the core of propositional proof complexity.
openaire   +3 more sources

Reducing Separation Formulas to Propositional Logic

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.
Randal E. Bryant, Sanjit A. Seshia, Ofer Strichman   +2 more
openaire   +1 more source

Mining-based compression approach of propositional formulae

Proceedings of the 22nd ACM international conference on Information & Knowledge Management, 2013
In this paper, we propose a first application of data mining techniques to propositional satisfiability. Our proposed mining based compression approach aims to discover and to exploit hidden structural knowledge for reducing the size of propositional formulae in conjunctive normal form (CNF).
Said Jabbour, Lakhdar Sais, Yakoub Salhi, Takeaki Uno   +3 more
openaire   +1 more source

Propositional Logic: Formulas, Models, Tableaux

2012
Propositional logic is a simple logical system that is the basis for all others. Propositions are claims like ‘one plus one equals two’ and ‘one plus two equals two’ that cannot be further decomposed and that can be assigned a truth value of true or false.
openaire   +1 more source

Semantic minimization of 3-valued propositional formulae

Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, 2003
This paper presents an algorithm for a non-standard logic-minimization problem that arises in 3-valued propositional logic. The problem is motivated by the potential for obtaining better answers in applications that use 3-valued logic. An answer of 0 or 1 provides precise (definite) information; an answer of 1/2 provides imprecise (indefinite ...
T. Reps, A. Loginov, M. Sagiv
openaire   +1 more source

Propositional Calculus: Formulas, Models, Tableaux

2001
A data type consists of a set of values and a set of predefined operators on those values. For example, in integer arithmetic the values are {..., −2, −1, 0, 1, 2,...} and the operators are {+, −, *, /}. The selection of these operators is arbitrary in the sense that other operators such as mod and abs could be added to the set.
openaire   +1 more source

Public and Secret Forgetting of Propositional Formulas

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 ...
Ángel Nepomuceno-Fernández, Enrique Sarrión-Morrillo, Fernando Soler-Toscano, Fernando R. Velázquez-Quesada   +3 more
openaire   +1 more source

Feature Models, Grammars, and Propositional Formulas

2005
Feature models are used to specify members of a product-line. Despite years of progress, contemporary tools often provide limited support for feature constraints and offer little or no support for debugging feature models. We integrate prior results to connect feature models, grammars, and propositional formulas.
openaire   +1 more source

On Real-Valued Evaluation of Propositional Formulas

2012
Arguably, [0,1]-valued evaluation of formulas is dominant form of representation of uncertainty, believes, preferences and so on despite some theoretical issues - most notable one is incompleteness of any unrestricted finitary formalization. We offer an infinitary propositional logic (formulas remain finite strings of symbols, but we use infinitary ...
Aleksandar Perović, Dragan Doder, Zoran Ognjanović   +2 more
openaire   +1 more source