Bibliografias temáticas / Logics and meaning of programs

Índice

  1. Artigos de revistas
  2. Teses / dissertações
  3. Livros
  4. Capítulos de livros
  5. Trabalhos de conferências
  6. Relatórios de organizações

Literatura científica selecionada sobre o tema "Logics and meaning of programs"

Autor: Grafiati
Publicado: 4 de junho de 2021
Última modificação: 1 de fevereiro de 2022

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 "Logics and meaning of programs".

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 "Logics and meaning of programs"

1

Hornischer, Levin. "Logics of Synonymy." Journal of Philosophical Logic 49, no. 4 (January 9, 2020): 767–805. http://dx.doi.org/10.1007/s10992-019-09537-5.

Texto completo da fonte
Resumo:
AbstractWe investigate synonymy in the strong sense of content identity (and not just meaning similarity). This notion is central in the philosophy of language and in applications of logic. We motivate, uniformly axiomatize, and characterize several “benchmark” notions of synonymy in the messy class of all possible notions of synonymy. This class is divided by two intuitive principles that are governed by a no-go result. We use the notion of a scenario to get a logic of synonymy (SF) which is the canonical representative of one division. In the other division, the so-called conceptivist logics
Estilos ABNT, Harvard, Vancouver, APA, etc.
2

Faber, Wolfgang, Michael Morak, and Stefan Woltran. "Strong Equivalence for Epistemic Logic Programs Made Easy." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 2809–16. http://dx.doi.org/10.1609/aaai.v33i01.33012809.

Texto completo da fonte
Resumo:
Epistemic Logic Programs (ELPs), that is, Answer Set Programming (ASP) extended with epistemic operators, have received renewed interest in recent years, which led to a flurry of new research, as well as efficient solvers. An important question is under which conditions a sub-program can be replaced by another one without changing the meaning, in any context. This problem is known as strong equivalence, and is well-studied for ASP. For ELPs, this question has been approached by embedding them into epistemic extensions of equilibrium logics. In this paper, we consider a simpler, more direct cha
Estilos ABNT, Harvard, Vancouver, APA, etc.
3

HARRISON, AMELIA, and YULIYA LIERLER. "First-order modular logic programs and their conservative extensions." Theory and Practice of Logic Programming 16, no. 5-6 (September 2016): 755–70. http://dx.doi.org/10.1017/s1471068416000430.

Texto completo da fonte
Resumo:
AbstractModular logic programs provide a way of viewing logic programs as consisting of many independent, meaningful modules. This paper introduces first-order modular logic programs, which can capture the meaning of many answer set programs. We also introduce conservative extensions of such programs. This concept helps to identify strong relationships between modular programs as well as between traditional programs. We show how the notion of a conservative extension can be used to justify the common projection rewriting.
Estilos ABNT, Harvard, Vancouver, APA, etc.
4

De Giacomo, G., and M. Lenzerini. "A Uniform Framework for Concept Definitions in Description Logics." Journal of Artificial Intelligence Research 6 (March 1, 1997): 87–110. http://dx.doi.org/10.1613/jair.334.

Texto completo da fonte
Resumo:
Most modern formalisms used in Databases and Artificial Intelligence for describing an application domain are based on the notions of class (or concept) and relationship among classes. One interesting feature of such formalisms is the possibility of defining a class, i.e., providing a set of properties that precisely characterize the instances of the class. Many recent articles point out that there are several ways of assigning a meaning to a class definition containing some sort of recursion. In this paper, we argue that, instead of choosing a single style of semantics, we achieve better resu
Estilos ABNT, Harvard, Vancouver, APA, etc.
5

Mabuchi, Hiroshi, Kiyoshi Akama, Hidekatsu Koike, and Katsunori Miura. "Infinite Computation in the Equivalent Transformation Model." Journal of Advanced Computational Intelligence and Intelligent Informatics 11, no. 2 (February 20, 2007): 176–86. http://dx.doi.org/10.20965/jaciii.2007.p0176.

Texto completo da fonte
Resumo:
There are many logic programs that do not terminate but perform useful computation in some sense. The usual theory of logic programming adopts least fixpoints to define the meaning of programs, which fails to capture the intended meaning of infinite computation. To give an appropriate sense to useful infinite computation, the theory of logic programming has adopted greatest fixpoints in place of least fixpoints. However, this solution developed in logic paradigm can not explain finite and infinite computation in a unified manner. This paper proposes a new approach to infinite computation based
Estilos ABNT, Harvard, Vancouver, APA, etc.
6

HAYES, IAN, ROBERT COLVIN, DAVID HEMER, PAUL STROOPER, and RAY NICKSON. "A refinement calculus for logic programs." Theory and Practice of Logic Programming 2, no. 4-5 (July 2002): 425–60. http://dx.doi.org/10.1017/s1471068402001448.

Texto completo da fonte
Resumo:
Existing refinement calculi provide frameworks for the stepwise development of imperative programs from specifications. This paper presents a refinement calculus for deriving logic programs. The calculus contains a wide-spectrum logic programming language, including executable constructs such as sequential conjunction, disjunction, and existential quantification, as well as specification constructs such as general predicates, assumptions and universal quantification. A declarative semantics is defined for this wide-spectrum language based on executions. Executions are partial functions from st
Estilos ABNT, Harvard, Vancouver, APA, etc.
7

Subrahmanian, V. S. "Y-Logic: A Framework for Reasoning About Chameleonic Programs with Inconsistent Completions." Fundamenta Informaticae 13, no. 4 (October 1, 1990): 465–83. http://dx.doi.org/10.3233/fi-1990-13405.

Texto completo da fonte
Resumo:
Large logic programs are normally designed by teams of individuals, each of whom designs a subprogram. While each of these subprograms may have consistent completions, the logic program obtained by taking the union of these subprograms may not. However, the resulting program still serves a useful purpose, for a (possibly) very large subset of it still has a consistent completion. We argue that “small” inconsistencies may cause a logic program to have no models (in the traditional sense), even though it still serves some useful purpose. A semantics is developed in this paper for general logic p
Estilos ABNT, Harvard, Vancouver, APA, etc.
8

Hirani, Anil, and V. S. Subrahmanian. "Algebraic Foundations of Logic Programming, I: The Distributive Lattice of Logic Programs." Fundamenta Informaticae 13, no. 3 (July 1, 1990): 317–32. http://dx.doi.org/10.3233/fi-1990-13306.

Texto completo da fonte
Resumo:
Given a logic program P, the operator TP associated with P is closely related to the intended meaning of P. Given a first order language L that is generated by finitely many non-logical symbols, our aim is to study the algebraic properties of the set {TP|P is a general logic program in language L} with certain operators on it. For the operators defined in this paper the resulting algebraic structure is a bounded distributive lattice. Our study extends (to the case of general logic programs), the work of Mancarella and Pedreschi who initiated a study of the algebraic properties of the space of
Estilos ABNT, Harvard, Vancouver, APA, etc.
9

DAGNINO, FRANCESCO, DAVIDE ANCONA, and ELENA ZUCCA. "Flexible coinductive logic programming." Theory and Practice of Logic Programming 20, no. 6 (September 22, 2020): 818–33. http://dx.doi.org/10.1017/s147106842000023x.

Texto completo da fonte
Resumo:
AbstractRecursive definitions of predicates are usually interpreted either inductively or coinductively. Recently, a more powerful approach has been proposed, called flexible coinduction, to express a variety of intermediate interpretations, necessary in some cases to get the correct meaning. We provide a detailed formal account of an extension of logic programming supporting flexible coinduction. Syntactically, programs are enriched by coclauses, clauses with a special meaning used to tune the interpretation of predicates. As usual, the declarative semantics can be expressed as a fixed point
Estilos ABNT, Harvard, Vancouver, APA, etc.
10

Bergadano, F., D. Gunetti, and U. Trinchero. "The Difficulties of Learning Logic Programs with Cut." Journal of Artificial Intelligence Research 1 (November 1, 1993): 91–107. http://dx.doi.org/10.1613/jair.26.

Texto completo da fonte
Resumo:
As real logic programmers normally use cut (!), an effective learning procedure for logic programs should be able to deal with it. Because the cut predicate has only a procedural meaning, clauses containing cut cannot be learned using an extensional evaluation method, as is done in most learning systems. On the other hand, searching a space of possible programs (instead of a space of independent clauses) is unfeasible. An alternative solution is to generate first a candidate base program which covers the positive examples, and then make it consistent by inserting cut where appropriate. The pro
Estilos ABNT, Harvard, Vancouver, APA, etc.
Mais fontes

Teses / dissertações sobre o assunto "Logics and meaning of programs"

1

Gotsman, Olexiy. "Logics and analyses for concurrent heap-manipulating programs." Thesis, University of Cambridge, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.611774.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
2

Höllerer, Markus, Dennis Jancsary, Renate Meyer, and Oliver Vettori. "Imageries of corporate social responsibility: Visual recontextualization and field-level meaning." Emerald Group Publishing Limited, 2013. http://dx.doi.org/10.1108/S0733-558X(2013)0039AB018.

Texto completo da fonte
Resumo:
In this paper, we explore how corporations use visual artifacts to translate and recontextualize a globally theorized managerial concept (CSR) into a local setting (Austria). In our analysis of the field-level visual discourse, we analyze over 1,600 images in stand-alone CSR reports of publicly traded corporations. We borrow from framing analysis and structural linguistics to show how the meaning structure underlying a multifaceted construct like CSR is constituted by no more than a relatively small number of fundamental dimensions and rhetorical standpoints (topoi). We introduce the concept o
Estilos ABNT, Harvard, Vancouver, APA, etc.
3

O'Shea, Molly. "America's hidden meaning of welcome : a Bosnian experience of two English language learner programs /." ProQuest subscription required:, 2000. http://proquest.umi.com/pqdweb?did=990270521&sid=1&Fmt=2&clientId=8813&RQT=309&VName=PQD.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
4

Emme, Michael John. "Derivation and application of a model of lens meaning." Thesis, University of British Columbia, 1991. http://hdl.handle.net/2429/32277.

Texto completo da fonte
Resumo:
The twofold purpose of this study was to ground a model of Lens Meaning in the literature of the Fine Arts and Social Sciences and to use that term as a referent in evaluating three Media Studies curricula. Lens Meaning is a term derived from a variety of sources, particularly Peirce (1955), whose semiotic theory described three systems of signs used as terms on one axis of a matrix or model by which Lens Meaning can be described. These terms are: "index", "icon", and "symbol". DeLauretis' (1984) expanded understanding of another system of signs described by Peirce, interpretants, is the foun
Estilos ABNT, Harvard, Vancouver, APA, etc.
5

Jurow, Kate. "Making Meaning Together: The role of interpretation during a short-term nature excursion." Antioch University / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=antioch1468589329.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
6

Heider, Cynthia. "Exploring the meaning of school improvement in the formulation and implementation of the Missouri school improvement program /." free to MU campus, to others for purchase, 2001. http://wwwlib.umi.com/cr/mo/fullcit?p3036830.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
7

Huddleston, Clarity. "History, Power, and Meaning: Refusing Heaven and Jack Gilbert's Poetic Career." Scholarship @ Claremont, 2018. http://scholarship.claremont.edu/scripps_theses/1117.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
8

Rowland, Beverly Dianne. "Conceptualization of factors that have meaning for newly licensed registered nurses completing nurse residency programs in acute care settings." Thesis, Indiana University - Purdue University Indianapolis, 2016. http://pqdtopen.proquest.com/#viewpdf?dispub=10241295.

Texto completo da fonte
Resumo:
<p> Nurse residency programs (NRPs) have been identified as a means to promote transitioning of new nurses into the professional nursing role. Questions have arisen related to which elements within those programs are most meaningful to the development of new nurses. As the nursing shortage drives the need for quick transition and development of nurses to meet workforce needs, nursing must identify what is meaningful to nurses in their transition to practice. The purpose of this multi-site study was to explicate meaning from the experiences of newly licensed registered nurses (NLRNs) who have j
Estilos ABNT, Harvard, Vancouver, APA, etc.
9

Gueneau, Armaël. "Mechanized verification of the correctness and asymptotic complexity of programs : the right answer at the right time." Thesis, Université de Paris (2019-....), 2019. http://www.theses.fr/2019UNIP7110.

Texto completo da fonte
Resumo:
Cette thèse s’intéresse à la question de démontrer rigoureusement que l’implantation d’un algorithme donné est non seulement correcte (elle renvoie bien le bon résultat dans tous les cas possibles), mais aussi possède la bonne complexité asymptotique (elle calcule toujours ce résultat en le temps attendu).Pour les chercheurs en algorithmique, caractériser la performance d’un algorithme se fait généralement en indiquant sa complexité asymptotique, notamment à l’aide de la notation “grand O” due à Landau. Nous détaillons, tout d’abord informellement, pourquoi de telles bornes de complexité asymp
Estilos ABNT, Harvard, Vancouver, APA, etc.
10

王楨. "金錢、市場與意義 : 中國「宅門」電視劇的意識形態分析 = Money, market, meaning : an ideological analysis of the Chinese Zhaimen drama". HKBU Institutional Repository, 2008. http://repository.hkbu.edu.hk/etd_ra/924.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
Mais fontes

Livros sobre o assunto "Logics and meaning of programs"

1

Voronkov, Andrei. Programming Logics: Essays in Memory of Harald Ganzinger. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
2

Binder, Walter. Software Composition: 12th International Conference, SC 2013, Budapest, Hungary, June 19, 2013. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
3

Live Data Structures in Logic Programs: Derivation by Means of Abstract Interpretation. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993.

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
4

P, Aalst Wil M., Balbo Gianfranco, Koutny Maciej 1958-, Wolf Karsten, and SpringerLink (Online service), eds. Transactions on Petri Nets and Other Models of Concurrency VII. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
5

Halpin, Harry. Social Semantics: The Search for Meaning on the Web. Boston, MA: Springer US, 2013.

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
6

Nelma, Moreira, Reis Rogério, and SpringerLink (Online service), eds. Descriptional Complexity of Formal Systems: 14th International Workshop, DCFS 2012, Braga, Portugal, July 23-25, 2012. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
7

Parikh, Rohit, ed. Logics of Programs. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15648-8.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
8

Felleisen, Matthias. Programming Languages and Systems: 22nd European Symposium on Programming, ESOP 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
9

Johnsen, Einar Broch. Integrated Formal Methods: 10th International Conference, IFM 2013, Turku, Finland, June 10-14, 2013. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
10

Shankar, A. Udaya. Distributed Programming: Theory and Practice. New York, NY: Springer New York, 2013.

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
Mais fontes

Capítulos de livros sobre o assunto "Logics and meaning of programs"

1

Bohrer, Brandon, and André Platzer. "Constructive Game Logic." In Programming Languages and Systems, 84–111. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44914-8_4.

Texto completo da fonte
Resumo:
AbstractGame Logic is an excellent setting to study proofs-about-programs via the interpretation of those proofs as programs, because constructive proofs for games correspond to effective winning strategies to follow in response to the opponent’s actions. We thus develop Constructive Game Logic, which extends Parikh’s Game Logic (GL) with constructivity and with first-order programs à la Pratt’s first-order dynamic logic (DL). Our major contributions include: 1. a novel realizability semantics capturing the adversarial dynamics of games, 2. a natural deduction calculus and operational semantics describing the computational meaning of strategies via proof-terms, and 3. theoretical results including soundness of the proof calculus w.r.t. realizability semantics, progress and preservation of the operational semantics of proofs, and Existential Properties on support of the extraction of computational artifacts from game proofs. Together, these results provide the most general account of a Curry-Howard interpretation for any program logic to date, and the first at all for Game Logic.
Estilos ABNT, Harvard, Vancouver, APA, etc.
2

Murali, Adithya, Lucas Peña, Christof Löding, and P. Madhusudan. "A First-Order Logic with Frames." In Programming Languages and Systems, 515–43. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44914-8_19.

Texto completo da fonte
Resumo:
AbstractWe propose a novel logic, called Frame Logic (FL), that extends first-order logic (with recursive definitions) using a construct $$\textit{Sp}(\cdot )$$ Sp ( · ) that captures the implicit supports of formulas— the precise subset of the universe upon which their meaning depends. Using such supports, we formulate proof rules that facilitate frame reasoning elegantly when the underlying model undergoes change. We show that the logic is expressive by capturing several data-structures and also exhibit a translation from a precise fragment of separation logic to frame logic. Finally, we design a program logic based on frame logic for reasoning with programs that dynamically update heaps that facilitates local specifications and frame reasoning. This program logic consists of both localized proof rules as well as rules that derive the weakest tightest preconditions in FL.
Estilos ABNT, Harvard, Vancouver, APA, etc.
3

Abadi, Martin, and Zohar Manna. "Nonclausal temporal deduction." In Logics of Programs, 1–15. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15648-8_1.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
4

Grabowski, Michał. "On the relative incompleteness of logics for total correctness." In Logics of Programs, 118–27. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15648-8_10.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
5

Graf, S., and J. Sifakis. "From synchronization tree logic to acceptance model logic." In Logics of Programs, 128–42. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15648-8_11.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
6

Kamin, Sam. "A FASE specification of FP." In Logics of Programs, 143–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15648-8_12.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
7

Kolaitis, Phokion G. "On asymptotic probabilities of inductive queries and their decision problem." In Logics of Programs, 153–66. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15648-8_13.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
8

Koymans, R., R. K. Shyamasundar, W. P. Roever, R. Gerth, and S. Arun-Kumar. "Compositional semantics for real-time distributed computing." In Logics of Programs, 167–89. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15648-8_14.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
9

Leviant, Daniel. "Partial-correctness theories as first-order theories." In Logics of Programs, 190–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15648-8_15.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
10

Lichtenstein, Orna, Amir Pnueli, and Lenore Zuck. "The glory of the past." In Logics of Programs, 196–218. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-15648-8_16.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.

Trabalhos de conferências sobre o assunto "Logics and meaning of programs"

1

Bogaerts, Bart, Joost Vennekens, and Marc Denecker. "Safe Inductions: An Algebraic Study." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/119.

Texto completo da fonte
Resumo:
In many knowledge representation formalisms, a constructive semantics is defined based on sequential applications of rules or of a semantic operator. These constructions often share the property that rule applications must be delayed until it is safe to do so: until it is known that the condition that triggers the rule will remain to hold. This intuition occurs for instance in the well-founded semantics of logic programs and in autoepistemic logic. In this paper, we formally define the safety criterion algebraically. We study properties of so-called safe inductions and apply our theory to logi
Estilos ABNT, Harvard, Vancouver, APA, etc.
2

Bodden, Eric. "Session details: The meaning of programs." In MODULARITY '14: 13th International Conference on Modularity. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/3251086.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
3

Zhao, Jidi, and Harold Boley. "Combining Fuzzy Description Logics and Fuzzy Logic Programs." In 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology. IEEE, 2008. http://dx.doi.org/10.1109/wiiat.2008.363.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
4

Emerson, E. A., and C. S. Jutla. "The complexity of tree automata and logics of programs." In [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science. IEEE, 1988. http://dx.doi.org/10.1109/sfcs.1988.21949.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
5

Lucas, Salvador, and José Meseguer. "Proving Operational Termination of Declarative Programs in General Logics." In the 16th International Symposium. New York, New York, USA: ACM Press, 2014. http://dx.doi.org/10.1145/2643135.2643152.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
6

Vardi, M. Y., and L. Stockmeyer. "Improved upper and lower bounds for modal logics of programs." In the seventeenth annual ACM symposium. New York, New York, USA: ACM Press, 1985. http://dx.doi.org/10.1145/22145.22173.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
7

"How Many Realities Fit Into a Program? - Notes on the Meaning of Meaning for Programs." In International Workshop on Software Knowledge. SciTePress - Science and and Technology Publications, 2011. http://dx.doi.org/10.5220/0003700000920099.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
8

Fulton, Nathan, and André Platzer. "A logic of proofs for differential dynamic logic: toward independently checkable proof certificates for dynamic logics." In CPP 2016: Certified Proofs and Programs. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2854065.2854078.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
9

Miranda, María del Rosario Landín, Diana Ramírez Hernández, and Félix Eduardo Núñez Olvera. "Graduate programs in education, exploring its meaning and significance of training." In Third International Conference on Higher Education Advances. Valencia: Universitat Politècnica València, 2017. http://dx.doi.org/10.4995/head17.2017.5566.

Texto completo da fonte
Resumo:
In this research, we present an analysis carried out in the city of Poza Rica, state of Veracruz, Mexico on the meaning and significance of education that students attribute to the master programs related to education. We base this work from the Theory of Social Representations of Serge Moscovici (1961) and the Method of Symbolic Interactionism of Herbert Blumer (1969), this research is consistent with the educational policies in the training of professionals, due that from an inductive study with a cualitative perspective, we can do an analysis with more relevance on the impact that the offer
Estilos ABNT, Harvard, Vancouver, APA, etc.
10

Shi, Lian, Shuai Lu, Tao Sun, and DanTong Ouyang. "A hybrid system combining intuitionistic fuzzy description logics with intuitionistic fuzzy logic programs." In 2011 Eighth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2011). IEEE, 2011. http://dx.doi.org/10.1109/fskd.2011.6019517.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.

Relatórios de organizações sobre o assunto "Logics and meaning of programs"

1

Yatsymirska, Mariya. SOCIAL EXPRESSION IN MULTIMEDIA TEXTS. Ivan Franko National University of Lviv, February 2021. http://dx.doi.org/10.30970/vjo.2021.49.11072.

Texto completo da fonte
Resumo:
The article investigates functional techniques of extralinguistic expression in multimedia texts; the effectiveness of figurative expressions as a reaction to modern events in Ukraine and their influence on the formation of public opinion is shown. Publications of journalists, broadcasts of media resonators, experts, public figures, politicians, readers are analyzed. The language of the media plays a key role in shaping the worldview of the young political elite in the first place. The essence of each statement is a focused thought that reacts to events in the world or in one’s own country. Th
Estilos ABNT, Harvard, Vancouver, APA, etc.
Você também pode estar interessado nas extensas listas de trabalhos sobre o assunto "Logics and meaning of programs":
Artigos de revistas Teses / dissertações Livros
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!

Vá para a bibliografia