Literatura académica sobre el tema "Semantics Formalisation"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Semantics Formalisation".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Semantics Formalisation"
Raad, Azalea, Luc Maranget y Viktor Vafeiadis. "Extending Intel-x86 consistency and persistency: formalising the semantics of Intel-x86 memory types and non-temporal stores". Proceedings of the ACM on Programming Languages 6, POPL (16 de enero de 2022): 1–31. http://dx.doi.org/10.1145/3498683.
Texto completoHuerta y Munive, Jonathan Julián y Georg Struth. "Predicate Transformer Semantics for Hybrid Systems". Journal of Automated Reasoning 66, n.º 1 (31 de octubre de 2021): 93–139. http://dx.doi.org/10.1007/s10817-021-09607-x.
Texto completoBlin, Raoul. "Formalisation Des Contraintes D'association Des Groupes Numériques Avec Spécifiques Et Noms Communs Japonais". Cahiers de Linguistique Asie Orientale 35, n.º 2 (2006): 241–75. http://dx.doi.org/10.1163/19606028-90000153.
Texto completoHUTTON, GRAHAM, MAURO JASKELIOFF y ANDY GILL. "Factorising folds for faster functions". Journal of Functional Programming 20, n.º 3-4 (30 de junio de 2010): 353–73. http://dx.doi.org/10.1017/s0956796810000122.
Texto completoFIADEIRO, JOSÉ LUIZ y ANTÓNIA LOPES. "An algebraic semantics of event-based architectures". Mathematical Structures in Computer Science 17, n.º 5 (octubre de 2007): 1029–73. http://dx.doi.org/10.1017/s0960129507006299.
Texto completoHedges, Jules y Mehrnoosh Sadrzadeh. "A generalised quantifier theory of natural language in categorical compositional distributional semantics with bialgebras". Mathematical Structures in Computer Science 29, n.º 06 (10 de abril de 2019): 783–809. http://dx.doi.org/10.1017/s0960129518000324.
Texto completoDomanov, Oleg. "Domanov, O. A. Form and Formal Approaches in the History of Philosophy and Today". RL. 2020. vol.1. no. 2 1, RL. 2020. vol.1. no. 2 (10 de diciembre de 2020): 52–59. http://dx.doi.org/10.47850/rl.2020.1.2.52-59.
Texto completoBos, V. y J. J. T. Kleijn. "Formalisation of a Production System Modelling Language The operational semantics of χ Core". Fundamenta Informaticae 41, n.º 4 (2000): 367–92. http://dx.doi.org/10.3233/fi-2000-41401.
Texto completoPoutiainen, Hannu. "Self-Re-Interpretations (Of the Trace): From Restricted to General Substitutability". Derrida Today 8, n.º 2 (noviembre de 2015): 156–74. http://dx.doi.org/10.3366/drt.2015.0108.
Texto completoCABALAR, PEDRO, MARTÍN DIÉGUEZ y CONCEPCIÓN VIDAL. "An infinitary encoding of temporal equilibrium logic". Theory and Practice of Logic Programming 15, n.º 4-5 (julio de 2015): 666–80. http://dx.doi.org/10.1017/s1471068415000307.
Texto completoTesis sobre el tema "Semantics Formalisation"
Lefeuvre, Anais. "Sémantique des temps du français : une formalisation compositionnelle". Thesis, Bordeaux, 2014. http://www.theses.fr/2014BORD0065/document.
Texto completoThis work has been lead in the frame of the ITIPY project which goal was to automatically extract itineraries from travel novels from the XIX th century and from the beginning of the XX th. Our thesis work is close to the text understanding task in the information retrieval field and we aim at building a representation of meaning of linguistic utterances, leaning on the compositionnality principle. More precisely, the itinerary extraction supposes to temporally represent displacement and localization events or states (that we actually call eventualities) of a traveler as far as we understand it through discourse. Working on an automatic parser for syntax (in categorial grammars) and semantics (in λ-DRT), we focused on the building of an semantic lexicon for tense in French. We actually characterized our corpora as a sample of French language, by the means of a quantitative and qualitative analysis as well as a study of the internal structure of this genre. The main contribution of this work deals with tense and aspect semantic processing of the event expressed by tensed verbs, and with its modelling. In this respect, we propose an adaptation and an extension for French from XIX th century to nowadays of a lexicon originally produced to deal with English verbs. This formalisation is operational, for it is defined in λ-calculus which composition and réduction, already implemented, calculate automatically semantics représentations, high order logic formulas. Transition from a single event uterrance to a whole discourse which contains a complex referential network is discussed and allows us to define the limits of this hereby work
LIMA, Lucas Albertins de. "Formalisation of SysML design models and an analysis strategy using refinement". Universidade Federal de Pernambuco, 2016. https://repositorio.ufpe.br/handle/123456789/17636.
Texto completoMade available in DSpace on 2016-08-08T12:10:14Z (GMT). No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) v_final_assinaturas_branco.pdf: 10378086 bytes, checksum: 35e52eff52531ee36b6a5af5b2a20645 (MD5) Previous issue date: 2016-03-03
The increasing complexity of systems has led to increasing difficulty in design. Thestandard approach to development, based on trial and error, with testing used at later stages toidentify errors, is costly and leads to unpredictable delivery times. In addition, for critical systems,for which safety is a major concern, early verification and validation (V&V) is recognised asa valuable approach to promote dependability. In this context, we identify three important anddesirable features of a V&V technique: (i) a graphical modelling language; (ii) formal andrigorous reasoning, and (iii) automated support for modelling and reasoning. We address these points with a refinement technique for SysML supported by tools. SysML is a UML-based language for systems design; it has itself become a de facto standard in the area. There is wide availability of tool support from vendors like IBM, Atego, and Sparx Systems. Our work is distinctive in two ways: a semantics for refinement and for a representative collection of elements from the UML4SysML profile (blocks, state machines, activities, and interactions) used in combination. We provide a means to analyse design models specified using SysML. This facilitates the discovery of problems earlier in the system development lifecycle, reducing time and costs of production. In this work we describe our semantics, which is defined using a state-rich process algebra called CML and implemented in a tool for automatic generation of formal models. We also show how the semantics can be used for refinement-based analysis and development. Our case studies are a leadership-election protocol, a critical component of an industrial application, and a dwarf signal, a device used to control rail traffic. Our contributions are: a set of guidelines that provide meaning to the different modelling elements of SysML used during the design of systems; the individual formal semantics for SysML activities, blocks and interactions; an integrated semantics that combines these semantics with another defined for state machines; and a framework for reasoning using refinement about systems specified by collections of SysML diagrams.
O aumento da complexidade dos sistemas tem levado a um aumento na dificuldade da atividade de projeto. A abordagem padrão para desenvolvimento, baseada em tentativa e erro, com testes usados em estágios avançados para identificar erros, é custosa e leva a prazos de entrega imprevisíveis. Além disto, para sistemas críticos, para os quais segurança é um conceito chave, Verificação e Validação (V&V) com antecedência é reconhecida como uma abordagem valiosa para promover confiança. Neste contexto, nós identificamos três características importantes e desejáveis de uma técnica de V&V: (i) uma linguagem de modelagem gráfica; (ii) raciocínio formal e rigoroso, e (iii) suporte automático para modelagem e raciocínio. Nós tratamos estes pontos com uma técnica de refinamento para SysML apoiada por ferramentas. SysML é uma linguagem baseada na UML para o projeto de sistemas. Ela tem se tornado um padrão de facto na área. Há uma grande disponibilidade de ferramentas de fornecedores como IBM, Atego, e Sparx Systems. Nosso trabalho se destaca de duas maneiras: ao fornecer uma semântica para refinamento e considerar uma coleção representativa de elementos do perfil UML4SysML (blocos, máquina de estados, atividades, e interações) usados de forma combinada. Nós fornecemos uma estratégia para analisar modelos de projeto especificados em SysML. Isto facilita a descoberta de problemas mais cedo durante o ciclo de vida de desenvolvimento de sistemas, reduzindo tempo e custos de produção. Neste trabalho nós descrevemos nossa semântica a qual é definida usando uma álgebra de processo rica em estado chamada CML e implementada em uma ferramenta para geração automática de modelos formais. Nós também mostramos como esta semântica pode ser usada para análise baseada em refinamento. Nossos estudos de caso são um protocolo de eleição de líder, o qual é um componente crítico de uma aplicação industrial, e um sinal anão, o qual é um dispositivo para controlar tráfego em linhas férreas. Nossas contribuições são: um conjunto de orientações que fornecem significado para os diferentes elementos de modelagem de SysML usados durante o projeto de sistemas; as semânticas formais individuais para atividades, blocos e interações de SysML; uma semântica integrada que combina estas semânticas com outra definida para máquina de estados; e um arcabouço que usa refinamento para raciocínio de sistemas especificados por coleções de diagramas SysML.
Wang, Kenneth W. S. "Interface adaptation for conversational services". Thesis, Queensland University of Technology, 2008. https://eprints.qut.edu.au/18465/1/Kenneth_Wang_Thesis.pdf.
Texto completoWang, Kenneth W. S. "Interface adaptation for conversational services". Queensland University of Technology, 2008. http://eprints.qut.edu.au/18465/.
Texto completoHachmaoui, Mohammed Houssem Eddine. "Traduction mécanisée et certifiée en Coq d'une algèbre relationnelle étendue pour SQL vers une algèbre imbriquée". Thesis, université Paris-Saclay, 2020. http://www.theses.fr/2020UPASG021.
Texto completoIn 1974, Boyce and Chamberlin created sql using the concepts of the relational algebra proposed by Codd in 1970, but as it evolved, its formal semantics became more and more complex. The small fragment select from where of SQL can be mapped to a relational algebra, with bag's semantics and by restricting expressions and formulae to those which can be expressed in relational algebra. To capture the semantics of the much more realistic fragment select from where group by having, taking into account all the expressions including those with aggregates, all forms of formulas, null values and, even more subtle, the specific SQL's environments, Benzaken and Contejean propose SQLalg which is an extension of relational algebra with a new operator for the group by having part designed specifically to take into account all the aspects of SQL cited above. Can this same fragment of SQL, with all its subtleties, be captured by nested relational algebra ? The present work formally proves that the answer to this question is yes. Indeed, we have built a certified translation, formalized in Coq, from SQLalg to NRAᵉ, which is a formalization in Coq of the nested relational algebra. The translation supports simple and complex expressions, SQL's formulae and perfectly reflects how environments are built and manipulated, especially for aggregates and for correlated queries. This work is part of a more global framework : the DBCert project which is a compilation chain certified in Coq from SQL to JavaScript
Lebedeva, Ekaterina. "Expression de la dynamique du discours à l'aide de continuations". Phd thesis, Université de Lorraine, 2012. http://tel.archives-ouvertes.fr/tel-00783245.
Texto completoMaršík, Jiří. "Les effects et les handlers dans le langage naturel". Thesis, Université de Lorraine, 2016. http://www.theses.fr/2016LORR0322/document.
Texto completoIn formal semantics, researchers assign meanings to sentences of a natural language. This work is guided by the principle of compositionality: the meaning of an expression is a function of the meanings of its parts. These functions are often formalized using the [lambda]-calculus. However, there are areas of language which challenge the notion of compositionality, e.g. anaphoric pronouns or presupposition triggers. These force researchers to either abandon compositionality or adjust the structure of meanings. In the first case, meanings are derived by processes that no longer correspond to pure mathematical functions but rather to context-sensitive procedures, much like the functions of a programming language that manipulate their context with side effects. In the second case, when the structure of meanings is adjusted, the new meanings tend to be instances of the same mathematical structure, the monad. Monads themselves being widely used in functional programming to encode side effects, the common theme that emerges in both approaches is the introduction of side effects. Furthermore, different problems in semantics lead to different theories which are challenging to unite. Our thesis claims that by looking at these theories as theories of side effects, we can reuse results from programming language research to combine them.This thesis extends [lambda]-calculus with a monad of computations. The monad implements effects and handlers, a recent technique in the study of programming language side effects. In the first part of the thesis, we prove some of the fundamental properties of this calculus: subject reduction, confluence and termination. Then in the second part, we demonstrate how to use the calculus to implement treatments of several linguistic phenomena: deixis, quantification, conventional implicature, anaphora and presupposition. In the end, we build a grammar that features all of these phenomena and their interactions
Portides, Demetris Panayiotis. "Representation models as devices for scientific theory applications vs. the semantic view of scientific theories : the case of models of the nuclear structure". Thesis, London School of Economics and Political Science (University of London), 2000. http://etheses.lse.ac.uk/1572/.
Texto completoKacfah, Emani Cheikh Hito. "Formalisation automatique et sémantique de règles métiers". Thesis, Lyon, 2016. http://www.theses.fr/2016LYSE1301/document.
Texto completoThis thesis focuses on automatic and semantic transformation of business rules into formal rules. These business rules are originally drafted in the form of natural language text, tables and images. Our goal is to provide to business experts a set of services allowing them to develop corpora of formal business rules. We carry out this work in the field of building engineering construction. Having formal and executable versions of the business rules enables to perform automatic compliance checking of digital mock-ups of construction projects under design.For this we made available to business experts, the two main contributions of this thesis. The first is the development of a controlled natural language, called RAINS. It allows business experts to rewrite business rules in the form of formal rules. A RAINS rule consists of terms of the business vocabulary and reserved words such as comparison predicates, negation and universal quantification markers and literals. Each RAINS rule has a unique formal semantics which is based on the standards of the Semantic Web. The second major contribution is a service for formalization of business rules. This service implements a formalized approach proposed in this thesis and called FORSA. This service offers RAINS versions of natural language business rules submitted to it. FORSA uses natural language processing tools and heuristics. To evaluate FORSA, we have set up a benchmark adapted to the formalization of business rules task. The dataset from this benchmark are from norms in the field of Construction
Traore, Lamine. "Semantic modeling of an histopathology image exploration and analysis tool". Thesis, Paris 6, 2017. http://www.theses.fr/2017PA066621/document.
Texto completoSemantic modelling of a histopathology image exploration and analysis tool. Recently, anatomic pathology (AP) has seen the introduction of several tools such as high-resolution histopathological slide scanners, efficient software viewers for large-scale histopathological images and virtual slide technologies. These initiatives created the conditions for a broader adoption of computer-aided diagnosis based on whole slide images (WSI) with the hope of a possible contribution to decreasing inter-observer variability. Beside this, automatic image analysis algorithms represent a very promising solution to support pathologist’s laborious tasks during the diagnosis process. Similarly, in order to reduce inter-observer variability between AP reports of malignant tumours, the College of American Pathologists edited 67 organ-specific Cancer Checklists and associated Protocols (CAP-CC&P). Each checklist includes a set of AP observations that are relevant in the context of a given organ-specific cancer and have to be reported by the pathologist. The associated protocol includes interpretation guidelines for most of the required observations. All these changes and initiatives bring up a number of scientific challenges such as the sustainable management of the available semantic resources associated to the diagnostic interpretation of AP images by both humans and computers. In this context, reference vocabularies and formalization of the associated knowledge are especially needed to annotate histopathology images with labels complying with semantic standards. In this research work, we present our contribution in this direction. We propose a sustainable way to bridge the content, features, performance and usability gaps between histopathology and WSI analysis
Libros sobre el tema "Semantics Formalisation"
Meyer, Michel. Logique, langage et argumentation. 2a ed. Paris: Hachette, 1985.
Buscar texto completoCapítulos de libros sobre el tema "Semantics Formalisation"
Deng, Yuxin y Jean-Francois Monin. "Formalisation of Probabilistic Testing Semantics in Coq". En The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy, 276–92. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-31175-9_16.
Texto completoDimarogkona, Maria, Mark Addis y Petros Stefaneas. "Syntax, Semantics and the Formalisation of Social Science Theories". En Scientific Discovery in the Social Sciences, 141–54. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-23769-1_9.
Texto completoVargas-Rojas, Felipe. "Ontological Formalisation of Mathematical Equations for Phenomic Data Exploitation". En The Semantic Web: ESWC 2021 Satellite Events, 176–85. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-80418-3_30.
Texto completoKacfah Emani, Cheikh. "Automatic Detection and Semantic Formalisation of Business Rules". En Lecture Notes in Computer Science, 834–44. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-07443-6_57.
Texto completoBrazier, Frances, Pascal Van Eck y Jan Treur. "Semantic Formalisation of Emerging Dynamics of Compositional Agent Systems". En Agent-Based Defeasible Control in Dynamic Environments, 167–96. Dordrecht: Springer Netherlands, 2002. http://dx.doi.org/10.1007/978-94-017-1741-0_7.
Texto completoActas de conferencias sobre el tema "Semantics Formalisation"
Hamel, Lazhar, Mohamed Graiet y Walid Gaaloul. "Event-B Formalisation of Web Services for Dynamic Composition". En 2012 Eighth International Conference on Semantics, Knowledge and Grids (SKG). IEEE, 2012. http://dx.doi.org/10.1109/skg.2012.31.
Texto completoCasini, Giovanni y Umberto Straccia. "A General Framework for Modelling Conditional Reasoning - Preliminary Report". En 19th International Conference on Principles of Knowledge Representation and Reasoning {KR-2022}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/kr.2022/12.
Texto completoSchockaert, Steven, Yazmin Ibanez-Garcia y Victor Gutierrez-Basulto. "A Description Logic for Analogical Reasoning". En Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/281.
Texto completo