Bibliografie tematiche / Expressibility

Indice

Articoli di riviste
Tesi
Libri
Capitoli di libri
Atti di convegni
Rapporti di organizzazioni

Letteratura scientifica selezionata sul tema "Expressibility"

Autore: Grafiati

Pubblicato: 4 giugno 2021

Ultima modifica: 25 luglio 2025

Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili

Scegli il tipo di fonte:

Consulta la lista di attuali articoli, libri, tesi, atti di convegni e altre fonti scientifiche attinenti al tema "Expressibility".

Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.

Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.

Articoli di riviste sul tema "Expressibility"

Nguyen, Hai Dang, Nam Hai Truong, and Thi Huyen Do. "Investigation of influence features on expression of lignocellulases in Escherichia coli and selection of bioinformatic tools for prediction of the enzymes expressibility based on amino acid sequences." Research Journal of Biotechnology 17, no. 3 (2022): 119–28. http://dx.doi.org/10.25303/1703rjbt119128.

Testo completo

Abstract (sommario):

Lignocellulases are the most important enzymes for bioeconomy development and have gained many interests in mining new coding-genes from metagenomic DNA data recently. However, the identification of genes suitable for successful expression in E. coli for the enzyme characterization is still a big challenge. In this study, 18 lignocellullase genes from metagenomic data of bacteria in goats' rumen, termite gut and humus were expressed in E. coli. Then 18 nucleotide and amino acid sequences were used to measure 12 impact features and to investigate tools for prediction of their E. coli expressibi

Gli stili APA, Harvard, Vancouver, ISO e altri

Rusu, Andrei, and Elena Rusu. "On some classes of formulas in S5 which are pre-complete relative to existential expressibility." Computer Science Journal of Moldova 31, no. 3(93) (2023): 395–408. http://dx.doi.org/10.56415/csjm.v31.21.

Testo completo

Abstract (sommario):

Existential expressibility for all k-valued functions was proposed by A. V. Kuznetsov and later was investigated in more details by S. S. Marchenkov. In the present paper, we consider existential expressibility in the case of formulas defined by a logical calculus and find out some conditions for a system of formulas to be closed relative to existential expressibility. As a consequence, it has been established some pre-complete as to existential expressibility classes of formulas in some finite extensions of the paraconsistent modal logic S5.

Gli stili APA, Harvard, Vancouver, ISO e altri

MANDELKERN, MATTHEW. "MODALITY AND EXPRESSIBILITY." Review of Symbolic Logic 12, no. 4 (2019): 768–805. http://dx.doi.org/10.1017/s1755020318000394.

Testo completo

Abstract (sommario):

AbstractWhen embedding data are used to argue against semantic theory A and in favor of semantic theory B, it is important to ask whether A could make sense of those data. It is possible to ask that question on a case-by-case basis. But suppose we could show that A can make sense of all the embedding data which B can possibly make sense of. This would, on the one hand, undermine arguments in favor of B over A on the basis of embedding data. And, provided that the converse does not hold—that is, that A can make sense of strictly more embedding data than B can—it would also show that there is a

Gli stili APA, Harvard, Vancouver, ISO e altri

Gomaa, Walid. "Expressibility in ∑11." JUCS - Journal of Universal Computer Science 14, no. (10) (2008): 1654–77. https://doi.org/10.3217/jucs-014-10-1654.

Testo completo

Abstract (sommario):

Inspired by Fagin's result that NP = ∑11, we have developed a partial framework to investigate expressibility inside ∑11 so as to have a finer look into NP. The framework uses interesting combinatorics derived from second-order Ehrenfeucht-Fraïssé games and the notion of game types. Some of the results that have been proven within this framework are: (1) for any k, divisibility by k is not expressible by a ∑11 sentence where (1.i) each second-order variable has arity at most 2, (1.ii) the first-order part has at most 2 first-order variables, and (1.iii) the first-order part has quantifier dept

Gli stili APA, Harvard, Vancouver, ISO e altri

Nakaji, Kouhei, and Naoki Yamamoto. "Expressibility of the alternating layered ansatz for quantum computation." Quantum 5 (April 19, 2021): 434. http://dx.doi.org/10.22331/q-2021-04-19-434.

Testo completo

Abstract (sommario):

The hybrid quantum-classical algorithm is actively examined as a technique applicable even to intermediate-scale quantum computers. To execute this algorithm, the hardware efficient ansatz is often used, thanks to its implementability and expressibility; however, this ansatz has a critical issue in its trainability in the sense that it generically suffers from the so-called gradient vanishing problem. This issue can be resolved by limiting the circuit to the class of shallow alternating layered ansatz. However, even though the high trainability of this ansatz is proved, it is still unclear whe

Gli stili APA, Harvard, Vancouver, ISO e altri

Lee, Jinhee. "Dialetheism, Revenge and Expressibility." CHUL HAK SA SANG : Journal of Philosophical Ideas 77 (August 31, 2020): 75–104. http://dx.doi.org/10.15750/chss.77.202008.003.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Aleshin, Stanislav Vladimirovich, Dmitry Nikolaevich Babin, and Anatolii Aleksandrovich Chasovskikh. "Automata: Completeness, Expressibility, Application." Mathematical Problems of Cybernetics, no. 22 (2024): 223–75. https://doi.org/10.20948/mvk-2024-223.

Testo completo

Abstract (sommario):

The study of expressive properties in classes of discrete control systems has become the most important direction of development of the Russian school of cybernetics, one of the founders of which is Sergey Vsevolodovich Yablonsky. Of particular interest are the classes of finite automata widely used, in particular, for modeling integrated circuits. The paper provides an overview of the results of studies of the expressive properties of automata obtained within the framework of the scientific school of S.V. Yablonsky and his associates since its foundation.

Gli stili APA, Harvard, Vancouver, ISO e altri

Norn, Mogens. "Expressibility of Meibomian secretion." Acta Ophthalmologica 65, no. 2 (2009): 137–42. http://dx.doi.org/10.1111/j.1755-3768.1987.tb06991.x.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Immerman, Neil. "Expressibility and Parallel Complexity." SIAM Journal on Computing 18, no. 3 (1989): 625–38. http://dx.doi.org/10.1137/0218043.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Rusu, Andrei. "Infinitely Many Precomplete with Respect to Parametric Expressibility Classes of Formulas in a Provability Logic of Propositions." Analele Universitatii "Ovidius" Constanta - Seria Matematica 22, no. 1 (2014): 247–55. http://dx.doi.org/10.2478/auom-2014-0020.

Testo completo

Abstract (sommario):

AbstractIn the present paper we consider a non-tabular extension L of the well-known propositional provability logic GL together with the notion of parametric expressibility of formulas in a logic proposed by A. V. Kuznetsov. We prove that there are infinitely many precomplete with respect to parametric expressibility classes of formulas in the above mentioned logic L.

Gli stili APA, Harvard, Vancouver, ISO e altri

Più fonti

Tesi sul tema "Expressibility"

Gault, Richard. "Expressibility and tractability." Thesis, University of Leicester, 2000. http://hdl.handle.net/2381/30512.

Testo completo

Abstract (sommario):

This thesis is composed of three separate, yet related strands. They have in common the notion that computational problems are regarded not as sets of strings, but as classes of finite structures. Our "computing devices", be they of a logical, traditionally computational, or algebraic nature, all work directly upon such structures. This is in contrast to traditional computability and complexity theory, where machines act instead upon some encoding of structures. We begin by investigating a restriction of the question of whether or not NP = co-NP. In particular, we consider the effect of adding

Gli stili APA, Harvard, Vancouver, ISO e altri

Hveem, Tarjei Sveinsgjerd. "Improving expressibility of simple motifs." Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2004. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9147.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Vortmeier, Nils [Verfasser], Thomas [Akademischer Betreuer] Schwentick, and Victor [Gutachter] Vianu. "Dynamic expressibility under complex changes / Nils Vortmeier ; Gutachter: Victor Vianu ; Betreuer: Thomas Schwentick." Dortmund : Universitätsbibliothek Dortmund, 2019. http://d-nb.info/1203372957/34.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Banks, Gatenby Amanda. "Developing perspectives of knowledgeability through a pedagogy of expressibility with the Raspberry Pi." Thesis, University of Manchester, 2018. https://www.research.manchester.ac.uk/portal/en/theses/developing-perspectives-of-knowledgeability-through-a-pedagogy-of-expressibility-with-the-raspberry-pi(246a7889-d2a5-41ad-bd15-e04c0f36b529).html.

Testo completo

Abstract (sommario):

The curriculum for ICT in UK schools was discontinued in September 2012 and replaced by a 'rebranded' subject of Computing, divided into three sub domains: Computer Science; Information Technology; and digital literacy. The latter was positioned as basic technical skills. There were concerns in the education community that the new curriculum promoted programming and computer science topics to the detriment of digital literacy and applied uses of technology. Much of the Computing education literature perpetuates the hegemony of the logical and abstract, and implies computational thinking and ra

Gli stili APA, Harvard, Vancouver, ISO e altri

Meadows, Jillian Faith. "Development of the 4-3-2-1 Meibum Expressibility Scale and Omega-3 Fatty Acid Supplementation and Dry Eye." The Ohio State University, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=osu1312343001.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Fournier, Hervé. "Complexité et expressibilité sur les réels." Lyon, École normale supérieure, 2001. http://www.theses.fr/2001ENSL0207.

Testo completo

Abstract (sommario):

Le but de cette thèse est de comprendre certains aspects fondamentaux de l'algorithmique sur les nombres réels. La première partie de la thèse a pour cadre le modèle de calcul propose par Blum, Shub et Smale. Comme dans le cas booléen, la question p = np semble difficile sur le corps des réels, mais aussi sur les réels avec addition et ordre ou encore sur le corps des complexes. A défaut d’être en mesure de résoudre ces problèmes, on essaie de les relier entre eux : ce sont les théorèmes de transfert. Nous obtenons des résultats reliant des hypothèses de complexité structurelle réelle a des hy

Gli stili APA, Harvard, Vancouver, ISO e altri

Dublish, Pratul. "Optimization and expressibility of relational queries." Thesis, 1988. http://localhost:8080/iit/handle/2074/3285.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Meteer, Marie Wenzel. "The "generation gap": The problem of expressibility in text planning." 1990. https://scholarworks.umass.edu/dissertations/AAI9022720.

Testo completo

Abstract (sommario):

This thesis identifies and provides a solution for a particular problem in natural language generation: the problem of ensuring the expressibility of a text plan. Natural language generation is the process of going from a representation of a situation to a textual expression of some relevant portion of that situation in a natural language. Generation systems must have a principled way of ensuring that the message composed by the text planner is expressible in language, that is, that there are linguistic resources (words, syntactic structures) available for the linguistic component to realize t

Gli stili APA, Harvard, Vancouver, ISO e altri

Ferrarotti, Flavio Antonio. "Expressibility of higher-order logics on relational databases : proper hierarchies : a dissertation presented in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Information Systems at Massey University, Wellington, New Zealand." 2008. http://hdl.handle.net/10179/799.

Testo completo

Abstract (sommario):

We investigate the expressive power of different fragments of higher-order logics over finite relational structures (or equivalently, relational databases) with special emphasis in higher-order logics of order greater than or equal three. Our main results concern the study of the effect on the expressive power of higher-order logics, of simultaneously bounding the arity of the higher-order variables and the alternation of quantifiers. Let AAi(r,m) be the class of (i + 1)-th order logic formulae where all quantifiers are grouped together at the beginning of the formulae, forming m alternating b

Gli stili APA, Harvard, Vancouver, ISO e altri

Libri sul tema "Expressibility"

Expressibility and the problem of efficient text planning. Pinter Publishers, 1992.

Cerca il testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Meteer, Marie. Expressibility and the Problem of Efficient Text Planning. Bloomsbury Academic, 2015.

Cerca il testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Expressibility and the Problem of Efficient Text Planning. Bloomsbury Publishing Plc, 2015.

Cerca il testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Ray, Greg. Tarski on the Concept of Truth. Edited by Michael Glanzberg. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780199557929.013.27.

Testo completo

Abstract (sommario):

Alfred Tarski’s work on truth has been so central to the discourse on truth that most coming to it for the first time have probably already heard a great deal about what is said there. Unfortunately, since the work is largely technical and Tarski was only tangentially philosophical, a certain incautious assimilation dominates many philosophical discussions of Tarski’s ideas, and so, examining Tarski on the concept of truth is in many ways an act of unlearning. This chapter will focus on key ideas in Tarski’s work that have had a lasting impact: T-sentence, Convention T, Tarskian truth definiti

Gli stili APA, Harvard, Vancouver, ISO e altri

Capitoli di libri sul tema "Expressibility"

Francez, Nissim. "Syntactic Expressibility." In Fairness. Springer US, 1986. http://dx.doi.org/10.1007/978-1-4612-4886-6_7.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Willard, Ross. "Testing Expressibility Is Hard." In Principles and Practice of Constraint Programming – CP 2010. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15396-9_4.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Kannetzky, Frank. "Expressibility, Explicability, and Taxonomy." In Speech Acts, Mind, and Social Reality. Springer Netherlands, 2002. http://dx.doi.org/10.1007/978-94-010-0589-0_5.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Živný, Stanislav. "Expressibility of Valued Constraints." In Cognitive Technologies. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33974-5_2.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Živný, Stanislav. "Expressibility of Submodular Languages." In Cognitive Technologies. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33974-5_4.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Guerrero, Laura P. "Buddhist Reductionism, Fictionalism, and Expressibility." In Sophia Studies in Cross-cultural Philosophy of Traditions and Cultures. Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-13995-6_18.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Živný, Stanislav. "Expressibility of Fixed-Arity Languages." In Cognitive Technologies. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33974-5_3.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Živný, Stanislav. "Non-expressibility of Submodular Languages." In Cognitive Technologies. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33974-5_5.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Eberhart, Aaron, Cogan Shimizu, Sulogna Chowdhury, Md Kamruzzaman Sarker, and Pascal Hitzler. "Expressibility of OWL Axioms with Patterns." In The Semantic Web. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-77385-4_14.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Marek, V. W., and J. B. Remmel. "On the Expressibility of Stable Logic Programming." In Logic Programming and Nonmotonic Reasoning. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45402-0_8.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Atti di convegni sul tema "Expressibility"

Aktar, Shamminuj, Andreas Bärtschi, Diane Oyen, Stephan Eidenbenz, and Abdel-Hameed A. Badawy. "Graph Neural Networks for Parameterized Quantum Circuits Expressibility Estimation." In 2024 IEEE International Conference on Quantum Computing and Engineering (QCE). IEEE, 2024. https://doi.org/10.1109/qce60285.2024.00181.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Carral, David, Lucas Larroque, and Michaël Thomazo. "Ontology-Based Query Answering over Datalog-Expressible Rule Sets is Undecidable." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/22.

Testo completo

Abstract (sommario):

Ontology-based query answering is a problem that takes as input a set of facts F, an ontology R (typically expressed by existential rules), a Boolean query q , and asks whether R and F entails q. This problem is undecidable in general, and a widely investigated approach to tackle it is called query rewriting: from (R,q) (a ``rule query'') is computed q_R such that for any set of facts F, it holds that R and F entail q iff F entails q_R. The literature mostly focused on q_R expressed as a union of conjunctive queries (UCQs), and an algorithm that such a q_R whenever it exists has been proposed

Gli stili APA, Harvard, Vancouver, ISO e altri

Zhou, Hongchao, and Jehoshua Bruck. "On the expressibility of stochastic switching circuits." In 2009 IEEE International Symposium on Information Theory - ISIT. IEEE, 2009. http://dx.doi.org/10.1109/isit.2009.5205401.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Cosmadakis, S. S. "On the first-order expressibility of recursive queries." In the eighth ACM SIGACT-SIGMOD-SIGART symposium. ACM Press, 1989. http://dx.doi.org/10.1145/73721.73752.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Dublish, P., and S. N. Maheshwari. "Expressibility of bounded-arity fixed-point query hierarchies." In the eighth ACM SIGACT-SIGMOD-SIGART symposium. ACM Press, 1989. http://dx.doi.org/10.1145/73721.73753.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Immerman, Neil. "Expressibility as a Complexity Measure: Results and Directions." In Proceeding Structure in Complexity Theory. IEEE, 1987. http://dx.doi.org/10.1109/psct.1987.10319271.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Michel, R. "A categorical approach to distributed systems expressibility and knowledge." In the eighth annual ACM Symposium. ACM Press, 1989. http://dx.doi.org/10.1145/72981.72990.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Ilyin, Ivan Yurievich. "On complexity of elementary basis in class of single-place linear automata preserving zero sequence." In Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications". Keldysh Institute of Applied Mathematics, 2022. http://dx.doi.org/10.20948/dms-2022-67.

Testo completo

Abstract (sommario):

Estimates are obtained for the number of operations for delay expressibility and neutral element in the case of one-place linear automata, preserving the zero sequence. Estimated degree fractions representing unit and delay, respectively.

Gli stili APA, Harvard, Vancouver, ISO e altri

Maslova, Irina Igorevna. "Classes of superfunctions on two-element set." In Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications". Keldysh Institute of Applied Mathematics, 2022. http://dx.doi.org/10.20948/dms-2022-37.

Testo completo

Abstract (sommario):

We consider generalizations of Boolean functions, called superfunctions, with a special operation of superposition. For this functional system questions of completeness and expressibility are studied. Completeness criteria obtained arbitrary system of superfunctions; built some fragments lattices of closed classes of superfunctions.

Gli stili APA, Harvard, Vancouver, ISO e altri

Aktar, Shamminuj, Andreas Bärtschi, Abdel-Hameed A. Badawy, Diane Oyen, and Stephan Eidenbenz. "Predicting Expressibility of Parameterized Quantum Circuits Using Graph Neural Network." In 2023 IEEE International Conference on Quantum Computing and Engineering (QCE). IEEE, 2023. http://dx.doi.org/10.1109/qce57702.2023.10302.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Rapporti di organizzazioni sul tema "Expressibility"

Aktar, Shamminuj, Andreas Baertschi, Abdel-Hameed Badawy, Diane Oyen, and Stephan Eidenbenz. Graph Neural Networks for Parameterized Quantum Circuits Expressibility Estimation. Office of Scientific and Technical Information (OSTI), 2024. http://dx.doi.org/10.2172/2350603.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Offriamo sconti su tutti i piani premium per gli autori le cui opere sono incluse in raccolte letterarie tematiche. Contattaci per ottenere un codice promozionale unico!