Log in

Relevant bibliographies by topics / Partial Completeness / Journal articles

To see the other types of publications on this topic, follow the link: Partial Completeness.

Journal articles 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 top 50 journal articles for your research 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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

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

11

Heering, Jan. "Partial evaluation and ω-completeness of algebraic specifications". Theoretical Computer Science 43 (1986): 149–67. http://dx.doi.org/10.1016/0304-3975(86)90173-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Veerapaneni, Rishi, Muhammad Suhail Saleem, Jiaoyang Li, and Maxim Likhachev. "Windowed MAPF with Completeness Guarantees." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 22 (2025): 23323–32. https://doi.org/10.1609/aaai.v39i22.34499.

Full text

Abstract:

Traditional multi-agent path finding (MAPF) methods try to compute entire collision free start-goal paths, with several algorithms offering completeness guarantees. However, computing partial paths offers significant advantages including faster planning, adaptability to changes, and enabling decentralized planning. Methods that compute partial paths employ a "windowed" approach and only try to find collision free paths for a limited timestep horizon. While this improves flexibility, this adaptation introduces incompleteness; all existing windowed approaches can become stuck in deadlock or live

APA, Harvard, Vancouver, ISO, and other styles

13

Paesano, Daniela, and Pasquale Vetro. "Common Fixed Points in a Partially Ordered Partial Metric Space." International Journal of Analysis 2013 (January 13, 2013): 1–8. http://dx.doi.org/10.1155/2013/428561.

Full text

Abstract:

In the first part of this paper, we prove some generalized versions of the result of Matthews in (Matthews, 1994) using different types of conditions in partially ordered partial metric spaces for dominated self-mappings or in partial metric spaces for self-mappings. In the second part, using our results, we deduce a characterization of partial metric 0-completeness in terms of fixed point theory. This result extends the Subrahmanyam characterization of metric completeness.

APA, Harvard, Vancouver, ISO, and other styles

14

Romov, B. A. "Completeness theory for the product of finite partial algebras." Discrete Mathematics 274, no. 1-3 (2004): 241–64. http://dx.doi.org/10.1016/s0012-365x(03)00091-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Larchey-Wendling, Dominique. "The formal strong completeness of partial monoidal Boolean BI." Journal of Logic and Computation 26, no. 2 (2014): 605–40. http://dx.doi.org/10.1093/logcom/exu031.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Carlson, Timothy J. "Ranked partial structures." Journal of Symbolic Logic 68, no. 4 (2003): 1109–44. http://dx.doi.org/10.2178/jsl/1067620176.

Full text

Abstract:

AbstractThe theory of ranked partial structures allows a reinterpretation of several of the standard results of model theory and first-order logic and is intended to provide a proof-theoretic method which allows for the intuitions of model theory. A version of the downward Löwenheim-Skolem theorem is central to our development. In this paper we will present the basic theory of ranked partial structures and their logic including an appropriate version of the completeness theorem.

APA, Harvard, Vancouver, ISO, and other styles

17

Grinshpoun, T., and A. Meisels. "Completeness and Performance Of The APO Algorithm." Journal of Artificial Intelligence Research 33 (October 23, 2008): 223–58. http://dx.doi.org/10.1613/jair.2611.

Full text

Abstract:

Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions the search into different subproblems of the DisCSP. The original proof of completeness of the APO algorithm is based on the growth of the size of the subproblems. The present paper demonstrates that this expected growth of subproblems does not occur in some situations, leading to a termination problem of the algorithm. The problematic parts in the APO algorithm that interfere with its completeness are identified and

APA, Harvard, Vancouver, ISO, and other styles

18

Liu, Yu Zhen, Xing Bao Liu, and Xin Fen Zhang. "Decision on Function of One Simple Separable Relation for the Minimal Covering of P^*_K." Applied Mechanics and Materials 496-500 (January 2014): 2303–5. http://dx.doi.org/10.4028/www.scientific.net/amm.496-500.2303.

Full text

Abstract:

In the function structure theory of multi-logic, decision on Sheffer function is an important role. It contains structure and decision of full multi-logic and partial multi-logic. Its decision is closely related to decision of completeness of function which can be done by deciding the minimal covering of full multi-logic and partial-logic. By theory of completeness of partial multi-logic, we prove that function of one simple separable ralation is not minimal covering of P*K under the condition of m=2, σ=e .

APA, Harvard, Vancouver, ISO, and other styles

19

Rashid, Tawseef, Mohammed M. M. Jaradat, Qamrul Haq Khan, Zoran D. Mitrović, Hassen Aydi, and Zead Mustafa. "A new approach in the context of ordered incomplete partial b-metric spaces." Open Mathematics 18, no. 1 (2020): 996–1005. http://dx.doi.org/10.1515/math-2020-0054.

Full text

Abstract:

Abstract The main purpose of this paper is to find some fixed point results with a new approach, particularly in those cases where the existing literature remains silent. More precisely, we introduce partial completeness, f̄-orbitally completeness, a new type of contractions and many other notions. We also ensure the existence of fixed points for non-contraction maps in the class of incomplete partial b-metric spaces. We have reported some examples in support of our results.

APA, Harvard, Vancouver, ISO, and other styles

20

Montagna, Franco, and Andrea Sorbi. "Creativeness and completeness in recursion categories of partial recursive operators." Journal of Symbolic Logic 54, no. 3 (1989): 1023–41. http://dx.doi.org/10.2307/2274763.

Full text

Abstract:

Recursion categories have been proposed by Di Paola and Heller in [DPH] as the basis for a category-theoretic approach to recursion theory, in the context of a more general and ambitious project of a purely algebraic treatment of incompleteness phenomena. The way in which the classical notion of creative set is rendered in this new category-theoretic framework plays, therefore, a central role. This is done in [DPH] (Definition 8.1) by defining the notion of creative domains or, rather, domains which are creative relative to some criterion: thus, in a recursion category, every criterion provide

APA, Harvard, Vancouver, ISO, and other styles

21

Le Guiban, Kaourintin, Arpad Rimmel, Marc-Antoine Weisser, and Joanna Tomasik. "Completion of partial Latin Hypercube Designs: NP-completeness and inapproximability." Theoretical Computer Science 715 (March 2018): 1–20. http://dx.doi.org/10.1016/j.tcs.2018.01.014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Romaguera, Salvador. "A Kirk Type Characterization of Completeness for Partial Metric Spaces." Fixed Point Theory and Applications 2010 (2010): 1–7. http://dx.doi.org/10.1155/2010/493298.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Golunkov, Yu V. "Approximate completeness in algebras of partial recursive functions and predicates." Cybernetics 23, no. 6 (1988): 752–57. http://dx.doi.org/10.1007/bf01070236.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Iqbal, Nayyar, and Jun Sang. "Fuzzy Logic Testing Approach for Measuring Software Completeness." Symmetry 13, no. 4 (2021): 604. http://dx.doi.org/10.3390/sym13040604.

Full text

Abstract:

Due to advancements in science and technology, software is constantly evolving. To adapt to newly demanded requirements in a piece of software, software components are modified or developed. Measuring software completeness has been a challenging task for software companies. The uncertain and imprecise intrinsic relationships within software components have been unaddressed by researchers during the validation process. In this study, we introduced a new fuzzy logic testing approach for measuring the completeness of software. We measured the fuzzy membership value for each software component by

APA, Harvard, Vancouver, ISO, and other styles

25

Komorowski, Jan. "A Prolegomenon to Partial Deduction." Fundamenta Informaticae 18, no. 1 (1993): 41–64. http://dx.doi.org/10.3233/fi-1993-18104.

Full text

Abstract:

Partial deduction is a specialization principle related to the law of syllogism. It has several computational applications in logic programming but it has been recently also used in deductive databases, machine learning, software synthesis and other areas of computing. This article is a systematic introduction to partial deduction, its applications and open problems. Starting from an informal and intuitive presentation, the fundamental notions such as correctness and completeness are discussed. A selection of applications is presented to illustrate partial deduction in different contexts.

APA, Harvard, Vancouver, ISO, and other styles

26

Altun, Ishak, and Salvador Romaguera. "Characterizations of partial metric completeness in terms of weakly contractive mappings having fixed point." Applicable Analysis and Discrete Mathematics 6, no. 2 (2012): 247–56. http://dx.doi.org/10.2298/aadm120322009a.

Full text

Abstract:

We characterize both complete and 0-complete partial metric spaces in terms of weakly contractive mappings having a fixed point. Our results extend a well-known characterization of metric completeness due to Suzuki and Takahashi to the partial metric framework.

APA, Harvard, Vancouver, ISO, and other styles

27

Miñana, Juan-José, and Oscar Valero. "On partial metric preserving functions and their characterization." Filomat 34, no. 7 (2020): 2315–27. http://dx.doi.org/10.2298/fil2007315m.

Full text

Abstract:

In 1981, J. Bors?k and J. Dob?s characterized those functions that allow to transform a metric into another one in such a way that the topology of the metric to be transformed is preserved. Later on, in 1994, S.G. Matthews introduced a new generalized metric notion known as partial metric. In this paper, motivated in part by the applications of partial metrics, we characterize partial metric-preserving functions, i.e., those functions that help to transform a partial metric into another one. In particular we prove that partial metric-preserving functions are exactly those that are strictly mon

APA, Harvard, Vancouver, ISO, and other styles

28

BIRGET, JEAN-CAMILLE. "CIRCUITS, THE GROUPS OF RICHARD THOMPSON, AND coNP-COMPLETENESS." International Journal of Algebra and Computation 16, no. 01 (2006): 35–90. http://dx.doi.org/10.1142/s0218196706002822.

Full text

Abstract:

We construct a finitely presented group with coNP-complete word problem, and a finitely generated simple group with coNP-complete word problem. These groups are represented as Thompson groups, hence as partial transformation groups of strings. The proof provides a simulation of combinational circuits by elements of the Thompson–Higman group G3,1.

APA, Harvard, Vancouver, ISO, and other styles

29

Muhammad Hamzah Ramazan. "PENGARUH KELENGKAPAN PRODUK DAN PROMOSI TERHADAP KEPUTUSAN PEMBELIAN (Studi pada Konsumen Toko Bazar Bangunan Tambun Bekasi)." Lobi 1, no. 1 (2024): 45–57. http://dx.doi.org/10.15575/lobi.v1i1.682.

Full text

Abstract:

This study aims to determine the partial and simultaneous effect of Product Completeness and Promotion on Consumer Purchase Decisions at the Toko Bazar Bangunan Tambun Bekasi. The research method used is descriptive and verification research methods with a quantitative approach. Data analysis techniques using Descriptive Analysis, Validity Test, Reliability Test, Multiple Linear Regression Test, t-test (partial), F-test (simultaneous), and Coefficient of Determination Test using SPSS version 27. Based on the results it shows that Product Completeness has an effect positive and significant effe

APA, Harvard, Vancouver, ISO, and other styles

30

Campion, Marco, Mila Dalla Preda, and Roberto Giacobazzi. "Partial (In)Completeness in abstract interpretation: limiting the imprecision in program analysis." Proceedings of the ACM on Programming Languages 6, POPL (2022): 1–31. http://dx.doi.org/10.1145/3498721.

Full text

Abstract:

Imprecision is inherent in any decidable (sound) approximation of undecidable program properties. In abstract interpretation this corresponds to the release of false alarms, e.g., when it is used for program analysis and program verification. As all alarming systems, a program analysis tool is credible when few false alarms are reported. As a consequence, we have to live together with false alarms, but also we need methods to control them. As for all approximation methods, also for abstract interpretation we need to estimate the accumulated imprecision during program analysis. In this paper we

APA, Harvard, Vancouver, ISO, and other styles

31

Baisnab, A. P., and Sumana Pal. "On p-h Points and Completeness Property of a Partial Metric Space." Annals of Pure and Applied Mathematics 16, no. 2 (2018): 393–400. http://dx.doi.org/10.22457/apam.v16n2a16.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Carter, B. A. "Accuracy and Completeness of Pathology Reporting - Impact on Partial Breast Irradiation Eligibility." Yearbook of Pathology and Laboratory Medicine 2012 (January 2012): 25–26. http://dx.doi.org/10.1016/j.ypat.2011.11.067.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Soemarsono, Annisa Rahmita, Mahmud Yunus, Erna Apriliani, and Adam Adam. "Convergence and Completeness in L_2 (P) with respect to a Partial Metric." International Journal of Computing Science and Applied Mathematics 9, no. 1 (2023): 27. http://dx.doi.org/10.12962/j24775401.v9i1.15064.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Ferrand, Gérard, and Pierre Deransart. "Proof method of partial correctness and weak completeness for normal logic programs." Journal of Logic Programming 17, no. 2-4 (1993): 265–78. http://dx.doi.org/10.1016/0743-1066(93)90033-d.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Pignol, J. P., E. Rakovitch, J. Zeppieri, and W. Hanna. "Accuracy and Completeness of Pathology Reporting — Impact on Partial Breast Irradiation Eligibility." Clinical Oncology 24, no. 3 (2012): 177–82. http://dx.doi.org/10.1016/j.clon.2011.09.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

CHEN, HUIPING, XIA SUN, HUIXUAN CHEN, ZIQIN WU, and BINGHONG WANG. "EVALUATION OF SOME CALCULATED PARTIAL MULTIFRACTAL SPECTRA." International Journal of Modern Physics B 18, no. 17n19 (2004): 2569–74. http://dx.doi.org/10.1142/s0217979204025683.

Full text

Abstract:

Some parameters are introduced to evaluate the completeness of a partial multifractal spectrum with the shape of a bell or a hook, calculated using a statistical method due to a finite range of moment q. From the results of two kinds of Cantor sets, p/0/1-p and p/1-2p/p, and some examples of random fractals, it shows that the more homogeneous the probability distribution of the quantity studied is, the larger the range of q in the partial multifractal spectrum with the same evaluation parameters.

APA, Harvard, Vancouver, ISO, and other styles

37

Sarkar, Koushik, and Manoranjan Singha. "Some fixed point theorems in partial \(S_b\)-metric spaces." Journal of Advanced Studies in Topology 9, no. 1 (2018): 1. http://dx.doi.org/10.20454/jast.2018.1370.

Full text

Abstract:

N. Souayah [10] introduced the concept of partial Sb-metric spaces. In this paper, we established a fixed point theorem for a new class of contractive mappings and a generalization of Theorem 2 from [T. Suzuki, A generalized Banach contraction principle that characterizes metric completeness, Proc. Am. Math. Soc. 136, (2008), 1861-1869] in partial Sb-metric spaces. We provide an example in support of our result.

APA, Harvard, Vancouver, ISO, and other styles

38

HARRISON-TRAINOR, MATTHEW. "FIRST-ORDER POSSIBILITY MODELS AND FINITARY COMPLETENESS PROOFS." Review of Symbolic Logic 12, no. 4 (2019): 637–62. http://dx.doi.org/10.1017/s1755020319000418.

Full text

Abstract:

AbstractThis article builds on Humberstone’s idea of defining models of propositional modal logic where total possible worlds are replaced by partial possibilities. We follow a suggestion of Humberstone by introducing possibility models for quantified modal logic. We show that a simple quantified modal logic is sound and complete for our semantics. Although Holliday showed that for many propositional modal logics, it is possible to give a completeness proof using a canonical model construction where every possibility consists of finitely many formulas, we show that this is impossible to do in

APA, Harvard, Vancouver, ISO, and other styles

39

Rahayu, Elly. "Pengaruh Lokasi, Kelengkapan Produk, dan Pelayanan Terhadap Keputusan Pembelian Konsumen pada Imam Market Kisaran." JOURNAL OF SCIENCE AND SOCIAL RESEARCH 1, no. 1 (2018): 7. http://dx.doi.org/10.54314/jssr.v1i1.108.

Full text

Abstract:

This study is purpose to examine the influence of location, completeness of products and services to consumer purchasing decisions at Swalayan Imam Market. The population of this study are consumers who have been shopping at Imam Market Kisaran. The sample of this study is the consumers who shop at Imam Market within the last 3 months The technique sampling used is accidental sampling method . Best of the t test (partial test) that have been done, Service dan Location which have influence to consumer buying decition on Imam Market Kisaran and product completeness has no effect to consumer buyi

APA, Harvard, Vancouver, ISO, and other styles

40

Strannegård, Claes. "Interpretability over peano arithmetic." Journal of Symbolic Logic 64, no. 4 (1999): 1407–25. http://dx.doi.org/10.2307/2586787.

Full text

Abstract:

AbstractWe investigate the modal logic of interpretability over Peano arithmetic. Our main result is a compactness theorem that extends the arithmetical completeness theorem for the interpretability logic ILMω. This extension concerns recursively enumerable sets of formulas of interpretability logic (rather than single formulas). As corollaries we obtain a uniform arithmetical completeness theorem for the interpretability logic ILM and a partial answer to a question of Orey from 1961. After some simplifications, we also obtain Shavrukov's embedding theorem for Magari algebras (a.k.a. diagonali

APA, Harvard, Vancouver, ISO, and other styles

41

Ira Nur Alfiana and Muhtadin Amri. "Pengaruh Kemudahan dan Kelengkapan Fitur BSI Mobile Terhadap Kepuasan dan Loyalitas Nasabah." Mutanaqishah: Journal of Islamic Banking 3, no. 1 (2024): 55–66. http://dx.doi.org/10.54045/mutanaqishah.v3i1.774.

Full text

Abstract:

The purpose of this study was to analyze the effect of convenience and completeness of features on satisfaction and loyalty and whether satisfaction is able to mediate the effect of convenience and completeness of features on customer loyalty. This research is a quantitative study with a sample of 100 BSI customers using mobile banking with incidental sampling technique. Data was collected by distributing questionnaires to a sample of 100 customers. The data was analyzed using the partial least square (PLS) method. The results showed that: convenience has no effect on customer satisfaction and

APA, Harvard, Vancouver, ISO, and other styles

42

Ghilardi, Silvio, and Giancarlo Meloni. "Relational and partial variable sets and basic predicate logic." Journal of Symbolic Logic 61, no. 3 (1996): 843–72. http://dx.doi.org/10.2307/2275788.

Full text

Abstract:

AbstractIn this paper we study the logic of relational and partial variable sets, seen as a generalization of set-valued presheaves, allowing transition functions to be arbitrary relations or arbitrary partial functions. We find that such a logic is the usual intuitionistic and co-intuitionistic first order logic without Beck and Frobenius conditions relative to quantifiers along arbitrary terms. The important case of partial variable sets is axiomatizable by means of the substitutivity schema for equality. Furthermore, completeness, incompleteness and independence results are obtained for dif

APA, Harvard, Vancouver, ISO, and other styles

43

Mukti, Widodo Prayoga. "Pengaruh display produk dan kelengkapan produk terhadap keputusan pembelian di Toko Elektronik Kusuma Kecamatan Pakel Kabupaten Tulungagung." Jurnal Bisnis, Manajemen, dan Ekonomi 5, no. 2 (2024): 91–98. http://dx.doi.org/10.47747/jbme.v5i2.1726.

Full text

Abstract:

Kusuma Electronic Shop is a retail business selling various electronic devices, such as speakers, electrical components, lamps, etc. Kusuma electronic shop is here to make it easier for consumers to find electronic needs. The various conveniences offered by Kusuma electronic shop support product display and completeness in purchasing decisions. This study aimed to examine the effect of product display and product completeness partially and simultaneously on buying decisions. This research was a quantitative study with variables of product display, product completeness, and buying decisions. To

APA, Harvard, Vancouver, ISO, and other styles

44

Romov, B. A. "The completeness problem in the algebra of partial functions of finite-valued logic." Cybernetics 26, no. 1 (1990): 133–38. http://dx.doi.org/10.1007/bf01068239.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

van Bakel, Steffen. "Completeness and partial soundness results for intersection and union typing for λ¯μμ̃". Annals of Pure and Applied Logic 161, № 11 (2010): 1400–1430. http://dx.doi.org/10.1016/j.apal.2010.04.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Le, Hai S., Brendan Juba, and Roni Stern. "Learning Safe Action Models with Partial Observability." Proceedings of the AAAI Conference on Artificial Intelligence 38, no. 18 (2024): 20159–67. http://dx.doi.org/10.1609/aaai.v38i18.29995.

Full text

Abstract:

A common approach for solving planning problems is to model them in a formal language such as the Planning Domain Definition Language (PDDL), and then use an appropriate PDDL planner. Several algorithms for learning PDDL models from observations have been proposed but plans created with these learned models may not be sound. We propose two algorithms for learning PDDL models that are guaranteed to be safe to use even when given observations that include partially observable states. We analyze these algorithms theoretically, characterizing the sample complexity each algorithm requires to guaran

APA, Harvard, Vancouver, ISO, and other styles

47

Penczek, Wojciech. "A Temporal Logic for Event Structures." Fundamenta Informaticae 11, no. 3 (1988): 297–326. http://dx.doi.org/10.3233/fi-1988-11307.

Full text

Abstract:

A temporal logic for event structures based on a partial order frame of local states is presented. Two modalities, for causality and conflict, are introduced. Completeness of the axiom system is proved. The finite model property and decidability are discussed.

APA, Harvard, Vancouver, ISO, and other styles

48

Ulfa, Aisyah Nur Ulia, Indah Listyani, Edy Swasono, and Afrila Mu’arrofah. "PENGARUH KENYAMANAN, KELENGKAPAN PRODUK DAN HARGA PRODUK TERHADAP KEPUTUSAN PEMBELIAN PRODUK SWALAYAN KOPERTA LANGGENG MULYO." Commodities, Journal of Economic and Business 3, no. 3 (2023): 148–60. http://dx.doi.org/10.59689/commo.v3i3.888.

Full text

Abstract:

This study aims to determine the effect of comfort, product completeness and price on consumer purchasing decisions at the Koperta Langgeng Mulyo Ngancar Kediri Supermarkets. In this study the population was 765 consumers. The sample is 79 respondents. Typical accidental sampling sampling. Data analysis techniques used in this study were to use the validity and reliability test, multiple linear regression test and hypothesis testing through SPSS. Based on the analysis conducted, the results of the study are obtained: (1) Empirically proven that comfort has no effect on purchasing decisions. (2

APA, Harvard, Vancouver, ISO, and other styles

49

Verbrugge, Rineke, and Albert Visser. "A small reflection principle for bounded arithmetic." Journal of Symbolic Logic 59, no. 3 (1994): 785–812. http://dx.doi.org/10.2307/2275908.

Full text

Abstract:

AbstractWe investigate the theory IΔ0+Ω1 and strengthen [Bu86, Theorem 8.6] to the following: if NP ≠ co-NP, then Σ-completeness for witness comparison foumulas is not provable in bounded arithmetic. i.e.,Next we study a “small reflection principle” in bounded arithmetic. We prove that for all sentences φThe proof hinges on the use of definable cuts and partial satisfaction predicates akin to those introduced by Pudlák in [Pu86].Finally, we give some applications of the small reflection principle, showing that the principle can sometimes be invoked in order to circumvent the use of provable Σ-

APA, Harvard, Vancouver, ISO, and other styles

50

Baiti, Ana Nur, and Saodin Saodin. "Pengaruh Kelengkapan Produk Dan Promosi Terhadap Keputusan Pembelian Pada Kembar Store Sidomulyo di Lampung Selatan." Jurnal Ekonomika Dan Bisnis (JEBS) 4, no. 6 (2024): 1822–27. https://doi.org/10.47233/jebs.v4i6.2320.

Full text

Abstract:

Purchasing Decisions are several stages carried out by consumers before making a decision to purchase a product, which is influenced by Product Completeness and Promotion. This research aims to determine the influence of product completeness and promotion on purchasing decisions at the Sidomulyo Store Twins in South Lampung. The type of research used in this research is Quantitative Research, with the sampling technique used in this research being Non Probability Sampling with the Accidental Sampling technique. To find the validity test of the instrument using Pearson Product Moment, while the

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!