Log in

Relevant bibliographies by topics / Computable models / Journal articles

To see the other types of publications on this topic, follow the link: Computable models.

Journal articles on the topic 'Computable models'

Author: Grafiati

Published: 2 June 2025

Last updated: 31 July 2025

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Computable models.'

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

Turner, R. "Computable Models." Journal of Logic and Computation 18, no. 2 (2007): 283–318. http://dx.doi.org/10.1093/logcom/exm002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Fullerton, Don. "Computable General Equilibrium Models." Social Science Computer Review 8, no. 4 (1990): 516–19. http://dx.doi.org/10.1177/089443939000800404.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Semukhin, Pavel. "Prime models of finite computable dimension." Journal of Symbolic Logic 74, no. 1 (2009): 336–48. http://dx.doi.org/10.2178/jsl/1231082315.

Full text

Abstract:

AbstractWe study the following open question in computable model theory: does there exist a structure of computable dimension two which is the prime model of its first-order theory? We construct an example of such a structure by coding a certain family of c.e. sets with exactly two one-to-one computable enumerations into a directed graph. We also show that there are examples of such structures in the classes of undirected graphs, partial orders, lattices, and integral domains.

APA, Harvard, Vancouver, ISO, and other styles

4

Khoussainov, Bakhadyr, Andre Nies, and Richard A. Shore. "Computable Models of Theories with Few Models." Notre Dame Journal of Formal Logic 38, no. 2 (1997): 165–78. http://dx.doi.org/10.1305/ndjfl/1039724885.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Palopoli, Luigi, and Carlo Zaniolo. "Polynomial-time computable stable models." Annals of Mathematics and Artificial Intelligence 17, no. 2 (1996): 261–90. http://dx.doi.org/10.1007/bf02127971.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Sugaipov, D. R. "Computable General Equilibrium Models for Migration Analysis: Bibliometric Approach." Economy of regions 21, no. 1 (2025): 151–65. https://doi.org/10.17059/ekon.reg.2025-1-11.

Full text

Abstract:

Computable general equilibrium (CGE) models are widely used to analyse the effects of migration on macroeconomic indicators in both origin and destination countries. Given the often-controversial results of this modelling approach, this paper seeks to systematize the existing experience in constructing CGE models for migration analysis. The methodology includes a bibliometric analysis incorporating complex humanitarian expertise. The analysis indicates that CGE models have gained prominence in assessing migration effects, with their application in high-ranking journals and a substantial number

APA, Harvard, Vancouver, ISO, and other styles

7

Morozov, A. S. "Computable groups of automorphisms of models." Algebra and Logic 25, no. 4 (1986): 261–66. http://dx.doi.org/10.1007/bf01979013.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Ishihara, Hajime, Bakhadyr Khoussainov, and Anil Nerode. "Computable Kripke Models and Intermediate Logics." Information and Computation 143, no. 2 (1998): 205–30. http://dx.doi.org/10.1006/inco.1998.2704.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

O. Odior, Ernest Simeon, and Sabastine Arinze. "THE CONCEPT OF COMPUTABLE GENERAL EQUILIBRIUM MODELS." International Journal of Research in Commerce and Management Studies 04, no. 02 (2022): 01–18. http://dx.doi.org/10.38193/ijrcms.2022.4201.

Full text

Abstract:

This paper contributes to the existing literature on the general concept on use of the Computable general equilibrium (CGE) models of importance in developing processes. Computable general equilibrium (CGE) models are used widely in policy analysis, especially in developed-country academic settings and also for the purpose of sharing these lessons with potential users in developing countries. The range of issues on which CGE models have had an influence is quite wide, and includes structural adjustment policies, international trade, public finance, agriculture, income distribution, and energy

APA, Harvard, Vancouver, ISO, and other styles

10

McAllister, Alex M. "Completions of PA: Models and enumerations of representable sets." Journal of Symbolic Logic 63, no. 3 (1998): 1063–82. http://dx.doi.org/10.2307/2586727.

Full text

Abstract:

AbstractWe generalize a result on True Arithmetic (ℐA) by Lachlan and Soare to certain other completions of Peano Arithmetic (PA). If ℐ is a completion of PA, then Rep(ℐ) denotes the family of sets X ⊆ ω for which there exists a formula φ(x) such that for all n ∈ ω, if n ∈ X, then ℐ ⊢ φ(S(n) (0)) and if n ∉ X, then ℐ ⊢ ┐φ(S(n)(O)). We show that if S, J ⊆ P(ω) such that S is a Scott set, J is a jump ideal, S ⊂ J and for all X ∈ J, there exists C ∈ S such that C is a “coding” set for the family of subtrees of 2<ω computable in X, and if ℐ is a completion of PA Such that Rep(ℐ) = S, then there

APA, Harvard, Vancouver, ISO, and other styles

11

Csima, Barbara F., Denis R. Hirschfeldt, Julia F. Knight, and Robert I. Soare. "Bounding prime models." Journal of Symbolic Logic 69, no. 4 (2004): 1117–42. http://dx.doi.org/10.2178/jsl/1102022214.

Full text

Abstract:

Abstract.A set X is prime bounding if for every complete atomic decidable (CAD) theory T there is a prime model of T decidable in X. It is easy to see that X = 0′ is prime bounding. Denisov claimed that every X <T 0′ is not prime bounding, but we discovered this to be incorrect. Here we give the correct characterization that the prime bounding sets X ≤τ 0′ are exactly the sets which are not low2. Recall that X is low2 if X″ ≤τ 0″. To prove that a low2 set X is not prime bounding we use a 0′ -computable listing of the array of sets {Y : Y ≤τX } to build a CAD theory T which diagonalizes agai

APA, Harvard, Vancouver, ISO, and other styles

12

Lange, Karen. "The degree spectra of homogeneous models." Journal of Symbolic Logic 73, no. 3 (2008): 1009–28. http://dx.doi.org/10.2178/jsl/1230396762.

Full text

Abstract:

AbstractMuch previous study has been done on the degree spectra of prime models of a complete atomic decidable theory. Here we study the analogous questions for homogeneous models. We say a countable model has a d-basis if the types realized in are all computable and the Turing degree d can list -indices for all types realized in . We say has a d-decidable copy if there exists a model ≅ such that the elementary diagram of is d-computable. Goncharov, Millar, and Peretyat'kin independently showed there exists a homogeneous with a 0-basis but no decidable copy.We prove that any homogeneous with a

APA, Harvard, Vancouver, ISO, and other styles

13

GERDES, KLAUS, and CHRISTOPH SCHWAB. "HIERARCHIC MODELS OF HELMHOLTZ PROBLEMS ON THIN DOMAINS." Mathematical Models and Methods in Applied Sciences 08, no. 01 (1998): 1–35. http://dx.doi.org/10.1142/s0218202598000020.

Full text

Abstract:

The Helmholtz equation in a three-dimensional plate is approximated by a hierarchy of two-dimensional models. Computable a posteriori error estimators of the modeling error in exponentially weighted norms are derived, and sharp, computable estimates for their effectivity indices are also obtained. The necessity of including, besides polynomials, a certain number of trigonometric director functions into the Ansatz, in order to prevent pollution effects at high wave numbers is demonstrated both theoretically and computationally.

APA, Harvard, Vancouver, ISO, and other styles

14

Harizanov, Valentina S. "Computability-Theoretic Complexity of Countable Structures." Bulletin of Symbolic Logic 8, no. 4 (2002): 457–77. http://dx.doi.org/10.2178/bsl/1182353917.

Full text

Abstract:

Computable model theory, also called effective or recursive model theory, studies algorithmic properties of mathematical structures, their relations, and isomorphisms. These properties can be described syntactically or semantically. One of the major tasks of computable model theory is to obtain, whenever possible, computability-theoretic versions of various classical model-theoretic notions and results. For example, in the 1950's, Fröhlich and Shepherdson realized that the concept of a computable function can make van der Waerden's intuitive notion of an explicit field precise. This led to the

APA, Harvard, Vancouver, ISO, and other styles

15

Taheripour, Farzad, Xin Zhao, Mark Horridge, Farid Farrokhi, and Wallace Tyner. "Land use in computable general equilibrium models." Journal of Global Economic Analysis 5, no. 2 (2020): 63–109. http://dx.doi.org/10.21642/jgea.050202af.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Ghaith, Ziad, Suren Kulshreshtha, David Natcher, and Bobby Thomas Cameron. "Regional Computable General Equilibrium models: A review." Journal of Policy Modeling 43, no. 3 (2021): 710–24. http://dx.doi.org/10.1016/j.jpolmod.2021.03.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Docquier, Frédéric, and Philippe Liégeois. "Simulating Computable Overlapping Generations Models with TROLL." Computational Economics 23, no. 1 (2004): 1–19. http://dx.doi.org/10.1023/b:csem.0000007093.33504.9a.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Hirschfeldt, Denis R. "Computable trees, prime models, and relative decidability." Proceedings of the American Mathematical Society 134, no. 05 (2005): 1495–98. http://dx.doi.org/10.1090/s0002-9939-05-08097-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Kahn, Michael G. "Computable Protocol Models for Interactive Trial Design." Drug Information Journal 36, no. 3 (2002): 487–97. http://dx.doi.org/10.1177/009286150203600302.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Docquier, Frédéric, and Philippe Liégeois. "Simulating Computable Overlapping Generations Models with Troll." IFAC Proceedings Volumes 31, no. 16 (1998): 403–10. http://dx.doi.org/10.1016/s1474-6670(17)40513-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Kis, P., S. Robinson, and L. D. Tyson. "Computable General Equilibrium Models for Socialist Economies." IFAC Proceedings Volumes 19, no. 10 (1986): 81–86. http://dx.doi.org/10.1016/s1474-6670(17)59646-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Goncharov, S. S., and B. Khoussainov. "Complexity of Categorical Theories with Computable Models." Algebra and Logic 43, no. 6 (2004): 365–73. http://dx.doi.org/10.1023/b:allo.0000048826.92325.02.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Gavryushkin, A. N. "Spectra of computable models for Ehrenfeucht theories." Algebra and Logic 46, no. 3 (2007): 149–57. http://dx.doi.org/10.1007/s10469-007-0014-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Robinson, Sherman, and David W. Roland-Holst. "Macroeconomic structure and computable general equilibrium models." Journal of Policy Modeling 10, no. 3 (1988): 353–75. http://dx.doi.org/10.1016/0161-8938(88)90027-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Vicino, Damian, Gabriel A. Wainer, and Olivier Dalle. "Uncertainty on Discrete-Event System Simulation." ACM Transactions on Modeling and Computer Simulation 32, no. 1 (2022): 1–27. http://dx.doi.org/10.1145/3466169.

Full text

Abstract:

Uncertainty Propagation methods are well-established when used in modeling and simulation formalisms like differential equations. Nevertheless, until now there are no methods for Discrete-Dynamic Systems. Uncertainty-Aware Discrete-Event System Specification (UA-DEVS) is a formalism for modeling Discrete-Event Dynamic Systems that include uncertainty quantification in messages, states, and event times. UA-DEVS models provide a theoretical framework to describe the models’ uncertainty and their properties. As UA-DEVS models can include continuous variables and non-computable functions, their si

APA, Harvard, Vancouver, ISO, and other styles

26

Csima, Barbara F. "Degree spectra of prime models." Journal of Symbolic Logic 69, no. 2 (2004): 430–42. http://dx.doi.org/10.2178/jsl/1082418536.

Full text

Abstract:

Abstract.We consider the Turing degrees of prime models of complete decidable theories. In particular we show that every complete decidable atomic theory has a prime model whose elementary diagram is low. We combine the construction used in the proof with other constructions to show that complete decidable atomic theories have low prime models with added properties.If we have a complete decidable atomic theory with all types of the theory computable, we show that for every degree d with 0 < d < 0', there is a prime model with elementary diagram of degree d. Indeed, this is a corollary of

APA, Harvard, Vancouver, ISO, and other styles

27

Conte, Marisa L., Peter Boisvert, Philip Barrison, et al. "Ten simple rules to make computable knowledge shareable and reusable." PLOS Computational Biology 20, no. 6 (2024): e1012179. http://dx.doi.org/10.1371/journal.pcbi.1012179.

Full text

Abstract:

Computable biomedical knowledge (CBK) is: “the result of an analytic and/or deliberative process about human health, or affecting human health, that is explicit, and therefore can be represented and reasned upon using logic, formal standards, and mathematical approaches.” Representing biomedical knowledge in a machine-interpretable, computable form increases its ability to be discovered, accessed, understood, and deployed. Computable knowledge artifacts can greatly advance the potential for implementation, reproducibility, or extension of the knowledge by users, who may include practitioners,

APA, Harvard, Vancouver, ISO, and other styles

28

Altig, David E., Charles T. Carlstrom, and Kevin J. Lansing. "Computable General Equilibrium Models and Monetary Policy Advice." Journal of Money, Credit and Banking 27, no. 4 (1995): 1472. http://dx.doi.org/10.2307/2078065.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

TSUTSUMI, Morito, Kiyoshi YAMASAKI, Atsushi KOIKE, and Hajime SEYA. "COMPUTABLE URBAN ECONOMIC MODELS: CURRENT ISSUES AND PERSPECTIVES." Journal of Japan Society of Civil Engineers, Ser. D3 (Infrastructure Planning and Management) 68, no. 4 (2012): 344–57. http://dx.doi.org/10.2208/jscejipm.68.344.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Delinchant, Benoit, Frédéric Wurtz, João Vasconcelos, and Jean-Louis Coulomb. "Framework for the optimization of online computable models." COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering 33, no. 3 (2014): 745–58. http://dx.doi.org/10.1108/compel-10-2012-0211.

Full text

Abstract:

Purpose – The purpose of this paper is to make easily accessible models to test and compare the optimization algorithms we develop. Design/methodology/approach – For this, the paper proposes an optimization framework based on software component, web service, and plugin to exploit these models in different environments. Findings – The paper illustrates the discussion with optimizations in Matlab™ and R (www.r-project.org) of a transformer described and exploitable from the internet. Originality/value – The originality is to make easy implementation of simulation model and optimization algorithm

APA, Harvard, Vancouver, ISO, and other styles

31

Rose, Adam. "Input-output economics and computable general equilibrium models." Structural Change and Economic Dynamics 6, no. 3 (1995): 295–304. http://dx.doi.org/10.1016/0954-349x(95)00018-i.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Robinson, Sherman. "Macroeconomics, financial variables, and computable general equilibrium models." World Development 19, no. 11 (1991): 1509–25. http://dx.doi.org/10.1016/0305-750x(91)90003-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Hirschfeldt, Denis R. "Prime models of theories of computable linear orderings." Proceedings of the American Mathematical Society 129, no. 10 (2001): 3079–83. http://dx.doi.org/10.1090/s0002-9939-01-05923-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Goncharov, S. S., V. S. Harizanov, J. F. Knight, A. S. Morozov, and A. V. Romina. "On Automorphic Tuples of Elements in Computable Models." Siberian Mathematical Journal 46, no. 3 (2005): 405–12. http://dx.doi.org/10.1007/s11202-005-0043-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Piazolo, Daniel. "Representing transition countries with computable general equilibrium models." International Advances in Economic Research 5, no. 2 (1999): 270. http://dx.doi.org/10.1007/bf02295083.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Shahrokhi Shahraki, Hamed, and Chris Bachmann. "Designing computable general equilibrium models for transportation applications." Transport Reviews 38, no. 6 (2018): 737–64. http://dx.doi.org/10.1080/01441647.2018.1426651.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Dobritsa, V. P. "Structural properties of computable classes of constructive models." Algebra and Logic 26, no. 1 (1987): 24–41. http://dx.doi.org/10.1007/bf01978382.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Podzorov, S. Yu. "Computable classes of constructivizations of 2-constructivizable models." Algebra and Logic 38, no. 6 (1999): 383–96. http://dx.doi.org/10.1007/bf02671735.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Katayama, Susumu. "Computable Variants of AIXI which are More Powerful than AIXItl." Journal of Artificial General Intelligence 10, no. 1 (2019): 1–23. http://dx.doi.org/10.2478/jagi-2019-0001.

Full text

Abstract:

Abstract This paper presents Unlimited Computable AI, or UCAI, that is a family of computable variants of AIXI. UCAI is more powerful than AIXItl, which is a conventional family of computable variants of AIXI, in the following ways: 1) UCAI supports models of terminating computation, including typed lambda calculi, while AIXItl only supports Turing machine with timeout ˜t, which can be simulated by typed lambda calculi for any ˜t; 2) unlike UCAI, AIXItl limits the program length to some ˜l .

APA, Harvard, Vancouver, ISO, and other styles

40

Léo, Gayral, Sablik Mathieu, and Taati Siamak. "Characterisation of the set of ground states of uniformly chaotic finite-range lattice models." Nonlinearity 38, no. 7 (2025): 075011. https://doi.org/10.1088/1361-6544/addbb8.

Full text

Abstract:

Abstract Chaotic dependence on temperature refers to the phenomenon of non-convergence of Gibbs measures as the temperature approaches a certain value. Models with chaotic behaviour near zero temperature have multiple ground states, none of which are stable. We study the class of uniformly chaotic models, that is, those in which, as the temperature goes to zero, every choice of Gibbs measures accumulates on the entire set of ground states. We characterise the possible sets of ground states of uniformly chaotic finite-range models up to computable homeomorphisms. Namely, we show that the set of

APA, Harvard, Vancouver, ISO, and other styles

41

KOIKE, Atsushi, Tomoki ISHIKURA, and Morito TSUTSUMI. "EDITORIAL - RECENT PROGRESS IN ECONOMIC EQUILIBRIUM MODELING FOR INFRASTRUCTURE PLANNING AND MANAGEMENT: COMPUTABLE GENERAL EQUILIBRIUM MODELS AND COMPUTABLE URBAN ECONOMIC MODELS." Journal of Japan Society of Civil Engineers, Ser. D3 (Infrastructure Planning and Management) 68, no. 4 (2012): 285–90. http://dx.doi.org/10.2208/jscejipm.68.285.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Andreev, P. A., M. Yu Mikhaleva, and P. O. Peretyatko. "The comparative analysis of economic and mathematical approaches to the assessment of state regional policy: Advantages and limitations." Economics and Management 31, no. 5 (2025): 566–75. https://doi.org/10.35854/1998-1627-2025-5-566-575.

Full text

Abstract:

Aim. The work aimed to determine the advantages and disadvantages of the models used in Russian and international practice to assess the effects of implementing state regional policy.Objectives. The work seeks to analyze Russian and international practice of applying economic and mathematical approaches to assessing the effects of implementing state policy (econometric models, input-output balance models, computable general equilibrium models), as well as to identify the specifics and limitations of these approaches.Methods. The study employed general scientific methods (classification and com

APA, Harvard, Vancouver, ISO, and other styles

43

Hoffmann, Anders N. "Imperfect competition in computable general equilibrium models — a primer." Economic Modelling 20, no. 1 (2003): 119–39. http://dx.doi.org/10.1016/s0264-9993(01)00088-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Speziale, Chales G. "On Maxwell models in viscoelasticity that are more computable." International Journal of Non-Linear Mechanics 35, no. 4 (2000): 567–71. http://dx.doi.org/10.1016/s0020-7462(98)00071-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Choi, Sou-Cheng Terrya. "A Complementarity Approach to Solving Computable General Equilibrium Models." Computational Economics 46, no. 2 (2014): 305–23. http://dx.doi.org/10.1007/s10614-014-9462-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Liu, Jing, Thomas Hertel, and Farzad Taheripour. "Analyzing Future Water Scarcity in Computable General Equilibrium Models." Water Economics and Policy 02, no. 04 (2016): 1650006. http://dx.doi.org/10.1142/s2382624x16500065.

Full text

Abstract:

Incorporating water into a computable general equilibrium (CGE) model operating at global scale can be extremely demanding due to the absence of standardized data, the sheer dimensions caused by intersecting river basins with countries, and difficulties to model demand for and supply of water. This has led many authors to introduce water in their CGE modeling framework in different ways and at different spatial and sectoral aggregation levels. Of course, simplifying market for water and sacrificing the geographical realism risk introducing errors caused by inappropriate aggregation. In this pa

APA, Harvard, Vancouver, ISO, and other styles

47

Dobritsa, V. P. "Semilattices of computable indexations of classes of constructive models." Algebra and Logic 26, no. 5 (1987): 333–45. http://dx.doi.org/10.1007/bf01978690.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Kretschmer, Bettina, and Sonja Peterson. "Integrating bioenergy into computable general equilibrium models — A survey." Energy Economics 32, no. 3 (2010): 673–86. http://dx.doi.org/10.1016/j.eneco.2009.09.011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Chisholm, J., J. F. Knight, and S. Miller. "Computable embeddings and strongly minimal theories." Journal of Symbolic Logic 72, no. 3 (2007): 1031–40. http://dx.doi.org/10.2178/jsl/1191333854.

Full text

Abstract:

AbstractHere we prove that if T and T′ are strongly minimal theories, where T′ satisfies a certain property related to triviality and T does not, and T′ is model complete, then there is no computable embedding of Mod(T) into Mod(T′). Using this, we answer a question from [4], showing that there is no computable embedding of VS into ZS, where VS is the class of infinite vector spaces over ℚ, and ZS is the class of models of Th(ℤ, S). Similarly, we show that there is no computable embedding of ACF into ZS, where ACF is the class of algebraically closed fields of characteristic 0.

APA, Harvard, Vancouver, ISO, and other styles

50

Mirarchi, Claudio, Maryam Gholamzadehmir, Bruno Daniotti, and Alberto Pavan. "Semantic Enrichment of BIM: The Role of Machine Learning-Based Image Recognition." Buildings 14, no. 4 (2024): 1122. http://dx.doi.org/10.3390/buildings14041122.

Full text

Abstract:

Building Information Modelling (BIM) revolutionizes the construction industry by digitally simulating real-world entities through a defined and shared semantic structure. However, graphical information included in BIM models often contains more detailed data compared to the corresponding semantic or computable data. This inconsistency creates an asymmetry, where valuable details present in the graphical renderings are absent from the semantic description of the model. Such an issue limits the accuracy and comprehensiveness of BIM models, constraining their full utilization for efficient decisi

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!