Relevant bibliographies by topics / Proof for negation

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Proof for negation'

Author: Grafiati
Published: 2 June 2025
Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Proof for negation.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Proof for negation"

1

Trafford, James. "Co-constructive Logics for Proofs and Refutations." Studia Humana 3, no. 4 (2015): 22–40. http://dx.doi.org/10.1515/sh-2015-0004.

Full text
Abstract:
Abstract This paper considers logics which are formally dual to intuitionistic logic in order to investigate a co-constructive logic for proofs and refutations. This is philosophically motivated by a set of problems regarding the nature of constructive truth, and its relation to falsity. It is well known both that intuitionism can not deal constructively with negative information, and that defining falsity by means of intuitionistic negation leads, under widely-held assumptions, to a justification of bivalence. For example, we do not want to equate falsity with the non-existence of a proof sin
APA, Harvard, Vancouver, ISO, and other styles
2

Ahmed, Othman. "Proof of Applicatio and its Nodal Applications." Islamic Sciences Journal 11, no. 10 (2023): 252–72. http://dx.doi.org/10.25130/jis.20.11.10.11.

Full text
Abstract:

 
 
 
 ABSTRACT
 
 This research labeled (the proof of application and its nodal applications) is considered one of the researches that dealt with one of the important proofs of speech scholars, which are used in response to some philosophers' concepts in the occurrence of the world, the negation of the absent, and the infinite dimensions. This research deals with the linguistic definition of the proof and the meaning of Application, it deals dealt with the idiomatic aspect of this proof, the types of proofs used by scholars of speech in establishing Islamic beli
APA, Harvard, Vancouver, ISO, and other styles
3

Raja, N. "A Negation-free Proof of Cantor's Theorem." Notre Dame Journal of Formal Logic 46, no. 2 (2005): 231–33. http://dx.doi.org/10.1305/ndjfl/1117755152.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

STÄRK, ROBERT F. "CUT-PROPERTY AND NEGATION AS FAILURE." International Journal of Foundations of Computer Science 05, no. 02 (1994): 129–64. http://dx.doi.org/10.1142/s0129054194000086.

Full text
Abstract:
What is the semantics of Negation-as-Failure in logic programming? We try to answer this question by proof-theoretic methods. A rule based sequent calculus is used in which a sequent is provable if, and only if, it is true in all three-valued models of the completion of a logic program. The main theorem is that proofs in the sequent calculus can be transformed into SLDNF-computations if, and only if, a program has the cut-property. A fragment of the sequent calculus leads to a sound and complete semantics for SLDNF-resolution with substitutions. It turns out that this version of SLDNF-resoluti
APA, Harvard, Vancouver, ISO, and other styles
5

Bílková, Marta, and Almudena Colacito. "Proof Theory for Positive Logic with Weak Negation." Studia Logica 108, no. 4 (2019): 649–86. http://dx.doi.org/10.1007/s11225-019-09869-y.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kamide, Norihiro. "Concept Finding Proofs." Journal of Advanced Computational Intelligence and Intelligent Informatics 15, no. 7 (2011): 777–84. http://dx.doi.org/10.20965/jaciii.2011.p0777.

Full text
Abstract:
We propose a proof-theoretical way of obtaining detailed and precise information on conceptual hierarchies. The notion of concept finding proof, which represents a hierarchy of concepts, is introduced based on a substructural logic with mingle and strong negation. Mingle, which is a structural inference rule, is used to represent a process for finding a more general (or specific) concept than some given concepts. Strong negation, which is a negation connective, is used to represent a concept inverse operator. The problem for constructing a concept finding proof is shown to be decidable in PTIM
APA, Harvard, Vancouver, ISO, and other styles
7

Im, Hyeonseung. "On Correspondence between Selective CPS Transformation and Selective Double Negation Translation." Mathematics 9, no. 4 (2021): 385. http://dx.doi.org/10.3390/math9040385.

Full text
Abstract:
A double negation translation (DNT) embeds classical logic into intuitionistic logic. Such translations correspond to continuation passing style (CPS) transformations in programming languages via the Curry-Howard isomorphism. A selective CPS transformation uses a type and effect system to selectively translate only nontrivial expressions possibly with computational effects into CPS functions. In this paper, we review the conventional call-by-value (CBV) CPS transformation and its corresponding DNT, and provide a logical account of a CBV selective CPS transformation by defining a selective DNT
APA, Harvard, Vancouver, ISO, and other styles
8

SUCHENEK, MAREK A. "APPLICATIONS OF LYNDON HOMOMORPHISM THEOREMS TO THE THEORY OF MINIMAL MODELS." International Journal of Foundations of Computer Science 01, no. 01 (1990): 49–59. http://dx.doi.org/10.1142/s0129054190000059.

Full text
Abstract:
This paper contains, among others, a concise proof (proof 6.2) of the following fact (theorem 2.7): For every ∀∪Neg-theory Σ and every positive sentence φ, [Formula: see text] It is demonstrated in this paper (corollary 5.2) that the necessary and sufficient condition for φ, guaranteeing the truthfulness of the above equivalence for every Σ⊆∀, is that φ is equivalent to a sentence which does not contain in a scope of negation an occurrence of a relation symbol other than the equality symbol. The proofs have been constructed using classical model-theoretic tools, thus supporting the thesis that
APA, Harvard, Vancouver, ISO, and other styles
9

Dr, THIERRY TSONO MOWELLE. "Negation in Lekuwa (C27)." International Journal of Arts and Social Science 05, no. 11 (2023): 194–206. https://doi.org/10.5281/zenodo.7758697.

Full text
Abstract:
This paper investigates sentential negation in Lekuwa within the framework of Principles and Parameters developed by Noam Chomsky in the 1980’s [1, 2, 3]. Sentential negation is expressed by the negative markers te, ka, lawi, o-tano and the negative indefinite o moto. The base and surface position of te, ka and lawi is post-verbal, while that of otano and o moto is preverbal. It is demonstrated that negation in Lekuwa is a functional head which projects a NegP. Its head status is due to the fact that it selects a non-finite VP as complement, triggers the leftward movement of the object N
APA, Harvard, Vancouver, ISO, and other styles
10

Francez, Nissim. "Another plan for negation." Australasian Journal of Logic 16, no. 5 (2019): 159. http://dx.doi.org/10.26686/ajl.v16i5.5190.

Full text
Abstract:
The paper presents a plan for negation, proposing a paradigm shift from the Australian plan for negation, 
 leading to a family of contra-classical logics. The two main ideas are the following: 
 
 Instead of shifting points of evaluation (in a frame), shift the evaluated formula. 
 Introduce an incompatibility set for every atomic formula, extended to any compound formula, and impose the condition on valuations that a formula evaluates to true iff all the formulas in its incompatibility set evaluate to false. Thus, atomic sentences are not independent in their truth-values
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Proof for negation"

1

Kreuger, Per. "Computational Issues in Calculi of Partial Inductive Definitions." Doctoral thesis, Decisions, Networks and Analytics lab, 1995. http://urn.kb.se/resolve?urn=urn:nbn:se:ri:diva-21196.

Full text
Abstract:
We study the properties of a number of algorithms proposed to explore the computational space generated by a very simple and general idea: the notion of a mathematical definition and a number of suggested formal interpretations ofthis idea. Theories of partial inductive definitions (PID) constitute a class of logics based on the notion of an inductive definition. Formal systems based on this notion can be used to generalize Horn-logic and naturally allow and suggest extensions which differ in interesting ways from generalizations based on first order predicate calculus. E.g. the notion of comp
APA, Harvard, Vancouver, ISO, and other styles
2

Sanz, Wagner de Campos. "Uma investigação acerca das regras para a negação e o absurdo em dedução natural." [s.n.], 2006. http://repositorio.unicamp.br/jspui/handle/REPOSIP/280089.

Full text
Abstract:
Orientador: Marcelo Esteban Coniglio<br>Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciencias Humanas<br>Made available in DSpace on 2018-08-07T00:21:55Z (GMT). No. of bitstreams: 1 Sanz_WagnerdeCampos_D.pdf: 2570437 bytes, checksum: 15352759879927665653f4fc165c3703 (MD5) Previous issue date: 2006<br>Resumo: O objetivo desta tese é o de propor uma elucidação da negação e do absurdo no âmbito dos sistemas de dedução natural para as lógicas intuicionista e clássica. Nossa investigação pode ser vista como um desenvolvimento de uma proposta apresentada por Russe
APA, Harvard, Vancouver, ISO, and other styles
3

Brage, Jens. "A Natural Interpretation of Classical Proofs." Doctoral thesis, Stockholm : Dept. of mathematics, Stockholm university, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-913.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Puerini, Kathryn Margherita. "Negative Proof." The University of Montana, 2009. http://etd.lib.umt.edu/theses/available/etd-06072009-204047/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Moeller, Mary. "Negative Perceptions on Aging: A Proof of Concept Study." Bowling Green State University / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1522841966256983.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hägg, Alice. "Scalable magnetic-based isolation of differentiated stem cells : A Proof of Concept study." Thesis, Linköpings universitet, Biofysik och bioteknik, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-178866.

Full text
Abstract:
Cell therapy is considered as one of the most promising fields within modern science and medicine. This field offers endless of possibilities for treating, and potentially cure, some of humanities most life threatening diseases such as cancer, heart failure, neurodegenerative diseases and diabetes. Within these treatments living cells are implanted into the patient to repair or possibly replace diseased cells. Hence, to ensure the safety and efficacy of future cell therapy products selective and quantitative removal of impurities, such as potentially teratoma forming pluripotent stem cells, is
APA, Harvard, Vancouver, ISO, and other styles
7

Škop, Miroslav. "Dokazování negativních skutečností." Master's thesis, 2019. http://www.nusl.cz/ntk/nusl-405468.

Full text
Abstract:
This thesis deals with the subject of proving negatives, i. e. proving non-existence of an object, a status or a process. The author of the thesis provides the reader with the definition of a negative and with a list of negatives mentioned in the case law of Czech public authorities. Also, the author analyses selected case law of Czech courts and describes proving negatives in specific cases. The thesis is divided into six chapters. The first chapter provides the definition of a negative. In this chapter the author points out potential problems linked to the identification of a negative, espec
APA, Harvard, Vancouver, ISO, and other styles
8

De, Martino Daniela. "An attempt to define the therapeutic use of Dipyridamole in triple-negative breast-cancer patients-a proof of concept in animal model-." Tesi di dottorato, 2013. http://www.fedoa.unina.it/9200/1/demartino_daniela_25.pdf.

Full text
Abstract:
Dipyridamole belongs to the category of antiplatelet drugs commonly used in cardiovascular disease, here we want test its effectiveness in the treatment of triple-negative breast-cancer. In-vitro assays were used to analyze the perturbations induced by dipyridamole on the cell cycle, on cell growth and motility. We also want to assess the dipyridamole action on Wnt, NF-kB and ERK1/2-MAPK signaling pathways that are overactive in such tumors. Here we provide the evidence that dipyridamole is able to perturb also in vivo the activation of these important pathways and inhibit the infiltration of
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Proof for negation"

1

Tranchini, Luca. Proof and truth: An anti-realist perspective. Edizioni ETS, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Priest, Graham. An Introduction to Non-Classical Logic: From If to Is. 2nd ed. Cambridge University Press, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Stetter-Lingemann, Andrea. Die materielle Rechtskraft eines die negative Feststellungsklage abweisenden Urteils: Insbesondere bei unrichtiger Beweislastverteilung. s.n.], 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Proof and Falsity: A Logical Investigation. Cambridge University Press, 2019.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kürbis, Nils. Proof and Falsity: A Logical Investigation. University of Cambridge ESOL Examinations, 2021.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kürbis, Nils. Proof and Falsity: A Logical Investigation. Cambridge University Press, 2019.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bredakis, John. Proof by Contradiction of the Negation of Riemann Hypothesis. GRIN Verlag GmbH, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Tennant, Neil. The Logic of Evaluation. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198777892.003.0003.

Full text
Abstract:
Sentences of propositional logic may be verified or falsified with respect to an atomic basis. Verifications and falsifications are co-inductively defined. The rules generating them justify the truth tables row by row, left to right. Model-relative rules verifying universals or falsifying existentials can generate ‘infinite sideways branchings’ within evaluations. If a sentence has both a verification and a falsification, then a particular atom occurs with its negation in the basis. This presages how any ‘failure’ of transitivity with any two core proofs is offset by proof that their combined
APA, Harvard, Vancouver, ISO, and other styles
9

Rumfitt, Ian, and Bradley Armour-Garb. The Liar without Truth. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780199896042.003.0008.

Full text
Abstract:
Liar sentences say nothing, according to this chapter—which, it claims, we can, in effect, prove. But extending the proof as the chapter does appears to result in revenge. The solution to this problem is to restrict the laws of logic by distinguishing expressing a falsehood from failing to express a truth. But the question that presses is how we can signify that a given sentence—a liar sentence, for example—fails to express a truth without being mired in paradox. To this end, the chapter revisits the sort of bilateral system that Rumfitt (2000) has discussed. The chapter shows that there is a
APA, Harvard, Vancouver, ISO, and other styles
10

Unsaying God: Negative Theology in Medieval Islam. Oxford University Press, 2019.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Proof for negation"

1

Storoshenko, Dennis R., and Mahyar Nakhaei. "Chapter 11. The nature and licensing of hi:tʃ elements in Persian." In Advances in Iranian Linguistics II. John Benjamins Publishing Company, 2023. http://dx.doi.org/10.1075/cilt.361.11sto.

Full text
Abstract:
This paper examines the nature of elements such as hi:tʃkӕs “anyone” in Persian, which have been described as either Negative Polarity Items (Taleghani 2006) or Negative Concord Items (Kwak 2010) in prior literature. Such claims have typically been used to motivate analyses of Persian NegP as being high in the clause structure, above TP. This is in contrast to more recent analyses which have argued for a low position of negation (Kahnemuyipour 2017). Here, we present experimental evidence showing that c-commanding negation is not sufficient for licensing hi:tʃ elements, unlike English any. We
APA, Harvard, Vancouver, ISO, and other styles
2

Hill, James T. "Why Not Nothing? Meillassoux's Second Figure of Faciality and Metaphysical Nihilism." In Speculations VI. punctum books, 2015. https://doi.org/10.21983/p3.0122.1.06.

Full text
Abstract:
According to Quentin Meil-lassoux, the principle of sufficient reason (‘PSR’) is a philosophi-cal fifth postulate. His project is to carry out an “adventure” analogous to that of non-Euclidean geometry, this time within philosophy.1 But whereas Lobachevsky developed his hyper-bolic geometry without first trying to demonstrate that the fifth postulate was false (i.e. without trying to demonstrate the consistency of Euclidean geometry sans the fifth postulate, with its negation), Meillassoux believes he can demonstrate that the PSR is (absolutely) false.2 Indeed, it is his view that this proof i
APA, Harvard, Vancouver, ISO, and other styles
3

Möhle, Sibylle. "An Abstract CNF-to-d-DNNF Compiler Based on Chronological CDCL." In Frontiers of Combining Systems. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-43369-6_11.

Full text
Abstract:
AbstractWe present Abstract CNF2dDNNF, a calculus describing an approach for compiling a formula in conjunctive normal form (CNF) into deterministic negation normal form (d-DNNF). It combines component-based reasoning with a model enumeration approach based on conflict-driven clause learning (CDCL) with chronological backtracking. Its properties, such as soundness and termination, carry over to implementations which can be modeled by it. We provide a correctness proof and a detailed example. The main conceptual differences to currently available tools targeting d-DNNF compilation are discussed
APA, Harvard, Vancouver, ISO, and other styles
4

Escardó, Martín, and Paulo Oliva. "The Peirce Translation and the Double Negation Shift." In Programs, Proofs, Processes. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13962-8_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bramanti, Marco, and Giancarlo Travaglini. "Negations and Indirect Proofs." In Studying Mathematics. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-91355-1_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Tobias, Michael Charles, and Jane Gray Morrison. "Unthinkable Nullities, Negative Proofs." In On the Nature of Ecological Paradox. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-64526-7_50.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Moosbrugger, Marcel, Ezio Bartocci, Joost-Pieter Katoen, and Laura Kovács. "Automated Termination Analysis of Polynomial Probabilistic Programs." In Programming Languages and Systems. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72019-3_18.

Full text
Abstract:
AbstractThe termination behavior of probabilistic programs depends on the outcomes of random assignments. Almost sure termination (AST) is concerned with the question whether a program terminates with probability one on all possible inputs. Positive almost sure termination (PAST) focuses on termination in a finite expected number of steps. This paper presents a fully automated approach to the termination analysis of probabilistic while-programs whose guards and expressions are polynomial expressions. As proving (positive) AST is undecidable in general, existing proof rules typically provide su
APA, Harvard, Vancouver, ISO, and other styles
8

Yuan, Li Yan, and Jia Huai You. "On the extension of logic programming with negation through uniform proofs." In Logic Programming and Nonmonotonic Reasoning. Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-59487-6_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Dorzweiler, Olga, Thomas Flamm, Andreas Krebs, and Michael Ludwig. "Positive and Negative Proofs for Circuits and Branching Programs." In Descriptional Complexity of Formal Systems. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-09704-6_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Seifert, Christian, Sascha Trostorff, and Marcus Waurick. "Causality and a Theorem of Paley and Wiener." In Evolutionary Equations. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-89397-2_8.

Full text
Abstract:
AbstractIn this chapter we turn our focus back to causal operators. In Chap. 10.1007/978-3-030-89397-2_5 we found out that material laws provide a class of causal and autonomous bounded operators. In this chapter we will present another proof of this fact, which rests on a result which characterises functions in $$L_2(\mathbb {R};H)$$ L 2 ( ℝ ; H ) with support contained in the non-negative reals; the celebrated Theorem of Paley and Wiener. With the help of this theorem, which is interesting in its own right, the proof of causality for material laws becomes very easy. At a first glance it seem
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Proof for negation"

1

Csaszar, Tiberiu, Cosmin Colda, Danut Grecea, Gabriela Pupazan, and Alexandru Beldiman. "PRACTICAL ASPECTS OF IMPROPER INSTALLATION AND MAINTENANCE OF EQUIPMENT INTENDED TO BE USED IN POTENTIALLY EXPLOSIVE AREAS AND RECOMMENDED MEASURES." In 24th SGEM International Multidisciplinary Scientific GeoConference 24. STEF92 Technology, 2024. https://doi.org/10.5593/sgem2024/1.1/s06.80.

Full text
Abstract:
In the evaluation activity of technical equipment intended to be used in potentially explosive atmospheres, by national and international legislation, non-compliant aspects were often reported regarding the choice, installation and maintenance of this explosion-proof equipment. The following main aspects were pointed out: the equipment that was initially chosen and installed appropriately for the specific application but later, over time, improperly maintained; respectively, the situation in which they were inappropriately selected from the beginning for the intended application, by ignoring t
APA, Harvard, Vancouver, ISO, and other styles
2

S, Srivatzen, Kavitha BS, and Sundararajan Asokan. "SU-8 coated etched fiber Bragg grating sensors: A versatile platform for detection of any biomarker using antibody-antigen chemistry." In CLEO: Applications and Technology. Optica Publishing Group, 2024. http://dx.doi.org/10.1364/cleo_at.2024.jtu2a.184.

Full text
Abstract:
Biomarker detection is pivotal in various fields, including healthcare, environmental monitoring, and biotechnology. This work introduces a versatile platform for biomarker detection by utilizing SU-8 negative photoresist coated etched Fiber Bragg Grating (eFBG) sensors in conjunction with antibody-antigen chemistry. The unique combination of FBG sensors and SU-8 coating offers several advantages, including enhanced sensitivity, selectivity, and versatility. In this study, we present the design and fabrication of SU-8 coated FBG sensors optimized for biomarker detection. The SU-8 coating not o
APA, Harvard, Vancouver, ISO, and other styles
3

Alviano, Mario. "Answer Set Programming with Composed Predicate Names." In 17th International Conference on Principles of Knowledge Representation and Reasoning {KR-2020}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/kr.2020/5.

Full text
Abstract:
Mainstream systems for Answer Set Programming implement intelligent grounding to eliminate object variables from the input program, often obtaining a propositional program of reasonable size. However, non-stratified negation may inhibit the simplification of some rule bodies due to the lack of knowledge on the truth of recursive atoms. Frustration is greatest when the program is clearly locally stratified, such as in case of numerical arguments in rule heads obtained by increasing some body arguments; common examples are minimal distances in graphs and time arguments in planning scenarios. Thi
APA, Harvard, Vancouver, ISO, and other styles
4

Liu, Fangfang, and Jia-Huai You. "Three-Valued Semantics for Hybrid MKNF Knowledge Bases Revisited (Extended Abstract)." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/798.

Full text
Abstract:
Knorr et al. (2011) formulated a three-valued formalism for the logic of Minimal Knowledge and Negation as Failure (MKNF) and proposed a well-founded semantics for hybrid MKNF knowledge bases (KBs). The main results state that if a hybrid MKNF KB has a three-valued MKNF model, its well-founded MKNF model exists, which is unique and can be computed by an alternating fixpoint construction. In this paper, we show that these claims are erroneous. We propose a classification of hybrid MKNF KBs into a hierarchy and show that its innermost subclass is what works for the well-founded semantics of Knor
APA, Harvard, Vancouver, ISO, and other styles
5

Interlandi, Matteo, and Nan Tang. "Proof positive and negative in data cleaning." In 2015 IEEE 31st International Conference on Data Engineering (ICDE). IEEE, 2015. http://dx.doi.org/10.1109/icde.2015.7113269.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Marcus, Sherman W., and Ariel Epstein. "Proof of negative refraction: Beyond reasonable doubt?" In 2017 IEEE International Conference on Microwaves, Antennas, Communications and Electronic Systems (COMCAS). IEEE, 2017. http://dx.doi.org/10.1109/comcas.2017.8244773.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Schiesko, L., G. Cartry, C. Hopf, et al. "Cs-doped Mo as surface converter for H−/D− generation in negative ion sources: First steps and proof of principle." In FOURTH INTERNATIONAL SYMPOSIUM ON NEGATIVE IONS, BEAMS AND SOURCES (NIBS 2014). AIP Publishing LLC, 2015. http://dx.doi.org/10.1063/1.4916412.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Davis, Tom, and Adel Elmessiry. "Proof of Renewable (PoR) the ROBe2 Protocol." In 5th International Conference on Computer Science and Information Technology (COMIT 2021). Academy and Industry Research Collaboration Center (AIRCC), 2021. http://dx.doi.org/10.5121/csit.2021.111710.

Full text
Abstract:
We are at a serious crossroads as it relates to carbon emissions and the condition of our planet. Global conditions are spiraling out of control. Climate change is widespread, occurring extremely fast, and intensifying. The consumption of nonrenewable energy sources is impacting both the environment and the economy in equal proportions. Up to this point society has tried to solve these problems with local solutions but we have fallen short. The missing component to solve the global problem is an alignment of individuals and organizations coming together, taking responsibility, and creating glo
APA, Harvard, Vancouver, ISO, and other styles
9

Golowich, Noah, Harikrishna Narasimhan, and David C. Parkes. "Deep Learning for Multi-Facility Location Mechanism Design." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/36.

Full text
Abstract:
Moulin [1980] characterizes the single-facility, deterministic strategy-proof mechanisms for social choice with single-peaked preferences as the set of generalized median rules. In contrast, we have only a limited understanding of multi-facility strategy-proof mechanisms, and recent work has shown negative worst case results for social cost. Our goal is to design strategy-proof, multi-facility mechanisms that minimize expected social cost. We first give a PAC learnability result for the class of multi-facility generalized median rules, and utilize neural networks to learn mechanisms from this
APA, Harvard, Vancouver, ISO, and other styles
10

Jeronimo, Fernando Granha, and Pei Wu. "The Power of Unentangled Quantum Proofs with Non-negative Amplitudes." In STOC '23: 55th Annual ACM Symposium on Theory of Computing. ACM, 2023. http://dx.doi.org/10.1145/3564246.3585248.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Proof for negation"

1

Küsters, Ralf, and Ralf Molitor. Computing Least Common Subsumers in ALEN. Aachen University of Technology, 2000. http://dx.doi.org/10.25368/2022.110.

Full text
Abstract:
Computing the least common subsumer (lcs) in description logics is an inference task first introduced for sublanguages of CLASSIC. Roughly speaking, the lcs of a set of concept descriptions is the most specific concept description that subsumes all of the input descriptions. As such, the lcs allows to extract the commonalities from given concept descriptions, a task essential for several applications like, e.g., inductive learning, information retrieval, or the bottom-up construction of KR-knowledge bases. Previous work on the lcs has concentrated on description logics that either allow for nu
APA, Harvard, Vancouver, ISO, and other styles
2

Küsters, Ralf, and Ralf Molitor. Computing Least Common Subsumers in ALEN. Aachen University of Technology, 2000. http://dx.doi.org/10.25368/2022.110.

Full text
Abstract:
Computing the least common subsumer (lcs) in description logics is an inference task first introduced for sublanguages of CLASSIC. Roughly speaking, the lcs of a set of concept descriptions is the most specific concept description that subsumes all of the input descriptions. As such, the lcs allows to extract the commonalities from given concept descriptions, a task essential for several applications like, e.g., inductive learning, information retrieval, or the bottom-up construction of KR-knowledge bases. Previous work on the lcs has concentrated on description logics that either allow for nu
APA, Harvard, Vancouver, ISO, and other styles
3

L.R. Grisham, S.K. Hahto, S.T. Hahto, J.W. Kwan, and K.N. Leung. Proof-of-Concept Experiments for Negative Ion Driver Beams for Heavy Ion Fusion. Office of Scientific and Technical Information (OSTI), 2003. http://dx.doi.org/10.2172/814011.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Choudhary, Ruplal, Victor Rodov, Punit Kohli, John D. Haddock, and Samir Droby. Antimicrobial and antioxidant functionalized nanoparticles for enhancing food safety and quality: proof of concept. United States Department of Agriculture, 2012. http://dx.doi.org/10.32747/2012.7597912.bard.

Full text
Abstract:
General concept. The reported 1-year study tested the feasibility ofpreparing antimicrobial and antioxidant nanoparticlesfunctionalized with natural phenolic compounds, as a first step to reach the ultimate goal - improving safely and quality of foods by developing novel antimicrobial and antioxidant food-contacting materials. The secondary objectives of the study were (a) selecting the most promising phenoliccompounds, (b) building nanoparticles with the selected phenolicgrafted on their Surface, and (c) testing antimicrobial and antioxidant properties of these particles. The study was expect
APA, Harvard, Vancouver, ISO, and other styles
5

Rahimipour, Shai, and David Donovan. Renewable, long-term, antimicrobial surface treatments through dopamine-mediated binding of peptidoglycan hydrolases. United States Department of Agriculture, 2012. http://dx.doi.org/10.32747/2012.7597930.bard.

Full text
Abstract:
There is a need for renewable antimicrobial surface treatments that are semi- permanent, can eradicate both biofilms and planktonic pathogens over long periods of time and that do not select for resistant strains. This proposal describes a dopamine binding technology that is inexpensive, bio-friendly, non-toxic, and uses straight-forward commercially available products. The antimicrobial agents are peptidoglycanhydrolase enzymes that are non-toxic and highly refractory to resistance development. The goal of this project is to create a treatment that will be applicable to a wide variety of surf
APA, Harvard, Vancouver, ISO, and other styles
6

Hackett, Wesley, Michael Raviv, Anath Das, Oded Reuveni, and Arie Gutman. Detecting Activity of Juvenile Phase-Specific Translocatable Substances that Influence Rooting Potential Using In Vitro Rooting Assays and Expression of a Specific Gene. United States Department of Agriculture, 1998. http://dx.doi.org/10.32747/1998.7613038.bard.

Full text
Abstract:
The objectives of the project for which substantial effort was put forth were to: 1) Verify the relationship between expression of a cDNA clone (HW103) and the rooting potential of reciprocally grafted cuttings of juvenile and mature lamina and petioles of Hedera helix L. 2) Detect rooting promoter fractions in exudates from the juvenile leaves of H. Helix by assaying for rooting with leaf petioles of juvenile and mature plants. 3) Isolate, purify and identify compounds which show activity in assays for rooting potential. Some objectives or aspects of the objectives of the original proposal we
APA, Harvard, Vancouver, ISO, and other styles
7

Gershoni, Jonathan M., David E. Swayne, Tal Pupko, et al. Discovery and reconstitution of cross-reactive vaccine targets for H5 and H9 avian influenza. United States Department of Agriculture, 2015. http://dx.doi.org/10.32747/2015.7699854.bard.

Full text
Abstract:
Research objectives: Identification of highly conserved B-cell epitopes common to either H5 or H9 subtypes of AI Reconstruction of conserved epitopes from (1) as recombinantimmunogens, and testing their suitability to be used as universal vaccine components by measuring their binding to Influenza vaccinated sera of birds Vaccination of chickens with reconstituted epitopes and evaluation of successful vaccination, clinical protection and viral replication Development of a platform to investigate the dynamics of immune response towards infection or an epitope based vaccine Estimate our ability t
APA, Harvard, Vancouver, ISO, and other styles
8

In Conversation… Prof Elaine Fox. ACAMH, 2020. http://dx.doi.org/10.13056/acamh.11788.

Full text
Abstract:
Professor Fox discusses the risk and preventative factors around mental health including the role of resilience, cognitive and affective flexibility, memory bias and negative bias. Includes transcription, and links.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Proof for negation' for particular source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography