Bibliografias temáticas / Expressibility

Índice

Artigos de revistas
Teses / dissertações
Livros
Capítulos de livros
Trabalhos de conferências
Relatórios de organizações

Literatura científica selecionada sobre o tema "Expressibility"

Autor: Grafiati

Publicado: 4 de junho de 2021

Última modificação: 9 de junho de 2025

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos

Selecione um tipo de fonte:

Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Expressibility".

Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.

Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.

Artigos de revistas sobre o assunto "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 (February 25, 2022): 119–28. http://dx.doi.org/10.25303/1703rjbt119128.

Texto completo da fonte

Resumo:

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 expressibility. The features closely related to the enzymes expression level included aliphatic side chains of amino acids (aliphatic index: AI), grand average of hydropathicity, protein folding ability (fold index: FI) and FI was the most important factor. The investigation of two models for prediction of the enzymes expressibility in E. coli showed that 100% sequences predicted to be high expressibility by Periscope were the sequences expressed at high level in experiments. In contrast, 100% sequences predicted to be low expressibilty by ESPRESSO constituted a low expression level in experiments. This result can be a good reference for screening genes before expressing in E. coli.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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) (December 2023): 395–408. http://dx.doi.org/10.56415/csjm.v31.21.

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Resumo:

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 precise sense in which B is more constrained than A, yielding a pro tanto simplicity-based consideration in favor of B. In this paper I develop tools which allow us to make comparisons of this kind, which I call comparisons of potential expressive power. I motivate the development of these tools by way of exploration of the recent debate about epistemic modals. Prominent theories which have been developed in response to embedding data turn out to be strictly less expressive than the standard relational theory, a fact which necessitates a reorientation in how to think about the choice between these theories.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Resumo:

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 depth at most 3, (2) adding one more first-order variable makes the same problem expressible, and (3) inside this last logic the parameter k creates a proper hierarchy with varying the number of second-order variables.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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 whether it has rich expressibility in state generation. In this paper, with a proper definition of the expressibility found in the literature, we show that the shallow alternating layered ansatz has almost the same level of expressibility as that of hardware efficient ansatz. Hence the expressibility and the trainability can coexist, giving a new designing method for quantum circuits in the intermediate-scale quantum computing era.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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 (December 10, 2014): 247–55. http://dx.doi.org/10.2478/auom-2014-0020.

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Mais fontes

Teses / dissertações sobre o assunto "Expressibility"

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

Texto completo da fonte

Resumo:

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 a transitive closure operator to monadic NP, and show that the resulting logic is a strict extension of it which is not closed under complementation. This extends Fagin's result that monadic NP is itself not closed under complementation. We then investigate the expressive power of a class of program schemes which we call RFDPS. We prove a strong result limiting the expressive power of this class, and use it to obtain a strict, infinite hierarchy of problem classes within RFDPS. To our knowledge, this is the first strict, infinite hierarchy in a polynomial-time logic which properly extends inductive fixed-point logic (with the property that the union of the classes of the hierarchy consists of the class of problems definable in the polynomial-time logic itself). Finally, we turn our attention to constraint satisfaction problems. This important class of problems is NP-hard in general, but many restrictions to it have been identified over the years which ensure its tractability. We introduce a method of combining two tractable classes over disjoint domains, so as to synthesise new tractable classes. We demonstrate that these new classes are genuinely novel, and extend naturally to yet further tractable classes. The algorithms for solving these extended classes can be less than obvious.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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 rationality are synonymous with criticality. During the same period, a maker culture was growing rapidly in the UK, and discourses around these activities promoted an entirely different notion of digital literacy, aligned with the wide body of literacy literature that focuses on notions of empowerment and criticality rather than basic functional skills. A digital maker tool called the Raspberry Pi was released with the intention of supporting the development of computer science and digital making competence, and thus sat at the boundary of the academic and maker communities. This thesis argues that developing 'criticality' is a vital component of Computing education and explores how learning activities with the Raspberry Pi might support development of 'criticality'. In setting the scene for the investigation, I will first explore the notions underpinning discourse around both computational and critical thinking and digital literacy, suggesting that the frictions would be best overcome by abandoning abstract constructs of knowledge and assumptions that it is possible to separate theory and practice. I show how the term 'critical' is itself problematic in the literature and I look to Wenger's social theory of learning to avoid the individualistic limits of Papert's constructionism, a popular learning theory in Computing education. Wenger's constructs of knowledgeability and competence help tell a different story of what it means to be a learner of the practice of Computing, both in learning for academic purposes and with intentions towards becoming a practitioner. In concert with learning citizenship, these constructs offer a more ethical framing of 'criticality'. Informed by this theoretical position, I suggest an original, exploratory implementation of Q methodology to explore learning with technology in school settings. I qualitatively compare 'before' and 'after' Q studies that represent perspectives at the individual and collective level, with reference to observations of classroom learning. The methodology facilitates a nuanced and complex investigation and the findings of the project suggest that where pupils are already predisposed to the subject, working with the Raspberry Pi develops a broader knowledgeability, but where there is no such predisposition, a pedagogy of expressibility influences how participation in Raspberry Pi learning activities may impact knowledgeability.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Resumo:

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 hypothèses de complexité booléenne. Nous montrons en particulier l’équivalence de p = np sur les réels avec addition et ordre et de la version non-uniforme de l’hypothèse booléenne p = np. La question de l'existence de problèmes np-complets creux, ici de petite dimension, est également discutée pour diverses réductions. La seconde partie se place dans le contexte d'un modèle fini plonge dans une structure infinie. Les problèmes étudiés sont motives par le modèle des contraintes. Nous étudions le rang de quantification de certaines requêtes de parité et de connexité pour un graphe plonge dans les réels ou les complexes munis de diverses opérations. Nous étudions aussi a quelle condition quantifier sur le modèle fini, le domaine actif, ou quantifier sur le domaine de la structure sous-jacente, le domaine naturel, donnent le même pouvoir d'expression. Nous énonçons une propriété suffisante pour qu'une telle situation se produise, et nous démontrons que les structures fortement minimales éliminant les quantificateurs, ainsi que les corps différentiellement clos, ont cette propriété. Les démonstrations sont effectives au sens ou elles permettent de construire un algorithme transformant une formule naturelle en une formule active équivalente.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Resumo:

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 the elements of the plan, and their composition is in accordance with the rules of composition in the language. I have addressed the problem of expressibility by designing a level of representation, the Text Structure, which is used by the text planner in composing the utterance. This intermediate level of representation bridges the "generation gap" between the representation of the world in the application program and the linguistic resources provided by the language. The terms and expressions in the Text Structure are abstractions over the concrete resources of language (the words, morphological markings, syntactic structures, etc. that actually appear in a stream of text). These abstract linguistic resources group together the expressible combinations of concrete linguistic resources. I have identified three kinds of information that are essential to an abstract linguistic representation: the constituency, the semantic category of the constituent (e.g. event, property), and the structural relations among the constituents (e.g. argument, adjunct). By providing the planner with a set of abstract resources, rather than letting it choose from the individual features that make them up, it is prevented from choosing a set of features that is not realizable. These abstractions can further constrain composition by defining what kinds of constituents can be extended and how semantic categories can compose. Text Structure is implemented in the Spokesman Generation System, which produces text for a variety of application programs. I describe in detail the structures in Spokesman's text planner and walk through an example of the generation of a biographical paragraph from the Main Street simulation program.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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 blocks of consecutive existential and universal quantifiers, and such that the maximal-arity (a generalization of the concept of arity, not just the maximal of the arities of the quantified variables) of the higher-order variables is bounded by r. Note that, the order of the quantifiers in the prefix may be mixed. We show that, for every i [greater than or equal to] 1, the resulting AAi hierarchy of formulae of (i + 1)-th order logic is proper. This extends a result by Makowsky and Pnueli who proved that the same hierarchy in second-order logic is proper. In both cases the strategy used to prove the results consists in considering the set AUTOSAT(F) of formulae in a given logic F which, represented as finite structures, satisfy themselves. We then use a similar strategy to prove that the classes of [Sigma superscript i subscript m union Pi superscript i subscript m] formulae in which the higher-order variables of all orders up to i+1 have maximal-arity at most r, also induce a proper hierarchy in each higher-order logic of order i [greater than or equal to] 3. It is not known whether the correspondent hierarchy in second-order logic is proper. Using the concept of finite model truth definitions introduced by M. Mostowski, we give a sufficient condition for that to be the case. We also study the complexity of the set AUTOSAT(F) and show that when F is one of the prenex fragments [Sigma superscript 1 subscript m] of second-order logic, it follows that AUTOSAT(F) becomes a complete problem for the corresponding prenex fragment [Sigma superscript 2 subscript m] of third-order logic. Finally, aiming to provide the background for a future line of research in higher-order logics, we take a closer look to the restricted second-order logic SO[superscript w] introduced by Dawar. We further investigate its connection with the concept of relational complexity studied by Abiteboul, Vardi and Vianu. Dawar showed that the existential fragment of SO[superscript w] is equivalent to the nondeterministic inflationary fixed-point logic NFP. Since NFP captures relational NP, it follows that the existential fragment of SO[superscript w] captures relational NP. We give a direct proof, in the style of the proof of Fagin’s theorem, of this fact. We then define formally the concept of relational machine with relational oracle and prove the exact correspondence between the prenex fragments of SO[superscript w] and the levels of the relational polynomial-time hierarchy. This allows us to stablish a direct connection between the relational polynomial hierarchy and SO without using the Abiteboul and Vianu normal form for relational machines.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Livros sobre o assunto "Expressibility"

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

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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 definition, and Tarski’s general limiting theses on the expressibility and definability of truth. Though these ideas are familiar in name, the chapter seeks to uncover and remove certain widespread misunderstandings. Tarski’s name also features prominently in discussions of the liar paradox, so we will discuss Tarski’s misunderstood connection to this ancient puzzle.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Capítulos de livros sobre o assunto "Expressibility"

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Trabalhos de conferências sobre o assunto "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), 1547–57. IEEE, 2024. https://doi.org/10.1109/qce60285.2024.00181.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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}, 232–42. California: International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/22.

Texto completo da fonte

Resumo:

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 in the literature. However, UCQ-rewritability is applicable only in restricted settings. This raises the question whether such a generic algorithm can be designed for a more expressive language, such as datalog. We solve this question by the negative, by studying the difference between datalog-expressibility and datalog-rewritability. In particular, we show that query answering under datalog-expressible rule queries is undecidable.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Relatórios de organizações sobre o assunto "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), May 2024. http://dx.doi.org/10.2172/2350603.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Oferecemos descontos em todos os planos premium para autores cujas obras estão incluídas em seleções literárias temáticas. Contate-nos para obter um código promocional único!