Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 221,894,042 papers from all fields of science
Search
Sign In
Create Free Account
Negation normal form
Known as:
NNF
, Negational normal form
, Normal form
In mathematical logic, a formula is in negation normal form if the negation operator (, not) is only applied to variables and the only other allowed…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Algebraic normal form
Binary decision diagram
Boolean algebra
Conjunctive normal form
Expand
Broader (1)
Propositional calculus
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Coarse-to-Fine PatchMatch for Dense Correspondence
Yunsong Li
,
Yinlin Hu
,
Rui Song
,
P. Rao
,
Yangli Wang
IEEE transactions on circuits and systems for…
2018
Corpus ID: 52291817
Although the matching technique has been studied in various areas of computer vision for decades, efficient dense correspondence…
Expand
2017
2017
Photocatalytic degradation of endocrine disruptor compounds in water over immobilized TiO2 photocatalysts
Kateřina Zatloukalová
,
L. Obalová
,
+5 authors
G. Słowik
2017
Corpus ID: 55681678
Recently, the fate of endocrine disruptors in environmentally relevant samples has attracted considerable attention…
Expand
2016
2016
In vivo and in vitro degradation of peptide YY 3 – 36 to inactive peptide YY 3 – 34 in humans
Signe Toräng
,
K. N. Bojsen-Møller
,
+4 authors
J. Holst
2016
Corpus ID: 26556142
Signe Toräng, Kirstine Nyvold Bojsen-Møller, Maria Saur Svane, Bolette Hartmann, Mette Marie Rosenkilde, Sten Madsbad, and Jens…
Expand
2016
2016
Solving QBF by Abstraction
Jesko Hecking-Harbusch
,
Leander Tentrup
International Symposium on Games, Automata…
2016
Corpus ID: 42730663
Many verification and synthesis approaches rely on solving techniques for quantified Boolean formulas (QBF). Consequently…
Expand
2010
2010
ABox Abduction in the Description Logic $\boldsymbol{\mathcal{ALC}}$
Szymon Klarman
,
U. Endriss
,
Stefan Schlobach
Journal of automated reasoning
2010
Corpus ID: 19591897
Due to the growing popularity of Description Logics-based knowledge representation systems, predominantly in the context of…
Expand
2009
2009
Prevalence of Fixed-Dose Combinations in Nepal: A Preliminary Study
A. Poudel
,
M. Ibrahim
,
P. Mishra
,
Subish Palaian
2009
Corpus ID: 72104357
Background: Though fixed dose combinations (FDCs), offer certain advantages in terms of patient compliance, their use is highly…
Expand
2008
2008
Bilattices, Intuitionism and Truth-knowledge Duality: Concepts and Foundations
Z. Majkic
J. Multiple Valued Log. Soft Comput.
2008
Corpus ID: 2165217
We propose a family of intuitionistic bilattices with full truth-knowledge duality (D-bilattices) for a logic programming. The…
Expand
2006
2006
Satisfiability Checking of Non-clausal Formulas Using General Matings
Himanshu Jain
,
Constantinos Bartzis
,
E. Clarke
International Conference on Theory and…
2006
Corpus ID: 16842758
Most state-of-the-art SAT solvers are based on DPLL search and require the input formula to be in clausal form (cnf). However…
Expand
2005
2005
A probabilistic nearest neighbor filter algorithm for tracking in a clutter environment
T. Song
,
D. G. Lee
,
Jonha Ryu
Signal Processing
2005
Corpus ID: 29552102
1993
1993
Syntactic Characterizations of Belief Change Operators
Alvaro del Val
International Joint Conference on Artificial…
1993
Corpus ID: 16347627
We provide syntactic characterizations for a number of propositional model-based belief revision and update operators proposed in…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE