Results 301 to 310 of about 1,320,893 (348)
Some of the next articles are maybe not open access.
On Real-Valued Evaluation of Propositional Formulas
2012Arguably, [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 ...
Zoran Ognjanović +2 more
openaire +2 more sources
Prop revisited: propositional formula as abstract domain for groundness analysis
[1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, 1991Agostino Cortesi +2 more
semanticscholar +1 more source
A Simplifier for Propositional Formulas With Many Binary Clauses
IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), 2004Deciding whether a propositional formula in conjunctive normal form is satisfiable (SAT) is an NP-complete problem. The problem becomes linear when the formula contains binary clauses only. Interestingly, the reduction to SAT of a number of well-known and important problems--such as classical AI planning and automatic test pattern generation for ...
openaire +3 more sources
Random Generator of Formulas of Propositional Calculus [PDF]
, 1988 Probabilistic algorithm for the generating formulas of pro-positional calculus is presented. Some of its properties are analyzed. Generated formulas contain propositional indeterminates x1,x2,x3,..., logical constants T (true) and F (false), and any of binary logical connectives. Instead of ┐ϕ subformulas ϕ → F are used.
openaire +1 more source
The Complexity of the Warranted Formula Problem in Propositional Argumentation
Journal of Logic and Computation, 2010R. Hirsch, Nikos Gorogiannis
semanticscholar +1 more source
Propositional Logic: Formulas, Models, Tableaux
2012Propositional 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 +2 more sources
Feature Models, Grammars, and Propositional Formulas
2005Feature 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 +2 more sources
Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation
International Conference on Principles and Practice of Constraint Programming, 2017Takehide Soh +3 more
semanticscholar +1 more source
A DPLL Procedure for the Propositional Gödel Logic
International Joint Conference on Computational Intelligence, 2018Dušan Guller
semanticscholar +1 more source