Log in

Relevant bibliographies by topics / CDCL

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'CDCL'

Author: Grafiati

Published: 4 June 2021

Last updated: 9 February 2022

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 'CDCL.'

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 "CDCL"

1

Linti, Gerald, Heinrich Nöth, and Martina Thomann. "Metal Tetrahydroborates and Tetrahydroborato Metalates, 15 [1]. An 11B and 113Cd NMR Study of MBH4–CdCl2 Systems in Dimethylformamide and the X-Ray Structure of CdCl2 · 2 DMF." Zeitschrift für Naturforschung B 45, no. 11 (November 1, 1990): 1463–71. http://dx.doi.org/10.1515/znb-1990-1101.

Full text

Abstract:

CdCl2 dissociates in dimethylformamide into the species Cd(DMF)62+, CdCl(DMF)5+ and CdCl3- as determined by 113Cd NMR spectroscopy. 11B and 113Cd NMR spectra of MBH4/CdCl2 solutions in this solvent show the presence of complexes [CdCl2-n(BH4)n+1]- with rapid exchange of BH4- and Cl- at ambient temperature. There is no evidence that Cd(BH4)2 is formed in a metathetical reaction.The crystal structure of CdCl2 · 2 DMF has been determined. It is a coordination polymer containing hexacoordinated Cd atoms with the DMF molecules in cis-position. Coordination of DMF occurs via the carbonyl oxygen atoms.

APA, Harvard, Vancouver, ISO, and other styles

2

Vinyals, Marc. "Hard Examples for Common Variable Decision Heuristics." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 02 (April 3, 2020): 1652–59. http://dx.doi.org/10.1609/aaai.v34i02.5527.

Full text

Abstract:

The CDCL algorithm for SAT is equivalent to the resolution proof system under a few assumptions, one of them being an optimal non-deterministic procedure for choosing the next variable to branch on. In practice this task is left to a variable decision heuristic, and since the so-called VSIDS decision heuristic is considered an integral part of CDCL, whether CDCL with a VSIDS-like heuristic is also equivalent to resolution remained a significant open question.We give a negative answer by building a family of formulas that have resolution proofs of polynomial size but require exponential time to decide in CDCL with common heuristics such as VMTF, CHB, and certain implementations of VSIDS and LRB.

APA, Harvard, Vancouver, ISO, and other styles

3

Zhang, Yan, Xiaolong Xu, Shanshan Zhu, Jiajia Song, Xincheng Yan, and Shang Gao. "Combined toxicity of Fe3O4 nanoparticles and cadmium chloride in mice." Toxicology Research 5, no. 5 (2016): 1309–17. http://dx.doi.org/10.1039/c6tx00190d.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Bonet, M. L., S. Buss, and J. Johannsen. "Improved Separations of Regular Resolution from Clause Learning Proof Systems." Journal of Artificial Intelligence Research 49 (April 23, 2014): 669–703. http://dx.doi.org/10.1613/jair.4260.

Full text

Abstract:

This paper studies the relationship between resolution and conflict driven clause learning (CDCL) without restarts, and refutes some conjectured possible separations. We prove that the guarded, xor-ified pebbling tautology clauses, which Urquhart proved are hard for regular resolution, as well as the guarded graph tautology clauses of Alekhnovich, Johannsen, Pitassi, and Urquhart have polynomial size pool resolution refutations that use only input lemmas as learned clauses. For the latter set of clauses, we extend this to prove that a CDCL search without restarts can refute these clauses in polynomial time, provided it makes the right choices for decision literals and clause learning. This holds even if the CDCL search is required to greedily process conflicts arising from unit propagation. This refutes the conjecture that the guarded graph tautology clauses or the guarded xor-ified pebbling tautology clauses can be used to separate CDCL without restarts from general resolution. Together with subsequent results by Buss and Kolodziejczyk, this means we lack any good conjectures about how to establish the exact logical strength of conflict-driven clause learning without restarts.

APA, Harvard, Vancouver, ISO, and other styles

5

Chowdhury, Md Solimul, Martin Müller, and Jia You. "Guiding CDCL SAT Search via Random Exploration amid Conflict Depression." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 02 (April 3, 2020): 1428–35. http://dx.doi.org/10.1609/aaai.v34i02.5500.

Full text

Abstract:

The efficiency of Conflict Driven Clause Learning (CDCL) SAT solving depends crucially on finding conflicts at a fast rate. State-of-the-art CDCL branching heuristics such as VSIDS, CHB and LRB conform to this goal. We take a closer look at the way in which conflicts are generated over the course of a CDCL SAT search. Our study of the VSIDS branching heuristic shows that conflicts are typically generated in short bursts, followed by what we call a conflict depression phase in which the search fails to generate any conflicts in a span of decisions. The lack of conflict indicates that the variables that are currently ranked highest by the branching heuristic fail to generate conflicts. Based on this analysis, we propose an exploration strategy, called expSAT, which randomly samples variable selection sequences in order to learn an updated heuristic from the generated conflicts. The goal is to escape from conflict depressions expeditiously. The branching heuristic deployed in expSAT combines these updates with the standard VSIDS activity scores. An extensive empirical evaluation with four state-of-the-art CDCL SAT solvers demonstrates good-to-strong performance gains with the expSAT approach.

APA, Harvard, Vancouver, ISO, and other styles

6

Ekhoye, Ehitare Ikekhuamen, Samson Eshikhokhale Olerimi, and Santos Ehizokhale Ehebha. "Comparison of the deleterious effects of yaji and cadmium chloride on testicular physiomorphological and oxidative stress status: The gonadoprotective effects of an omega-3 fatty acid." Clinical and Experimental Reproductive Medicine 47, no. 3 (September 1, 2020): 168–79. http://dx.doi.org/10.5653/cerm.2019.03517.

Full text

Abstract:

Objective: This study investigated testicular oxidative stress status and physiomorphological function in Wistar rats fed with yaji and cadmium chloride (CdCl<sub>2</sub>).Methods: Sixty male albino Wistar rats (12 per group) were randomly assigned to five groups: group I (control), group II (300 mg/kg.bw of yaji), group III (500 mg/kg.bw of yaji), group IV (2.5 mg/kg.bw of CdCl<sub>2</sub>), and group V (2.5 mg/kg.bw of yaji+4 mg/kg.bw omega-3). Each group was evenly subdivided into two subgroups and treatment was administered for 14 days and 42 days, respectively. Semen quality (sperm count, progressive motility, normal morphology, and gonadosomatic index), hormones (testosterone, follicle-stimulating hormone, and luteinizing hormone), testicular oxidative stress markers (superoxide dismutase, catalase, glutathione peroxidase, and malonaldehyde) and testicular histomorphological features were examined.Results: Yaji caused significant (<i>p</i>< 0.05) dose- and duration-dependent reductions in semen quality, the gonadosomatic index, testosterone, follicle-stimulating hormone, and luteinizing hormone. Yaji also caused significant (<i>p</i>< 0.05) dose- and duration-dependent decreases in superoxide dismutase, catalase, and glutathione peroxidase activity, as well as increased testicular malonaldehyde levels. Yaji induced distortions in the testicular histological architecture. CdCl<sub>2</sub> damaged testicular function by significantly (<i>p</i>< 0.05) reducing semen quality, reproductive hormone levels, and oxidative stress markers in albino Wistar rats. CdCl<sub>2</sub> also altered the histology of the testis.Conclusion: This study shows that yaji sauce has similar anti-fertility effects to those of CdCl<sub>2</sub>, as it adversely interferes with male reproduction by impairing oxidative stress markers and the function and morphological features of the testis.

APA, Harvard, Vancouver, ISO, and other styles

7

LIU, NIANQING, HANRU SHAO, PENG LIU, QING XU, JUXIANG PAN, YINGRONG WU, DONGXIN MA, and JINYUAN ZHAO. "ELEMENTS DISTRIBUTION IN KIDNEY OF RATS TREATED WITH CdCL2 BY MICRO-SXRF." International Journal of PIXE 06, no. 01n02 (January 1996): 415–20. http://dx.doi.org/10.1142/s0129083596000442.

Full text

Abstract:

A micro-scanning technique of SXRF (Synchrotron Radiation X-ray fluorescence) combined with multivariate statistical analysis was employed. The elements positional distribution in the kidney tissues of tree groups of Wistar rats (1, normal; 2, treated by CdCl 2; 3, Cd exposed rats treated with new complex) were obtained. The results show that Cd mainly distribute in the renal cortex of rat treated by CdCl 2. The level of Cd in the renal medulla is very low or not detectable. The elements measured in renal cortex of normal rat can be classified into two groups, Cu, Zn, Mn and Se belong to the same group. In acute CdCl 2 poisoning, Cd and Se have a very strong correlation, and the classification is different from normal renal cortex. After administration of a new chelator, Zn and Se have a very strong co-location and correlation, the classification of elements tend to return to normal distribution.

APA, Harvard, Vancouver, ISO, and other styles

8

Wang, Jing, Xinping Yang, Jinhu Wang, Chi Xu, Wandi Zhang, Rutao Liu, and Wansong Zong. "Probing the binding interaction between cadmium(ii) chloride and lysozyme." New Journal of Chemistry 40, no. 4 (2016): 3738–46. http://dx.doi.org/10.1039/c5nj02911b.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Caldwell, J., and SG Emerson. "Interleukin-1 alpha upregulates tumor necrosis factor receptors expressed by a human bone marrow stromal cell strain: implications for cytokine redundancy and synergy." Blood 86, no. 9 (November 1, 1995): 3364–72. http://dx.doi.org/10.1182/blood.v86.9.3364.bloodjournal8693364.

Full text

Abstract:

To explore the biochemical and physiologic basis of the overlapping effects of interleukin-1 alpha (IL-1 alpha) and tumor necrosis factor alpha (TNF-alpha) on myeloid cytokine production, we have studied the dynamics of granulocyte colony-stimulating factor (G-CSF) and granulocyte-monocyte colony-stimulating factor (GM-CSF) production as well as IL-1 receptor and TNF receptor expression in a clonally derived bone marrow stromal cell strain (CDCL). IL-1 alpha and TNF alpha act in a synergistic manner to stimulate G-CSF and GM-CSF production by CDCL, resulting in an increase in CSF secretion that is 250-fold greater than that observed with either cytokine alone. This synergism in protein secretion is paralleled by synergistic increases the steady-state level of GM- and G-CSF mRNA, with supra-additive levels achieved by 24 hours. Coincident with this synergistic induction of myeloid CSFs, treatment of CDCL cells with IL-1 alpha induces a 300% increase in the expression of TNF receptors. IL-1 alpha induction of TNF receptors reaches a peak after 6 hours and gradually returns to baseline level by 24 hours. IL-1 alpha does not affect TNF receptor ligand binding affinity. A kinetic study comparing IL-1/TNF synergistic induction of growth factor secretion with IL-1 alpha induction of TNF receptors shows that these events occur in parallel. In contrast with the induction of TNF receptors by IL-1 alpha, treatment with TNF alpha has no effect on either the number of IL-1 receptors expressed by CDCL cells or IL-1 receptor ligand binding affinity. Brief treatment of IL-1 alpha/TNF alpha-stimulated CDCL cells with cycloheximide before receptor induction reduces the synergistic increase in growth factor mRNA by 40% to 60% compared with cells not treated with CHX. Taken together, these results raise the possibility that IL-1 alpha cross-induction of TNF receptors may contribute to the biochemical mechanisms underlying the synergistic stimulation of G-CSF and GM-CSF production by IL-1 alpha and TNF alpha.

APA, Harvard, Vancouver, ISO, and other styles

10

DODARO, CARMINE, and FRANCESCO RICCA. "The External Interface for Extending WASP." Theory and Practice of Logic Programming 20, no. 2 (December 10, 2018): 225–48. http://dx.doi.org/10.1017/s1471068418000558.

Full text

Abstract:

Answer set programming (ASP) is a successful declarative formalism for knowledge representation and reasoning. The evaluation of ASP programs is nowadays based on the conflict-driven clause learning (CDCL) backtracking search algorithm. Recent work suggested that the performance of CDCL-based implementations can be considerably improved on specific benchmarks by extending their solving capabilities with custom heuristics and propagators. However, embedding such algorithms into existing systems requires expert knowledge of the internals of ASP implementations. The development of effective solver extensions can be made easier by providing suitable programming interfaces. In this paper, we present the interface for extending the CDCL-based ASP solver wasp. The interface is both general, that is, it can be used for providing either new branching heuristics or propagators, and external, that is, the implementation of new algorithms requires no internal modifications of wasp. Moreover, we review the applications of the interface witnessing it can be successfully used to extend wasp for solving effectively hard instances of both real-world and synthetic problems.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "CDCL"

1

Dupré-Maquaire, Janine. "Spectroscopie moléculaire à 10 mu m des molécules toupies symétriques CDH et CDCl spectroscopie STRAK de CDCl avec structure hyperfine." Grenoble 2 : ANRT, 1986. http://catalogue.bnf.fr/ark:/12148/cb37597851v.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Leligny, Henri. "Etude des cristaux hydratés isolés dans les diagrammes CdCl-HO, CdBr-HO et CdCl-CaCl-HO structures atomiques et propriétés cristallochimiques /." Grenoble 2 : ANRT, 1987. http://catalogue.bnf.fr/ark:/12148/cb37607240v.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Oh, Chanseok. "Improving SAT Solvers by Exploiting Empirical Characteristics of CDCL." Thesis, New York University, 2016. http://pqdtopen.proquest.com/#viewpdf?dispub=10025676.

Full text

Abstract:

The Boolean Satisfiability Problem (SAT) is a canonical decision problem originally shown to be NP-complete in Cook's seminal work on the theory of computational complexity. The SAT problem is one of several computational tasks identified by researchers as core problems in computer science. The existence of an efficient decision procedure for SAT would imply P = NP. However, numerous algorithms and techniques for solving the SAT problem have been proposed in various forms in practical settings. Highly efficient solvers are now actively being used, either directly or as a core engine of a larger system, to solve real-world problems that arise from many application domains. These state-of-the-art solvers use the Davis-Putnam-Logemann-Loveland (DPLL) algorithm extended with Conflict-Driven Clause Learning (CDCL). Due to the practical importance of SAT, building a fast SAT solver can have a huge impact on current and prospective applications. The ultimate contribution of this thesis is improving the state of the art of CDCL by understanding and exploiting the empirical characteristics of how CDCL works on real-world problems. The first part of the thesis shows empirically that most of the unsatisfiable real-world problems solvable by CDCL have a refutation proof with near-constant width for the great portion of the proof. Based on this observation, the thesis provides an unconventional perspective that CDCL solvers can solve real-world problems very efficiently and often more efficiently just by maintaining a small set of certain classes of learned clauses. The next part of the thesis focuses on understanding the inherently different natures of satisfiable and unsatisfiable problems and their implications on the empirical workings of CDCL. We examine the varying degree of roles and effects of crucial elements of CDCL based on the satisfiability status of a problem. Ultimately, we propose effective techniques to exploit the new insights about the different natures of proving satisfiability and unsatisfiability to improve the state of the art of CDCL. In the last part of the thesis, we present a reference solver that incorporates all the techniques described in the thesis. The design of the presented solver emphasizes minimality in implementation while guaranteeing state-of-the-art performance. Several versions of the reference solver have demonstrated top-notch performance, earning several medals in the annual SAT competitive events. The minimal spirit of the reference solver shows that a simple CDCL framework alone can still be made competitive with state-of-the-art solvers that implement sophisticated techniques outside the CDCL framework.

APA, Harvard, Vancouver, ISO, and other styles

4

Scheibler, Karsten [Verfasser], and Bernd [Akademischer Betreuer] Becker. "Applying CDCL to verification and test: when laziness pays off." Freiburg : Universität, 2017. http://d-nb.info/1134967969/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Hussain, Mursheda. "Vapor CdCl₂ Processing of CdTe Solar Cells." Scholar Commons, 2004. https://scholarcommons.usf.edu/etd/1088.

Full text

Abstract:

Polycrystalline CdS/CdTe thin film solar cells are among the leading candidates for low-cost, large scale terrestrial photovoltaic applications. CdTe has a high absorption coefficient and it can absorb the radiant energy within less than 2 µm of thickness. This makes it suitable for thin film applications. CdTe has a band gap of 1.45 eV at room temperature, which is nearly optimum for photovoltaic conversion efficiency under the AM 1.5 solar spectrum. The theoretical maximum efficiency for CdTe solar cells is 29%. However, to-date the experimental value is in the 16 % range. In most cases CdTe cells are subjected to a post-growth heat treatment which involves annealing in the presence of CdCl2. The treatment results in significant increases in conversion efficiency (η) and all three solar cell parameters Voc, FF, and Jsc. In this work, several variations of the CdCl2 treatment were used on more than 100 samples to investigate their effects on the solar cell parameters. A vapor CdCl2 method was applied for the treatment with various source temperatures, substrate temperatures, and treatment times. The cells were characterized by dark and light J-V and spectral response (SR) measurements.

APA, Harvard, Vancouver, ISO, and other styles

6

Lindblad, Johan. "On the Structure of Resolution Refutations Generated by Modern CDCL Solvers." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-252732.

Full text

Abstract:

Modern solvers for the Boolean satisfiability problem (SAT) that are based on conflict-driven clause learning (CDCL) are known to be able to solve some instances significantly more efficiently than older kinds of solvers such as ones using the Davis-Putnam-Logemann-Loveland (DPLL) algorithm. In addition to solving instances that can be satisfied, SAT solvers will implicitly generate proofs of unsatisfiability for formulae that are unsatisfiable. Theoretical models of CDCL based solvers are known to have access to more powerful forms of reasoning compared to their DPLL counterparts and as a result, are able to generate proofs that are significantly shorter for certain kinds of formulae. Additionally, certain characteristics are expected when representing these proofs as graphs, such as them not being strictly tree-like in shape. It is however less well known if these theoretical justifications are indeed the reason CDCL solvers are so successful in practice. This project attempts to answer this question by modifying a modern CDCL solver to output the proof and comparing these proofs to what theoretical results would predict. Firstly, the results indicate that CDCL solvers generate significantly shorter proofs for all kinds of formulae that were investigated as compared to a DPLL solver. Furthermore, it appears that this is in large part due to the proof not being tree-like. Secondly, utilizing restarts was found to make for significantly shorter proofs for most families of formulae but the effect was the opposite for formulas representing the relativized pigeonhole principle. The explanation for this is seemingly not clear. Lastly, it appears that the Tseitin formulae used do not exhibit timespace trade-offs but instead simply require a large amount of space. This is indicated by the run time being significantly greater if clause erasure if more aggressive but the refutation being similar in both length and number of learned clauses. To summarize, it has been found that modern CDCL solvers appear to result in significantly different proofs that largely mirror what one would expect. However, the results are unclear on the role of restarts and how their effect on the proof best can be explained.
Moderna lösare för Boolean satisfiability problem (SAT) baserade på konfliktdriven klausulinlärning (CDCL) har visats prestera väl och lösa vissa typer av formler mer effektivt än äldre varianter såsom Davis-Putnam-Logemann-Loveland-algoritmen (DPLL). Förutom att lösa instanser som är lösbara så producerar SAT-lösare implicit bevis på olösbarhet för formler som är olösbara. Teoretiska modeller över CDCL-baserade lösare har visat på att mer kraftfulla former av resonemang är tillgängliga jämfört med DPLL-baserade motsvarigheter; som ett resultat kan CDCL-baserade lösare enligt dessa modeller producera kortare bevis. Vidare väntas dessa bevis ha vissa karaktärsdrag när de representeras som grafer som exempelvis att de inte är strikt trädformade. Dock är det inte känt om dessa teoretiska förklaringar faktiskt korrekt beskriver anledningarna att CDCL-baserade lösare är så framgångsrika i praktiken. Detta projekt ämnar klargöra denna fråga genom att modifiera en CDCL-baserad lösare så att den producerar bevisen explicit och sedan jämföra dessa bevis med vad teoretiska resultat skulle förutspå. För det första så visar resultaten att CDCL-baserade lösare genererar betydligt kortare bevis för alla sorters formler som undersöktes. Studier av småskaliga probleminstanser visar att en del av förklaringen till detta är att beviset inte är strikt trädformat. För det andra visar resultaten att omstarter gör bevisen betydligt kortare för nästan alla formler men att det motsatta är sant för så kallade relativized pigeonhole principle-formler. Förklaringen till detta är inte helt tydlig. För det tredje sågs tendenser till tid-utrymmes-avvägningar för formler som var inspirerade av så kallade Tseitin-formler där dessa avvägningar är bevisade. Det antyder att även dessa inspirerade formler ger dessa avvägningar i praktiska implementationer av CDCL-lösare. För att summera så visar resultaten att moderna CDCL-baserade lösare till stor del uppnår vad teoretiska modeller förutspår i termer av formen på deras bevis. Dock är resultaten mindre tydliga vad gäller omstarter och hur deras påverkan på bevisen bäst förklaras.

APA, Harvard, Vancouver, ISO, and other styles

7

Leligny, Henri. "Etude des cristaux hydrates isoles dans les diagrammes cdcl::(2)-h::(2)o, cdbr::(2)-h::(2)o et cdcl::(2)-cacl::(2)-h::(2)o : structures atomiques et proprietes cristallochimiques." Caen, 1987. http://www.theses.fr/1987CAEN2022.

Full text

Abstract:

Determination par diffraction rx des arrangements atomiques de neuf phases cristallines hydratees. Les polyedres de coordination des cations s'organisent en trois types structuraux : chaines simples (cd); empilement en couches (cd); chaines mixtes (cd,ca). Quatre phases possedent des structures caracterisees par une pseudo-symetrie marquee. Les macles et les transformations orientees, observees sur certains cristaux, sont interpretees par l'existence de pseudo-symetrie locale et de parentes structurales entre blocs atomiques des hydrates concernes

APA, Harvard, Vancouver, ISO, and other styles

8

LIVAGE, CARINE. "Synthese et relation structure-proprietes magnetiques d'une famille d'antiperovskites moleculaires et d'un analogue moleculaire de cdcl#2." Paris 11, 1991. http://www.theses.fr/1991PA112229.

Full text

Abstract:

Ce memoire decrit la synthese de sels de tetrathiafulvalenium d'anions inorganiques moleculaires dont la charge, la forme, le volume, les proprietes redox sont susceptibles d'imposer la formation de structures de dimensionnalite accrue. Ceux-ci sont obtenus, sous forme de monocristaux de grande qualite, par electrocristallisation. Dans la premiere partie, nous montrons que l'utilisation d'un complexe tris-dithiolene de vanadium, v(ddd)#3#, choisit pour sa geometrie trigonale prismatique, conduit a des associations intermoleculaires bidimensionnelles. Celles-ci sont mises en evidence par l'analyse structurale du compose neutre paramagnetique v(dddt)#3#. Elles se retrouvent dans le compose ionique (ttf) v(ddt)#3 qui presente une structure en feuillets de type cdcl#2. Nous montrons que ces feuillets sont constitues par un reseau d'anions v(dddt)#3#. Les radicaux cations ttf#+, associes en dimeres, s'inserent au sein des cavites octaedriques formees par l'empilement des anions. Dans la deuxieme partie, nous avons synthetise une famille de composes ternaires de structure anti-perovskite deformee base sur des halogenures a cluster octaedrique de molybdene(ii). On definit d'abord les conditions necessaires a l'obtention, de facon premeditee, de la famille de perovskites (mo#6x#1#4) (y) (ttf)#3 (avec x=cl, br et y=cl, br, i). On montre que tous ces composes presentent une transition magnetique vers un ordre antiferromagnetique a longue distance des spins s=1/2 des ions tetrathiafulvalenium, pour des t#n de l'ordre de 8 k. L'analyse de la structure est discutee en relation avec le comportement magnetique. Nous presentons des resultats de mesures de susceptibilite statique, rpe et resonance antiferromagnetique. Cette derniere technique a permis de mettre en evidence l'existence d'un plan de facile aimantation dans ces materiaux

APA, Harvard, Vancouver, ISO, and other styles

9

Négrier, Philippe. "Transitions de phase et désordres structuraux dans le composé bidimensionnel à structure pérovskite NH₃(CH₂)₅NH₃CdCl₄." Bordeaux 1, 1987. http://www.theses.fr/1987BOR10589.

Full text

Abstract:

NH₃(CH₂)₅NH₃CdCl₄ PRESENTE DEUX TRANSFORMATIONS DE PHASE STRUCTURALES A TC::(1) = 337K ET TC::(2) = 417K. LA DIFFRACTION RX ET LA DIFFUSION RAMAN ONT MONTRE QUE LA PREMIERE A TC::(1) EST GOUVERNEE PAR LA REORIENTATION DYNAMIQUE DES CHAINES ALKYLENE-DIAMMONIUM EN CONFORMATION "TOUT TRANS". AU-DELA D'UNE CONCENTRATION SEUIL ATTEINTE A TC::(2), DES CHAINES "TORSADEES", THERMIQUEMENT ACTIVEES, INDUISENT LA DEUXIEME TRANSITION. ANALYSE DU DESORDRE DES PLANS PEROVSKITE PAR UN MODELE PHENOMENOLOGIQUE, BASE SUR UN DEVELOPPEMENT DE TYPE LANDAU

APA, Harvard, Vancouver, ISO, and other styles

10

Grinten, Alexander van der [Verfasser], Ewald [Gutachter] Speckenmeyer, and Henning [Gutachter] Meyerhenke. "Design, implementation and evaluation of a distributed CDCL framework / Alexander van der Grinten ; Gutachter: Ewald Speckenmeyer, Henning Meyerhenke." Köln : Universitäts- und Stadtbibliothek Köln, 2018. http://d-nb.info/1161223320/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "CDCL"

1

Coach Drivers Club of Great Britain. CDC yearbook. Yate: CDC, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Non-CDL vehicles. Springfield, Ill]: Jesse White, Secretary of State, 2000.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Eng, Nelson F. Defining human CDC7 functional domains. Sudbury, Ont: Laurentian University, 2001.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Office, National Audit. Investing for development: The Department for International Development's oversight of CDC Group plc. London: Stationery Office, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Taylor, Mac. Refocusing CDCR after the 2011 realignment. Sacramento, CA: Legislative Analyst's Office, 2012.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Instruments, Texas. CDC clock-distribution circuits. [S.l.]: Texas Instruments, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

CDL exam -- CDL practice test secrets: Your key to exam success. [Beaumont, Tex.]: Mometrix Media, 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Board, National Institutes of Health (U S. ). Patent Policy. NIH/ADAMHA/CDC technology transfer. [Atlanta, Ga.?]: The Centers, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Ogden, Horace G. CDC and the smallpox crusade. [Atlanta, Ga.?]: U.S. DHHS, PHS, Centers for Disease Control, 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

NIH/ADAMHA/CDC technology transfer. [Atlanta, Ga.?]: The Centers, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "CDCL"

1

Jamali, Sima, and David Mitchell. "Simplifying CDCL Clause Database Reduction." In Lecture Notes in Computer Science, 183–92. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-24258-9_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Biere, Armin, and Andreas Fröhlich. "Evaluating CDCL Variable Scoring Schemes." In Lecture Notes in Computer Science, 405–22. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-24318-4_29.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Jiang, Chuan, and Ting Zhang. "Partial Backtracking in CDCL Solvers." In Logic for Programming, Artificial Intelligence, and Reasoning, 490–502. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-45221-5_33.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Jamali, Sima, and David Mitchell. "Centrality-Based Improvements to CDCL Heuristics." In Theory and Applications of Satisfiability Testing – SAT 2018, 122–31. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94144-8_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Audemard, Gilles, Jean-Marie Lagniez, Bertrand Mazure, and Lakhdar Saïs. "Boosting Local Search Thanks to cdcl." In Logic for Programming, Artificial Intelligence, and Reasoning, 474–88. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16242-8_34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Kokkala, Janne I., and Jakob Nordström. "Using Resolution Proofs to Analyse CDCL Solvers." In Lecture Notes in Computer Science, 427–44. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-58475-7_25.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Janota, Mikoláš. "On Q-Resolution and CDCL QBF Solving." In Theory and Applications of Satisfiability Testing – SAT 2016, 402–18. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-40970-2_25.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Le Berre, Daniel, and Romain Wallon. "On Dedicated CDCL Strategies for PB Solvers." In Theory and Applications of Satisfiability Testing – SAT 2021, 315–31. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-80223-3_22.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Goultiaeva, Alexandra, and Fahiem Bacchus. "Off the Trail: Re-examining the CDCL Algorithm." In Theory and Applications of Satisfiability Testing – SAT 2012, 30–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31612-8_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Nabeshima, Hidetomo, and Katsumi Inoue. "Coverage-Based Clause Reduction Heuristics for CDCL Solvers." In Theory and Applications of Satisfiability Testing – SAT 2017, 136–44. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-66263-3_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "CDCL"

1

Elffers, Jan, Jesús Giráldez-Cru, Stephan Gocht, Jakob Nordström, and Laurent Simon. "Seeking Practical CDCL Insights from Theoretical SAT Benchmarks." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/181.

Full text

Abstract:

Over the last decades Boolean satisfiability (SAT) solvers based on conflict-driven clause learning (CDCL) have developed to the point where they can handle formulas with millions of variables. Yet a deeper understanding of how these solvers can be so successful has remained elusive. In this work we shed light on CDCL performance by using theoretical benchmarks, which have the attractive features of being a) scalable, b) extremal with respect to different proof search parameters, and c) theoretically easy in the sense of having short proofs in the resolution proof system underlying CDCL. This allows for a systematic study of solver heuristics and how efficiently they search for proofs. We report results from extensive experiments on a wide range of benchmarks. Our findings include several examples where theory predicts and explains CDCL behaviour, but also raise a number of intriguing questions for further study.

APA, Harvard, Vancouver, ISO, and other styles

2

Elffers, Jan, and Jakob Nordström. "Divide and Conquer: Towards Faster Pseudo-Boolean Solving." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/180.

Full text

Abstract:

The last 20 years have seen dramatic improvements in the performance of algorithms for Boolean satisfiability---so-called SAT solvers---and today conflict-driven clause learning (CDCL) solvers are routinely used in a wide range of application areas. One serious short-coming of CDCL, however, is that the underlying method of reasoning is quite weak. A tantalizing solution is to instead use stronger pseudo-Boolean (PB) reasoning, but so far the promise of exponential gains in performance has failed to materialize---the increased theoretical strength seems hard to harness algorithmically, and in many applications CDCL-based methods are still superior. We propose a modified approach to pseudo-Boolean solving based on division instead of the saturation rule used in [Chai and Kuehlmann '05] and other PB solvers. In addition to resulting in a stronger conflict analysis, this also improves performance by keeping integer coefficient sizes down, and yields a very competitive solver as shown by the results in the Pseudo-Boolean Competitions 2015 and 2016.

APA, Harvard, Vancouver, ISO, and other styles

3

Blanchette, Jasmin Christian, Mathias Fleury, and Christoph Weidenbach. "A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/667.

Full text

Abstract:

We developed a formal framework for SAT solving using the Isabelle/HOL proof assistant. Through a chain of refinements, an abstract CDCL (conflict-driven clause learning) calculus is connected to a SAT solver that always terminates with correct answers. The framework offers a convenient way to prove theorems about the SAT solver and experiment with variants of the calculus. Compared with earlier verifications, the main novelties are the inclusion of the CDCL rules for forget, restart, and incremental solving and the use of refinement.

APA, Harvard, Vancouver, ISO, and other styles

4

Chen, Qingshan, Yang Xu, Guanfeng Wu, and Xingxing He. "Conflicting rate based branching heuristic for CDCL SAT solvers." In 2017 12th International Conference on Intelligent Systems and Knowledge Engineering (ISKE). IEEE, 2017. http://dx.doi.org/10.1109/iske.2017.8258777.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Popovitz-Biro, R. "Nanoparticles of CdCl[sub 2] with closed cage structures." In The 14th international winterschool on electronic properties of novel materials - molecular nanostructures. AIP, 2000. http://dx.doi.org/10.1063/1.1342551.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Luo, Mao, Chu-Min Li, Fan Xiao, Felip Manyà, and Zhipeng Lü. "An Effective Learnt Clause Minimization Approach for CDCL SAT Solvers." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/98.

Full text

Abstract:

Learnt clauses in CDCL SAT solvers often contain redundant literals. This may have a negative impact on performance because redundant literals may deteriorate both the effectiveness of Boolean constraint propagation and the quality of subsequent learnt clauses. To overcome this drawback, we define a new inprocessing SAT approach which eliminates redundant literals from learnt clauses by applying Boolean constraint propagation. Learnt clause minimization is activated before the SAT solver triggers some selected restarts, and affects only some learnt clauses during the search process. Moreover, we conducted an empirical evaluation on instances coming from the hard combinatorial and application categories of recent SAT competitions. The results show that a remarkable number of additional instances are solved when the approach is incorporated into five of the best performing CDCL SAT solvers (Glucose, TC_Glucose, COMiniSatPS, MapleCOMSPS and MapleCOMSPS_LRB).

APA, Harvard, Vancouver, ISO, and other styles

7

Giráldez-Cru, Jesús, and Jordi Levy. "Locality in Random SAT Instances." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/89.

Full text

Abstract:

Despite the success of CDCL SAT solvers solving industrial problems, there are still many open questions to explain such success. In this context, the generation of random SAT instances having computational properties more similar to real-world problems becomes crucial. Such generators are possibly the best tool to analyze families of instances and solvers behaviors on them. In this paper, we present a random SAT instances generator based on the notion of locality. We show that this is a decisive dimension of attractiveness among the variables of a formula, and how CDCL SAT solvers take advantage of it. To the best of our knowledge, this is the first random SAT model that generates both scale-free structure and community structure at once.

APA, Harvard, Vancouver, ISO, and other styles

8

Cuteri, Bernardo, Carmine Dodaro, Francesco Ricca, and Peter Schüller. "Overcoming the Grounding Bottleneck Due to Constraints in ASP Solving: Constraints Become Propagators." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/234.

Full text

Abstract:

Answer Set Programming (ASP) is a well-known formalism for Knowledge Representation and Reasoning, successfully employed to solve many AI problems, also thanks to the availability of efficient implementations. Traditionally, ASP systems are based on the ground&solve approach, where the grounding transforms a general input program into its propositional counterpart, whose stable models are then computed by the solver using the CDCL algorithm. This approach suffers an intrinsic limitation: the grounding of one or few constraints may be unaffordable from a computational point of view; a problem known as grounding bottleneck. In this paper, we develop an innovative approach for evaluating ASP programs, where some of the constraints of the input program are not grounded but automatically translated into propagators of the CDCL algorithm that work on partial interpretations. We implemented the new approach on top of the solver WASP and carried out an experimental analysis on different benchmarks. Results show that our approach consistently outperforms state-of-the-art ASP systems by overcoming the grounding bottleneck.

APA, Harvard, Vancouver, ISO, and other styles

9

Gashin, Petru A., Tamara Potlog, Oleg Shapoval, Lidia Ghimpu, Vladimir Fedorov, and Petru I. Ketrush. "Photovoltaic effect in thin film CdS-CdTe heterojunctions treated on CdCl 2." In ROMOPTP '94: 4th Conference on Optics, edited by Valentin I. Vlad. SPIE, 1995. http://dx.doi.org/10.1117/12.203606.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Gocht, Stephan, Jakob Nordström, and Amir Yehudayoff. "On Division Versus Saturation in Pseudo-Boolean Solving." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/237.

Full text

Abstract:

The conflict-driven clause learning (CDCL) paradigm has revolutionized SAT solving over the last two decades. Extending this approach to pseudo-Boolean (PB) solvers doing 0-1 linear programming holds the promise of further exponential improvements in theory, but intriguingly such gains have not materialized in practice. Also intriguingly, most PB extensions of CDCL use not the division rule in cutting planes as defined in [Cook et al., '87] but instead the so-called saturation rule. To the best of our knowledge, there has been no study comparing the strengths of division and saturation in the context of conflict-driven PB learning, when all linear combinations of inequalities are required to cancel variables. We show that PB solvers with division instead of saturation can be exponentially stronger. In the other direction, we prove that simulating a single saturation step can require an exponential number of divisions. We also perform some experiments to see whether these phenomena can be observed in actual solvers. Our conclusion is that a careful combination of division and saturation seems to be crucial to harness more of the power of cutting planes.

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "CDCL"

1

Velazquez-Vargas, Luis G., Tom J. Flynn, Bartev B. Sakadjian, Jinhua Bao, and Tritti Siengchum. 10 MWE CDCL Large Pilot Plant – pre-FEED Study. Office of Scientific and Technical Information (OSTI), April 2020. http://dx.doi.org/10.2172/1638256.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Velazquez-Vargas, Luis, Christopher Poling, Tom Flynn, Andrew Tong, Cheng Chung, and Yaswanth Pottimurthy. Commercialization of an Atmospheric Iron-based CDCL Process for Power Production: Phase II. Office of Scientific and Technical Information (OSTI), November 2017. http://dx.doi.org/10.2172/1420837.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Velazquez-Vargas, Luis G. 10 MWe Coal Direct Chemical Looping (CDCL) Large Pilot Plant Test - Phase I Feasibility - Topic Report. Office of Scientific and Technical Information (OSTI), March 2019. http://dx.doi.org/10.2172/1542917.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Yamada, R., J. Hawtree, K. Kaczar, R. Leverence, K. McGuire, C. Newman-Holmes, E. E. Schmidt, and J. Shallenberger. CDC field mapping device - ''ROTOTRACK''. Office of Scientific and Technical Information (OSTI), October 1985. http://dx.doi.org/10.2172/6459052.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Chitanvis, Maneesha Elizabeth. LANL biosurveillance tools at CDC. Office of Scientific and Technical Information (OSTI), May 2017. http://dx.doi.org/10.2172/1361464.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Galea, Sandro, Lawrence Gostin, Alan B. Cohen, and Nicole Lurie. Eight Operational Suggestions for a Renewed CDC. Milbank Memorial Fund, January 2021. http://dx.doi.org/10.1599/mqop.2021.0105.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

McCarty, Perry L., and Alfred M. Spormann. Mechanisms, Chemistry, and Kinetics of Anaerobic Biodegradation of cDCE and VC. Office of Scientific and Technical Information (OSTI), June 1999. http://dx.doi.org/10.2172/826072.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Mcarty, Perry L., and Alfred M. Sporman. Mechanisms, Chemistry, and Kinetics of Anaerobic Biodegradation of cDCE and VC. Office of Scientific and Technical Information (OSTI), June 2000. http://dx.doi.org/10.2172/826074.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Parsa, Z., and E. Courant. Guide to Accelerator Physics Program Synch - CDC Version. Office of Scientific and Technical Information (OSTI), January 1987. http://dx.doi.org/10.2172/1151180.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Parsa, Zohreh. Guide to VAX, CDC, and IBM 3090 Third Edition. Office of Scientific and Technical Information (OSTI), May 1987. http://dx.doi.org/10.2172/1118914.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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!