Bibliografias temáticas / Logics and meaning of programs

Í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 "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"

Hornischer, Levin. "Logics of Synonymy". Journal of Philosophical Logic 49, n.º 4 (9 de janeiro de 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, we find, e.g., the well-known system of analytic containment (AC). We axiomatize four logics of synonymy extending AC, relate them semantically and proof-theoretically to SF, and characterize them in terms of weak/strong subject matter preservation and weak/strong logical equivalence. This yields ways out of the no-go result and novel arguments—independent of a particular semantic framework—for each notion of synonymy discussed (using, e.g., Hurford disjunctions or homotopy theory). This points to pluralism about meaning and a certain non-compositionality of truth in logic programs and neural networks. And it unveils an impossibility for synonymy: if it is to preserve subject matter, then either conjunction and disjunction lose an essential property or a very weak absorption law is violated.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Faber, Wolfgang, Michael Morak e Stefan Woltran. "Strong Equivalence for Epistemic Logic Programs Made Easy". Proceedings of the AAAI Conference on Artificial Intelligence 33 (17 de julho de 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 characterization that is directly applicable to the language used in state-of-the-art ELP solvers. This also allows us to give tight complexity bounds, showing that strong equivalence for ELPs remains coNP-complete, as for ASP. We further use our results to provide syntactic characterizations for tautological rules and rule subsumption for ELPs.

Estilos ABNT, Harvard, Vancouver, APA, etc.

HARRISON, AMELIA, e YULIYA LIERLER. "First-order modular logic programs and their conservative extensions". Theory and Practice of Logic Programming 16, n.º 5-6 (setembro de 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.

De Giacomo, G., e M. Lenzerini. "A Uniform Framework for Concept Definitions in Description Logics". Journal of Artificial Intelligence Research 6 (1 de março de 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 results by adopting a formalism that allows for different semantics to coexist. We demonstrate the feasibility of our argument, by presenting a knowledge representation formalism, the description logic muALCQ, with the above characteristics. In addition to the constructs for conjunction, disjunction, negation, quantifiers, and qualified number restrictions, muALCQ includes special fixpoint constructs to express (suitably interpreted) recursive definitions. These constructs enable the usual frame-based descriptions to be combined with definitions of recursive data structures such as directed acyclic graphs, lists, streams, etc. We establish several properties of muALCQ, including the decidability and the computational complexity of reasoning, by formulating a correspondence with a particular modal logic of programs called the modal mu-calculus.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Mabuchi, Hiroshi, Kiyoshi Akama, Hidekatsu Koike e Katsunori Miura. "Infinite Computation in the Equivalent Transformation Model". Journal of Advanced Computational Intelligence and Intelligent Informatics 11, n.º 2 (20 de fevereiro de 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 on the equivalent transformation paradigm, where infinite computation is regarded as repeated equivalent transformations and is given appropriate sense in the same way as the usual finite computation.

Estilos ABNT, Harvard, Vancouver, APA, etc.

HAYES, IAN, ROBERT COLVIN, DAVID HEMER, PAUL STROOPER e RAY NICKSON. "A refinement calculus for logic programs". Theory and Practice of Logic Programming 2, n.º 4-5 (julho de 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 states to states, where a state is represented as a set of bindings. The semantics is used to define the meaning of programs and specifications, including parameters and recursion. To complete the calculus, a notion of correctness-preserving refinement over programs in the wide-spectrum language is defined and refinement laws for developing programs are introduced. The refinement calculus is illustrated using example derivations and prototype tool support is discussed.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Subrahmanian, V. S. "Y-Logic: A Framework for Reasoning About Chameleonic Programs with Inconsistent Completions". Fundamenta Informaticae 13, n.º 4 (1 de outubro de 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 programs which ascribes a very reasonable meaning to general logic programs irrespective of whether they have consistent (in the classical logic sense) completions.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Hirani, Anil, e V. S. Subrahmanian. "Algebraic Foundations of Logic Programming, I: The Distributive Lattice of Logic Programs". Fundamenta Informaticae 13, n.º 3 (1 de julho de 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 pure logic programs. We study the algebraic properties of this set and identify the ideals and zero divisors. In addition, we prove that our algebra satisfies various non-extensibility conditions.

Estilos ABNT, Harvard, Vancouver, APA, etc.

DAGNINO, FRANCESCO, DAVIDE ANCONA e ELENA ZUCCA. "Flexible coinductive logic programming". Theory and Practice of Logic Programming 20, n.º 6 (22 de setembro de 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 which, however, is not necessarily the least, nor the greatest one, but is determined by the coclauses. Correspondingly, the operational semantics is a combination of standard SLD resolution and coSLD resolution. We prove that the operational semantics is sound and complete with respect to declarative semantics restricted to finite comodels.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Bergadano, F., D. Gunetti e U. Trinchero. "The Difficulties of Learning Logic Programs with Cut". Journal of Artificial Intelligence Research 1 (1 de novembro de 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 problem of learning programs with cut has not been investigated before and this seems to be a natural and reasonable approach. We generalize this scheme and investigate the difficulties that arise. Some of the major shortcomings are actually caused, in general, by the need for intensional evaluation. As a conclusion, the analysis of this paper suggests, on precise and technical grounds, that learning cut is difficult, and current induction techniques should probably be restricted to purely declarative logic languages.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Mais fontes

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

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.

Höllerer, Markus, Dennis Jancsary, Renate Meyer e 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 of imageries-of-practice to embrace the critical role that shared visual language plays in the construction of meaning and the emergence of field-level logics. In particular, we argue that imageries-of-practice, compared to verbal vocabularies, are just as well equipped to link locally resonating symbolic representations and globally diffusing practices, thus expressing both the material and ideational dimension of institutional logics in processes of translation. We find that visual rhetoric used in the Austrian discourse emphasizes the qualities of CSR as a bridging concept, and facilitates the mediation of inconsistencies in several ways: By translating abstract global ideas into concrete local knowledge, imageries-of-practice aid in mediating spatial oppositions; by linking the past, present, and future, they bridge time; by mediating between different institutional spheres and their divergent logics, they appease ideational oppositions and reduce institutional complexity; and, finally, by connecting questionable claims with representations of authenticity, they aid in overcoming credibility gaps.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

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 foundation for the three terms on the other axis of the matrix. Those terms, which describe interpretation or response, are: "emotional", "energetic", and "habit changing". These, and other terms identified in the literature, provided a conceptual model that might be applied to the analysis and evaluation of programs of Media Studies, and similar documents. Three Media Studies programs were selected for study: from Western Australia, Ontario, and Scotland. Application of the model permitted conclusions to be drawn on the extent to which current issues of an ideological and sociopolitical nature were addressed by these programs. It was concluded that the model achieved the purposes required of it and that it may be of further utility for educators.
Education, Faculty of
Curriculum and Pedagogy (EDCP), Department of
Graduate

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

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.

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.

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:

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 just completed NRPs. The research question was “What factors have meaning for NLRNs who have experienced transition to practice in nurse residency programs in acute care settings?”

Semi-structured interviews were used to collect data from six NLRNs from three different NRPs after completion of their programs. Using interpretative phenomenological analysis, themes and variations within those themes were derived from the descriptive narratives provided from participant interviews. Overarching themes identified were Relationships, Reflection, Active Learning, Resources and Organizational Systems. Findings have implications for practice and education as the nursing profession strives to find ways to transform nurses in an effective and efficient manner.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Gueneau, Armaë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é asymptotiques sont également utiles en tant que spécifications formelles. La raison est que celles-ci permettent de raisonner de façon modulaire à propos du coût d’un programme : une borne en O s’abstrait de l’expression exacte du coût du programme, et par là des divers détails d’implantation. Par ailleurs, nous illustrons, à l’aide d’exemples simples, un certain nombre de difficultés liées à l’utilisation rigoureuse de la notation O, et qu’il est facile de négliger lors d’un raisonnement informel.Ces considérations sont mises en pratique en formalisant d’une part la notation O dans l’assistant de preuve Coq, et d’autre part en étendant CFML, un outil existant dédié à la vérification de programmes, afin de permettre à l’utilisateur d’élaborer des démonstrations robustes et modulaires établissant des bornes de complexité asymptotiques. Nous étendons la logique de séparation avec crédits temps—qui permet de raisonner à la fois sur des propriétés de correction et de complexité en temps—avec la notion de crédits temps négatifs. Ces derniers augmentent l’expressivité de la logique, donnent accès à des principes de raisonnement commodes et permettent d’exprimer certaines spécifications de manière plus élégante. Au niveau des spécifications, nous montrons comment des bornes de complexité asymptotique avec O s’expriment en logique de séparation avec crédits temps. Afin d’être capable d’établir de telles spécifications, nous développons une méthodologie qui permet à l’utilisateur de développer des démonstrations qui soient à la fois robustes et menées à un niveau d’abstraction satisfaisant. Celle-ci s’appuie sur deux principes clefs : d’une part, un mécanisme permettant de collecter et remettre à plus tard certaines contraintes durant une démonstration interactive, et par ailleurs, un mécanisme permettant de synthétiser semi-automatiquement une expression de coût, et ce sans perte de généralité.Nous démontrons l’utilité et l’efficacité de notre approche en nous attaquant à un certain nombre d’études de cas. Celles-ci comprennent des algorithmes dont l’analyse de complexité est relativement simple (par exemple, une recherche dichotomique, déjà hors de portée de la plupart des approches automatisées) et des structures de données (comme les “binary random access lists” d’Okasaki). Dans notre étude de cas la plus significative, nous établissons la correction et la complexité asymptotique d’un algorithme incrémental de détection de cycles publié récemment. Nous démontrons ainsi que notre méthodologie passe à l’échelle, permet de traiter des algorithmes complexes, donc l’analyse de complexité s’appuie sur des invariants fonctionnels subtils, et peut vérifier du code qu’il est au final possible d’utiliser au sein de programmes réellement utiles et utilisés
This dissertation is concerned with the question of formally verifying that the imple- mentation of an algorithm is not only functionally correct (it always returns the right result), but also has the right asymptotic complexity (it reliably computes the result in the expected amount of time).In the algorithms literature, it is standard practice to characterize the performance of an algorithm by indicating its asymptotic time complexity, typically using Landau’s “big-O” notation. We first argue informally that asymptotic complexity bounds are equally useful as formal specifications, because they enable modular reasoning: a O bound abstracts over the concrete cost expression of a program, and therefore abstracts over the specifics of its implementation. We illustrate—with the help of small illustrative examples—a number of challenges with the use of the O notation, in particular in the multivariate case, that might be overlooked when reasoning informally.We put these considerations into practice by formalizing the O notation in the Coq proof assistant, and by extending an existing program verification framework, CFML, with support for a methodology enabling robust and modular proofs of asymptotic complexity bounds. We extend the existing framework of Separation Logic with Time Credits, which allows to reason at the same time about correctness and time complexity, and introduce negative time credits. Negative time credits increase the expressiveness of the logic, and enable convenient reasoning principles as well as elegant specifications. At the level of specifications, we show how asymptotic complexity specifications using O can be integrated and composed within Separation Logic with Time Credits. Then, in order to establish such specifications, we develop a methodology that allows proofs of complexity in Separation Logic to be robust and carried out at a relatively high level of abstraction, by relying on two key elements: a mechanism for collecting and deferring constraints during the proof, and a mechanism for semi-automatically synthesizing cost expressions without loss of generality.We demonstrate the usefulness and practicality of our approach on a number of increasingly challenging case studies. These include algorithms whose complexity analysis is relatively simple (such as binary search, which is nonetheless out of the scope of many automated complexity analysis tools) and data structures (such as Okasaki’s binary random access lists). In our most challenging case study, we establish the correctness and amortized complexity of a state-of-the-art incremental cycle detection algorithm: our methodology scales up to highly non-trivial algorithms whose complexity analysis intimately depends on subtle functional invariants, and furthermore makes it possible to formally verify OCaml code which can then actually be used as part of real world programs

Estilos ABNT, Harvard, Vancouver, APA, etc.

王楨. "金錢、市場與意義 : 中國「宅門」電視劇的意識形態分析 = 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"

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.

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.

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.

P, Aalst Wil M., Balbo Gianfranco, Koutny Maciej 1958-, Wolf Karsten e 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.

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.

Nelma, Moreira, Reis Rogério e 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.

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.

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.

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.

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"

Bohrer, Brandon, e 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.

Murali, Adithya, Lucas Peña, Christof Löding e 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.

Abadi, Martin, e 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.

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.

Graf, S., e 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.

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.

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.

Koymans, R., R. K. Shyamasundar, W. P. Roever, R. Gerth e 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.

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.

Lichtenstein, Orna, Amir Pnueli e 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"

Bogaerts, Bart, Joost Vennekens e 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 logic programming and autoepistemic logic. For the latter, we show that safe inductions manage to capture the intended meaning of a class of theories on which all classical constructive semantics fail.

Estilos ABNT, Harvard, Vancouver, APA, etc.

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.

Zhao, Jidi, e 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.

Emerson, E. A., e 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.

Lucas, Salvador, e 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.

Vardi, M. Y., e 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.

"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.

Fulton, Nathan, e 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.

Miranda, María del Rosario Landín, Diana Ramírez Hernández e 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 of postgraduate has on the training of current professionals. Two study contexts were taken: masters in education offered in the public sector and masters in education offered in the private sector. As well, the agencies that shape the policies for the evaluation of postgraduate programs in Mexico, particularly with emphasis on the CONACYT framework.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Shi, Lian, Shuai Lu, Tao Sun e 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"

Yatsymirska, Mariya. SOCIAL EXPRESSION IN MULTIMEDIA TEXTS. Ivan Franko National University of Lviv, fevereiro de 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. The most popular platform for mass information and social interaction is, first of all, network journalism, which is characterized by mobility and unlimited time and space. Authors have complete freedom to express their views in direct language, including their own word formation. Phonetic, lexical, phraseological and stylistic means of speech create expression of the text. A figurative word, a good aphorism or proverb, a paraphrased expression, etc. enhance the effectiveness of a multimedia text. This is especially important for headlines that simultaneously inform and influence the views of millions of readers. Given the wide range of issues raised by the Internet as a medium, research in this area is interdisciplinary. The science of information, combining language and social communication, is at the forefront of global interactions. The Internet is an effective source of knowledge and a forum for free thought. Nonlinear texts (hypertexts) – «branching texts or texts that perform actions on request», multimedia texts change the principles of information collection, storage and dissemination, involving billions of readers in the discussion of global issues. Mastering the word is not an easy task if the author of the publication is not well-read, is not deep in the topic, does not know the psychology of the audience for which he writes. Therefore, the study of media broadcasting is an important component of the professional training of future journalists. The functions of the language of the media require the authors to make the right statements and convincing arguments in the text. Journalism education is not only knowledge of imperative and dispositive norms, but also apodictic ones. In practice, this means that there are rules in media creativity that are based on logical necessity. Apodicticity is the first sign of impressive language on the platform of print or electronic media. Social expression is a combination of creative abilities and linguistic competencies that a journalist realizes in his activity. Creative self-expression is realized in a set of many important factors in the media: the choice of topic, convincing arguments, logical presentation of ideas and deep philological education. Linguistic art, in contrast to painting, music, sculpture, accumulates all visual, auditory, tactile and empathic sensations in a universal sign – the word. The choice of the word for the reproduction of sensory and semantic meanings, its competent use in the appropriate context distinguishes the journalist-intellectual from other participants in forums, round tables, analytical or entertainment programs. Expressive speech in the media is a product of the intellect (ability to think) of all those who write on socio-political or economic topics. In the same plane with him – intelligence (awareness, prudence), the first sign of which (according to Ivan Ogienko) is a good knowledge of the language. Intellectual language is an important means of organizing a journalistic text. It, on the one hand, logically conveys the author’s thoughts, and on the other – encourages the reader to reflect and comprehend what is read. The richness of language is accumulated through continuous self-education and interesting communication. Studies of social expression as an important factor influencing the formation of public consciousness should open up new facets of rational and emotional media broadcasting; to trace physical and psychological reactions to communicative mimicry in the media. Speech mimicry as one of the methods of disguise is increasingly becoming a dangerous factor in manipulating the media. Mimicry is an unprincipled adaptation to the surrounding social conditions; one of the most famous examples of an animal characterized by mimicry (change of protective color and shape) is a chameleon. In a figurative sense, chameleons are called adaptive journalists. Observations show that mimicry in politics is to some extent a kind of game that, like every game, is always conditional and artificial.

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!