Results 11 to 20 of about 494,310 (275)
Disjunctive and conjunctive normal forms of pseudo-Boolean functions
Discrete Applied Mathematics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stephan Foldes, Peter L. Hammer
semanticscholar +4 more sources
Information modeling of the normal forms of logical functions in Maple system [PDF]
ITM Web of ConferencesThe article discusses possible ways to use the Maple computer algebra system to obtain perfect conjunctive and disjunctive normal forms. Computer algebra systems make it possible to expand the possibilities for creating, applying and using mathematical ...
Olenev Aleksandr +3 more
doaj +3 more sources
Extended Conjunctive Normal Form and An Efficient Algorithm for Cardinality Constraints [PDF]
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020 Satisfiability (SAT) and Maximum Satisfiability (MaxSAT) are two basic and important constraint problems with many important applications. SAT and MaxSAT are expressed in CNF, which is difficult to deal with cardinality constraints. In this paper, we introduce Extended Conjunctive Normal Form (ECNF), which expresses cardinality constraints ...
Zhendong Lei +2 more
openaire +2 more sources
A linear-time transformation of linear inequalities into conjunctive normal form [PDF]
Information Processing Letters, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
J. P. Warners
openaire +4 more sources
Linearity and regularity with negation normal form
Theoretical Computer Science, 2004 Proving completeness of NC-resolution under a linear restriction has been elusive; it is proved here for formulas in negation normal form. The proof uses a generalization of the AndersonBledsoe excess literal argument, which was developed for resolution.
Reiner Hähnle +2 more
semanticscholar +2 more sources
A Normal Form for Euler Diagrams with Shading
Diagrams, 2008 In logic, there are various normal forms for formulae; for example, disjunctive and conjunctive normal form for formulae of propositional logic or prenex normal form for formulae of predicate logic.
A. Fish, C. John, John Taylor
semanticscholar +2 more sources
The many benefits of putting stack filters into disjunctive or conjunctive normal form
Discrete Applied Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. Wild
openaire +2 more sources
A solver for QBFs in negation normal form
Constraints, 2009 Various problems in artificial intelligence can be solved by translating them into a quantified boolean formula (QBF) and evaluating the resulting encoding. In this approach, a QBF solver is used as a black box in a rapid implementation of a more general
Uwe Egly, M. Seidl, S. Woltran
semanticscholar +2 more sources
A Study of a Positive Fragment of Path Queries: Expressiveness, Normal Form and Minimization
Computer/law journal, 2009 We study the expressiveness of a positive fragment of path queries, denoted Path, on node-labeled trees documents. The expressiveness of Path is studied from two angles.
Yuqing Wu +3 more
semanticscholar +3 more sources
Mathematical Foundation of a Functional Implementation of the CNF Algorithm
Algorithms, 2023 The conjunctive normal form (CNF) algorithm is one of the best known and most widely used algorithms in classical logic and its applications. In its algebraic approach, it makes use in a loop of a certain well-defined operation related to the ...
Francisco Miguel García-Olmedo +2 more
doaj +1 more source