Relevant bibliographies by topics / Partial Completeness

Contents

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

Academic literature on the topic 'Partial Completeness'

Author: Grafiati
Published: 11 March 2023
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 'Partial Completeness.'

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 "Partial Completeness"

1

Mecheraoui, Rachid, Aiman Mukheimer, and Stojan Radenović. "From G-Completeness to M-Completeness." Symmetry 11, no. 7 (2019): 839. http://dx.doi.org/10.3390/sym11070839.

Full text
Abstract:
The purpose of this paper is to obtain a sufficient condition for a G-Cauchy sequence to be an M-Cauchy sequence in fuzzy metric spaces. Our main result provides a partial answer to the open question posed by V. Gregori and A. Sapena. For application, we give a new fuzzy version of the Banach fixed point theorem.
APA, Harvard, Vancouver, ISO, and other styles
2

Haddad, Lucien, and I. G. Rosenberg. "Completeness theory for finite partial algebras." Algebra Universalis 29, no. 3 (1992): 378–401. http://dx.doi.org/10.1007/bf01212439.

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

Romov, B. A. "The completeness problem in partial hyperclones." Discrete Mathematics 306, no. 13 (2006): 1405–14. http://dx.doi.org/10.1016/j.disc.2005.11.033.

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

Freitag, James. "Completeness in partial differential algebraic geometry." Journal of Algebra 420 (December 2014): 350–72. http://dx.doi.org/10.1016/j.jalgebra.2014.07.025.

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

ISOBE, Shuji, and Eisuke KOIZUMI. "Autoreducibility and Completeness for Partial Multivalued Functions." IEICE Transactions on Information and Systems E100.D, no. 3 (2017): 422–27. http://dx.doi.org/10.1587/transinf.2016fcp0006.

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

Mykhaylyuk, Volodymyr, and Vadym Myronyk. "Compactness and completeness in partial metric spaces." Topology and its Applications 270 (February 2020): 106925. http://dx.doi.org/10.1016/j.topol.2019.106925.

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

Kellerman, Ruaan, Alberto Zanardo, and Valentin Goranko. "Structural theory of trees II. Completeness and completions of trees." Contributions to Discrete Mathematics 18, no. 2 (2023): 210–33. http://dx.doi.org/10.55016/ojs/cdm.v18i2.74005.

Full text
Abstract:
Trees are partial orderings where every element has a linearly ordered set of smaller elements. We define and study several natural notions of completeness of trees, extending Dedekind completeness of linear orders and Dedekind-MacNeille completions of partial orders. We then define constructions of tree completions that extend any tree to a minimal one satisfying the respective completeness property.
APA, Harvard, Vancouver, ISO, and other styles
8

Burdick, Bruce S. "On the use of partial orders in uniform spaces." Applied General Topology 4, no. 1 (2003): 99. http://dx.doi.org/10.4995/agt.2003.2013.

Full text
Abstract:
<p>We investigate the use of nets indexed by preorders in uniform spaces. Nine different Cauchy conditions and four different convergence conditions yield 36 completeness properties, each of which turns out to be equivalent to a known form of completeness. We also use these preordered nets to characterize the functors θ, λ, and v, which are associated with these completeness properties. In the case of λ we give an example to show that the analogous characterization with predirected nets does not work.</p>
APA, Harvard, Vancouver, ISO, and other styles
9

Paesano, Daniela, and Pasquale Vetro. "Fixed points and completeness on partial metric spaces." Miskolc Mathematical Notes 16, no. 1 (2015): 369. http://dx.doi.org/10.18514/mmn.2015.710.

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

Hitchcock, John M., A. Pavan, and N. V. Vinodchandran. "Partial Bi-immunity, Scaled Dimension, and NP-Completeness." Theory of Computing Systems 42, no. 2 (2007): 131–42. http://dx.doi.org/10.1007/s00224-007-9000-2.

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

Dissertations / Theses on the topic "Partial Completeness"

1

Campion, Marco. "Partial (In)Completeness in Abstract Interpretation." Doctoral thesis, 2021. http://hdl.handle.net/11562/1049799.

Full text
Abstract:
In the abstract interpretation framework, completeness represents an optimal simulation by the abstract operators over the behavior of the concrete operators. This corresponds to an ideal (often rare) feature where there is no loss of information accumulated in abstract computations with respect to the properties encoded by the underlying abstract domains. In this thesis, we deal with the opposite notion of completeness in abstract interpretation, that is, incompleteness, applied to two different contexts: static program analysis and formal languages over the Chomsky's hierarchy. In static
APA, Harvard, Vancouver, ISO, and other styles
2

"On completeness of partial metric spaces, symmetric spaces and some fixed point results." Thesis, 2016. http://hdl.handle.net/10500/23206.

Full text
Abstract:
The purpose of the thesis is to study completeness of abstract spaces. In particular, we study completeness in partial metric spaces, partial metric type spaces, dislocated metric spaces, dislocated metric type spaces and symmetric spaces that are generalizations of metric spaces. It is well known that complete metric spaces have a wide range of applications. For instance, the classical Banach contraction principle is phrased in the context of complete metric spaces. Analogously, the Banach's xed point theorem and xed point results for Lipschitzian maps are discussed in this context,
APA, Harvard, Vancouver, ISO, and other styles
3

Aphane, Maggie. "On completeness of partial metric spaces, symmetric spaces and some fixed point results." Thesis, 2016. http://hdl.handle.net/10500/23223.

Full text
Abstract:
The purpose of the thesis is to study completeness of abstract spaces. In particular, we study completeness in partial metric spaces, partial metric type spaces, dislocated metric spaces, dislocated metric type spaces and symmetric spaces that are generalizations of metric spaces. It is well known that complete metric spaces have a wide range of applications. For instance, the classical Banach contraction principle is phrased in the context of complete metric spaces. Analogously, the Banach's xed point theorem and xed point results for Lipschitzian maps are discussed in this context,
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Partial Completeness"

1

Schneider, Dona. Completeness and accuracy of cancer mortality and incidence data: Vital records, tumor registries, and hospital medical records : a selected and partially annotated bibliography. Vance Bibliographies, 1989.

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

Completeness of root functions of regular differential operators. Longman Scientific & Technical, 1994.

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

Michael, Furmston, Tolhurst G J, and Mik Eliza. 11 Certainty and Completeness. Oxford University Press, 2016. http://dx.doi.org/10.1093/law/9780198724032.003.0011.

Full text
Abstract:
This chapter discusses the issues of uncertainty and incompleteness in contract formation. A contract is said to be void if it is uncertain or incomplete. A term contained in the contract will be uncertain if it totally lacks meaning or if a court cannot determine the meaning the parties intended. Generally, a contract will be void for uncertainty if it is not possible to prescribe meaning to an essential term. A term will be incomplete if it does not adequately deal with an issue that has arisen under the contract and which falls within its subject matter. A contract will be void for being in
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Partial Completeness"

1

Binding, Paul, and Rostyslav Hryniv. "Full- and Partial-Range Completeness." In Linear Operators and Matrices. Birkhäuser Basel, 2002. http://dx.doi.org/10.1007/978-3-0348-8181-4_10.

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

Yakubov, Sasun. "Partial Differential Equations." In Completeness of Root Functions of Regular Differential Operators. Routledge, 2021. https://doi.org/10.1201/9781315139838-7.

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

Bonifacio, Adilson Luiz, and Arnaldo Vieira Moura. "Test Suite Completeness and Partial Models." In Software Engineering and Formal Methods. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-10431-7_8.

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

Cousot, Patrick. "Partial Completeness of Abstract Fixpoint Checking." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44914-0_1.

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

Demuth, M., E. Giere, and K. B. Sinha. "A Semigroup Criterion for the Completeness of Scattering Systems." In Partial Differential Equations and Spectral Theory. Birkhäuser Basel, 2001. http://dx.doi.org/10.1007/978-3-0348-8231-6_11.

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

Hendrix, Joe, Manuel Clavel, and José Meseguer. "A Sufficient Completeness Reasoning Tool for Partial Specifications." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-32033-3_13.

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

Skibsted, Erik. "On the Asymptotic Completeness for Particles in Constant Electromagnetic Fields." In Partial Differential Equations and Mathematical Physics. Birkhäuser Boston, 1996. http://dx.doi.org/10.1007/978-1-4612-0775-7_19.

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

Beurskens, Paul T., and Cornelia Smykalla. "From Partial Structure to Completeness — Direct Methods Applied to Difference Structure Factors." In Direct Methods of Solving Crystal Structures. Springer US, 1991. http://dx.doi.org/10.1007/978-1-4899-3692-9_28.

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

Marmanis, Iason, Michalis Kokologiannakis, and Viktor Vafeiadis. "Reconciling Preemption Bounding with DPOR." In Tools and Algorithms for the Construction and Analysis of Systems. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30823-9_5.

Full text
Abstract:
AbstractThere are two major techniques for scaling up stateless model checking: dynamic partial order reduction (DPOR), which only explores executions that differ in the ordering of racy accesses, and preemption bounding, which only explores executions containing up to k preemptions (preemptive context-switches).Combining these two techniques is challenging because DPOR-equivalent executions often contain a different number of preemptions, making it incorrect to cut explorations that exceed the preemption bound. To restore completeness, prior work has weakened the DPOR algorithm, which often r
APA, Harvard, Vancouver, ISO, and other styles
10

Bromberger, Martin, Chaahat Jain, and Christoph Weidenbach. "SCL(FOL) Can Simulate Non-Redundant Superposition Clause Learning." In Automated Deduction – CADE 29. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-38499-8_8.

Full text
Abstract:
AbstractWe show that SCL(FOL) can simulate the derivation of non-redundant clauses by superposition for first-order logic without equality. Superposition-based reasoning is performed with respect to a fixed reduction ordering. The completeness proof of superposition relies on the grounding of the clause set. It builds a ground partial model according to the fixed ordering, where minimal false ground instances of clauses then trigger non-redundant superposition inferences. We define a respective strategy for the SCL calculus such that clauses learned by SCL and superposition inferences coincide
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Partial Completeness"

1

Putra, Luis Ode, Irwan Ridwan Rahim, and Rosmariani Arifuddin. "Analysis of Construction Disputes in South Sulawesi: Contractor Companies Perspective." In International Conference on Research in Engineering and Science Technology (IC-REST) 2023. Trans Tech Publications Ltd, 2025. https://doi.org/10.4028/p-pnnq84.

Full text
Abstract:
South Sulawesi is one of Indonesia's provinces with great potential in the construction sector. However, South Sulawesi faces various challenges in the construction sector, including construction disputes. This study aims to analyze the factors that cause construction disputes between small, medium, and large construction companies in South Sulawesi. Data were collected using questionnaires to project stakeholders and previous research. The method used was Structural Equation Modeling with a Partial Least Squares system. Seven factors cause disputes in construction projects, namely the problem
APA, Harvard, Vancouver, ISO, and other styles
2

Marín, Josefa. "Partial quasi-metric completeness and Caristi's type mappings." In NUMERICAL ANALYSIS AND APPLIED MATHEMATICS ICNAAM 2012: International Conference of Numerical Analysis and Applied Mathematics. AIP, 2012. http://dx.doi.org/10.1063/1.4756274.

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

Zou, H., A. H. Tewfik, and W. Xu. "Completeness and stability of partial dyadic wavelet domain signal representations." In Proceedings of ICASSP '93. IEEE, 1993. http://dx.doi.org/10.1109/icassp.1993.319498.

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

Guo, Yan, Chenglu Wen, Xiaotian Sun, Cheng Wang, and Jonathan Li. "Partial 3D Object Retrieval and Completeness Evaluation for Urban Street Scene." In IGARSS 2019 - 2019 IEEE International Geoscience and Remote Sensing Symposium. IEEE, 2019. http://dx.doi.org/10.1109/igarss.2019.8898701.

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

Keren, Sarah, Sara Bernardini, Kofi Kwapong, and David C. Parkes. "Reasoning About Plan Robustness Versus Plan Cost for Partially Informed Agents." 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/55.

Full text
Abstract:
A common approach to planning with partial information is replanning: compute a plan based on assumptions about unknown information and replan if these assumptions are refuted during execution. To date, most planners with incomplete information have been designed to provide guarantees on completeness and soundness for the generated plans. Switching focus to performance, we measure the robustness of a plan, which quantifies the plan’s ability to avoid failure. Given a plan and an agent’s belief, which describes the set of states it deems as possible, robustness counts the number of world states
APA, Harvard, Vancouver, ISO, and other styles
6

Turečková, Kamila. "Syntéza typologie a kategorizace brownfieldů." In XXIV. mezinárodního kolokvia o regionálních vědách. Masaryk University Press, 2021. http://dx.doi.org/10.5817/cz.muni.p210-9896-2021-59.

Full text
Abstract:
The aim of the presented paper is to synthesize a partial non-uniform typology of brownfields into a logical and complex framework with reference to the content and classification completeness. The synthesis of typological schemes and their objective categorization into standard classes and groups reflecting the general requirements for the characteristics of brownfields that will allow to define individual brownfields in a uniform way and furtherly works with them analytically on the background of standardized categories. The presented categorization of brownfields is based on the already use
APA, Harvard, Vancouver, ISO, and other styles
7

Delgrande, James. "A Preference-Based Approach to Defeasible Deontic Inference." 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/33.

Full text
Abstract:
In this paper we present an approach to defeasible deontic inference. Given a set of rules R expressing conditional obligations and a formula A giving contingent information, the goal is to determine the most desirable outcome with respect to this information. Semantically, the rules R induce a partial preorder on the set of models, giving the relative desirability of each model. Then the set of minimal A models characterises the best that can be attained given that A holds. A syntactic approach is also given, in terms of maximal subsets of material counterparts of rules in R, and that yields
APA, Harvard, Vancouver, ISO, and other styles
8

Ravishankar, Mahesh, Sandip Mazumder, and Ankan Kumar. "Finite-Volume Solution of the P3 Equations of Radiative Transfer and Coupling to Reacting Flow Calculations." In ASME 2009 Heat Transfer Summer Conference collocated with the InterPACK09 and 3rd Energy Sustainability Conferences. ASMEDC, 2009. http://dx.doi.org/10.1115/ht2009-88014.

Full text
Abstract:
The method of spherical harmonics (or PN) is a popular method for approximate solution of the radiative transfer equation (RTE) in participating media. A rigorous conservative finite-volume (FV) procedure is presented for discretization of the P3 equations of radiative transfer in two-dimensional geometry—a set of four coupled second-order partial differential equations. The FV procedure, presented here, is applicable to any arbitrary unstructured mesh topology. The resulting coupled set of discrete algebraic equations are solved implicitly using a coupled solver that involves decomposition of
APA, Harvard, Vancouver, ISO, and other styles
9

Sood, P. C., R. K. Sheline, R. W. Hoff, and A. K. Jain. "Completeness of two‐particle spectra of deformed nuclei." In Capture gamma‐ray spectroscopy. American Institute of Physics, 1991. http://dx.doi.org/10.1063/1.41164.

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

LIU, MIN, KAIYUN WANG, and BIN ZHAO. "A NOTE ON COMPLETENESS OF L-PARTIALLY ORDERED SETS." In Proceedings of the QL&SC 2012. WORLD SCIENTIFIC, 2012. http://dx.doi.org/10.1142/9789814401531_0070.

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

Reports on the topic "Partial Completeness"

1

Baader, Franz, and Barbara Morawska. Matching with respect to general concept inclusions in the Description Logic EL. Technische Universität Dresden, 2014. http://dx.doi.org/10.25368/2022.205.

Full text
Abstract:
Matching concept descriptions against concept patterns was introduced as a new inference task in Description Logics (DLs) almost 20 years ago, motivated by applications in the Classic system. For the DL EL, it was shown in 2000 that the matching problem is NP-complete. It then took almost 10 years before this NP-completeness result could be extended from matching to unification in EL. The next big challenge was then to further extend these results from matching and unification without a TBox to matching and unification w.r.t. a general TBox, i.e., a finite set of general concept inclusions. Fo
APA, Harvard, Vancouver, ISO, and other styles
2

Hanbali, Layth, Elliot Hannon, Susanna Lehtimaki, Christine McNab, and Nina Schwalbe. Independent Monitoring Mechanism for the Pandemic Accord: Accountability for a safer world. United Nations University International Institute of Global Health, 2022. http://dx.doi.org/10.37941/rr/2022/1.

Full text
Abstract:
To address the challenges in pandemic preparedness and response (PPR), the World Health Assembly (WHA), at a special session in November 2021, established an Intergovernmental Negotiating Body (the INB) and tasked it with drafting a new legal instrument for PPR. During its second meeting in July 2022, the INB decided to develop the accord under Article 19 of the WHO Constitution, which grants the WHO the authority to negotiate a legally-binding Convention or Agreement and requires ratification by countries according to their local laws to enter into force. The aim is to complete negotiations a
APA, Harvard, Vancouver, ISO, and other styles
3

Rudyk, Myroslava. COMMUNICATIVE FEATURES OF UKRAINIAN VIDEO BLOGS ON THE EXAMPLE OF YOUTUBE-CHANNELS OF «TORONTO TV», YANINA SOKOLOVA, AND OSTAP DROZDOV. Ivan Franko National University of Lviv, 2021. http://dx.doi.org/10.30970/vjo.2021.50.11111.

Full text
Abstract:
The article is devoted to the study of the Ukrainian segment of video blogging as one of the most popular types of the functioning of the modern blogosphere. The content and statistics of popular video blogs were studied on the example of YouTube channels of Ukrainian bloggers and famous journalists. Today we are witnessing the rapid development of technologies that help journalists become better, and the creators of media content to work more quickly and ensure the completeness of the information. With the help of Internet communication, new ways of disseminating information have appeared in
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Partial Completeness' for particular source types:
Journal articles
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