Relevant bibliographies by topics / Algebraic semantics / Journal articles
To see the other types of publications on this topic, follow the link: Algebraic semantics.

Journal articles on the topic 'Algebraic semantics'

Author: Grafiati
Published: 4 June 2021
Last updated: 5 October 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Algebraic semantics.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Maddux, Roger D. "Relation-algebraic semantics." Theoretical Computer Science 160, no. 1-2 (June 1996): 1–85. http://dx.doi.org/10.1016/0304-3975(95)00082-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Voutsadakis, George. "Categorical Abstract Algebraic Logic: Referential Algebraic Semantics." Studia Logica 101, no. 4 (June 28, 2013): 849–99. http://dx.doi.org/10.1007/s11225-013-9500-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Plotkin, Gordon, and John Power. "Semantics for Algebraic Operations." Electronic Notes in Theoretical Computer Science 45 (November 2001): 332–45. http://dx.doi.org/10.1016/s1571-0661(04)80970-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Yang, Eunsuk. "Basic Core Fuzzy Logics and Algebraic Routley–Meyer-Style Semantics." Axioms 10, no. 4 (October 25, 2021): 273. http://dx.doi.org/10.3390/axioms10040273.

Full text
Abstract:
Recently, algebraic Routley–Meyer-style semantics was introduced for basic substructural logics. This paper extends it to fuzzy logics. First, we recall the basic substructural core fuzzy logic MIAL (Mianorm logic) and its axiomatic extensions, together with their algebraic semantics. Next, we introduce two kinds of ternary relational semantics, called here linear Urquhart-style and Fine-style Routley–Meyer semantics, for them as algebraic Routley–Meyer-style semantics.
APA, Harvard, Vancouver, ISO, and other styles
5

Zhu, Huibiao, Jifeng He, and Jonathan P. Bowen. "From algebraic semantics to denotational semantics for Verilog." Innovations in Systems and Software Engineering 4, no. 4 (September 5, 2008): 341–60. http://dx.doi.org/10.1007/s11334-008-0069-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Liu, Jin Zhuo, Li Xia Wang, Tong Li, Qian Yu, Na Zhao, and Fei Lu Hang. "The Algebraic Semantics of EPDL at Activity Level and Verification." Advanced Materials Research 756-759 (September 2013): 2306–10. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.2306.

Full text
Abstract:
In recent years, algebraic semantics and its verification are increasingly important in software engineering. In this paper, firstly, the algebraic semantics of software evolution process description language (AS-EPDL) at activity level is explored. The algebraic semantics of activity level in EPDL provide an accurate framework for defining the semantics. In addition, the hierarchy-consistency and sufficient-completeness properties of the AS-EPDL at activity level are verified.
APA, Harvard, Vancouver, ISO, and other styles
7

Rossie, Jonathan G., and Daniel P. Friedman. "An algebraic semantics of subobjects." ACM SIGPLAN Notices 30, no. 10 (October 17, 1995): 187–99. http://dx.doi.org/10.1145/217839.217860.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Boronat, Artur, and José Meseguer. "An algebraic semantics for MOF." Formal Aspects of Computing 22, no. 3 (February 20, 2010): 269–96. http://dx.doi.org/10.1007/s00165-009-0140-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kupke, Clemens, Alexander Kurz, and Dirk Pattinson. "Algebraic Semantics for Coalgebraic Logics." Electronic Notes in Theoretical Computer Science 106 (December 2004): 219–41. http://dx.doi.org/10.1016/j.entcs.2004.02.037.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Liu, Jin Zhuo, Li Xia Wang, Wei Wang, Xuan Zhang, Ye Qian, and Rui Zhu. "Algebraic Semantics-Based Verification for EPDL at Task Level." Advanced Materials Research 756-759 (September 2013): 2311–15. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.2311.

Full text
Abstract:
The algebraic semantics has been applied to describe and verify semantics for a long period of time. In this paper, the algebraic semantics of EPDL of task level is studied. The paper is divided into two parts. In the first part, the initial algebraic semantics of EPDL (AS-EPDL) of task level is given. As a consequence of the practical purpose, we give the expansion type, which can help the modularization of programming. However, there are two key problems we should concern about when the expansion type is built - hierarchy-consistency and sufficient-completeness. Therefore, we give the verification of these two properties in the second part of the paper.
APA, Harvard, Vancouver, ISO, and other styles
11

Zhu, Lin, Nan Li, and Luyi Bai. "Algebraic Operations on Spatiotemporal Data Based on RDF." ISPRS International Journal of Geo-Information 9, no. 2 (January 30, 2020): 80. http://dx.doi.org/10.3390/ijgi9020080.

Full text
Abstract:
In the context of the Semantic Web, the Resource Description Framework (RDF), a language proposed by W3C, has been used for conceptual description, data modeling, and data querying. The algebraic approach has been proven to be an effective way to process queries, and algebraic operations in RDF have been investigated extensively. However, the study of spatiotemporal RDF algebra has just started and still needs further attention. This paper aims to explore an algebraic operational framework to represent the content of spatiotemporal data and support RDF graphs. To accomplish our study, we defined a spatiotemporal data model based on RDF. On this basis, the spatiotemporal semantics and the spatiotemporal algebraic operations were investigated. We defined five types of graph algebras, and, in particular, the filter operation can filter the spatiotemporal graphs using a graph pattern. Besides this, we put forward a spatiotemporal RDF syntax specification to help users browse, query, and reason with spatiotemporal RDF graphs. The syntax specification illustrates the filter rules, which contribute to capturing the spatiotemporal RDF semantics and provide a number of advanced functions for building data queries.
APA, Harvard, Vancouver, ISO, and other styles
12

Aguzzoli, Stefano, Brunella Gerla, and Vincenzo Marra. "Many-valued logic: beyond algebraic semantics." Soft Computing 16, no. 11 (January 29, 2012): 1815–16. http://dx.doi.org/10.1007/s00500-012-0837-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Liu, Zhiming. "A continuous algebraic semantics of CSP." Journal of Computer Science and Technology 4, no. 4 (October 1989): 304–14. http://dx.doi.org/10.1007/bf02943112.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Odintsov, S. P. "Algebraic Semantics for Paraconsistent Nelson's Logic." Journal of Logic and Computation 13, no. 4 (August 1, 2003): 453–68. http://dx.doi.org/10.1093/logcom/13.4.453.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

Zuber, R. "Towards an Algebraic Semantics for Implicatives." Journal of Logic, Language and Information 29, no. 4 (December 4, 2019): 525–38. http://dx.doi.org/10.1007/s10849-019-09310-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Tzouvaras, Athanassios. "Algebraic semantics for propositional superposition logic." Journal of Applied Non-Classical Logics 30, no. 4 (September 27, 2020): 335–66. http://dx.doi.org/10.1080/11663081.2020.1826157.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

Tishkovskii, D. E. "Algebraic semantics for superintuitionistic predicate logics." Algebra and Logic 38, no. 1 (January 1999): 36–50. http://dx.doi.org/10.1007/bf02671669.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

Wang, Yingxu. "Fuzzy Semantic Models of Fuzzy Concepts in Fuzzy Systems." International Journal of Fuzzy Systems and Advanced Applications 9 (March 13, 2022): 57–62. http://dx.doi.org/10.46300/91017.2022.9.9.

Full text
Abstract:
The fuzzy properties of language semantics are a central problem towards machine-enabled natural language processing in cognitive linguistics, fuzzy systems, and computational linguistics. A formal method for rigorously describing and manipulating fuzzy semantics is sought for bridging the gap between humans and cognitive fuzzy systems. The mathematical model of fuzzy concepts is rigorously described as a hyperstructure of fuzzy sets of attributes, objects, relations, and qualifications, which serves as the basic unit of fuzzy semantics for denoting languages entities in semantic analyses. The formal fuzzy concept is extended to complex structures where fuzzy modifiers and qualifiers are considered. An algebraic approach is developed to manipulate composite fuzzy semantic as a deductive process from a fuzzy concept to the determined semantics. The denotational mathematical structure of fuzzy semantic inference not only explains the fuzzy nature of human semantics and its comprehension, but also enables cognitive machines and fuzzy systems to mimic the human fuzzy inference mechanisms in cognitive linguistics, cognitive computing, and computational intelligence.
APA, Harvard, Vancouver, ISO, and other styles
19

MARCELINO, SÉRGIO, and PEDRO RESENDE. "An algebraic generalization of Kripke structures." Mathematical Proceedings of the Cambridge Philosophical Society 145, no. 3 (November 2008): 549–77. http://dx.doi.org/10.1017/s0305004108001667.

Full text
Abstract:
AbstractThe Kripke semantics of classical propositional normal modal logic is made algebraic via an embedding of Kripke structures into the larger class of pointed stably supported quantales. This algebraic semantics subsumes the traditional algebraic semantics based on lattices with unary operators, and it suggests natural interpretations of modal logic, of possible interest in the applications, in structures that arise in geometry and analysis, such as foliated manifolds and operator algebras, via topological groupoids and inverse semigroups. We study completeness properties of the quantale based semantics for the systems K, T, K4, S4 and S5, in particular obtaining an axiomatization for S5 which does not use negation or the modal necessity operator. As additional examples we describe intuitionistic propositional modal logic, the logic of programs PDL and the ramified temporal logic CTL.
APA, Harvard, Vancouver, ISO, and other styles
20

CABALAR, PEDRO, and JORGE FANDINNO. "Justifications for programs with disjunctive and causal-choice rules." Theory and Practice of Logic Programming 16, no. 5-6 (September 2016): 587–603. http://dx.doi.org/10.1017/s1471068416000454.

Full text
Abstract:
AbstractIn this paper, we study an extension of the stable model semantics for disjunctive logic programs where each true atom in a model is associated with an algebraic expression (in terms of rule labels) that represents its justifications. As in our previous work for non-disjunctive programs, these justifications are obtained in a purely semantic way, by algebraic operations (product, addition and application) on a lattice of causal values. Our new definition extends the concept ofcausal stable modelto disjunctive logic programs and satisfies that each (standard) stable model corresponds to a disjoint class of causal stable models sharing the same truth assignments, but possibly varying the obtained explanations. We provide a pair of illustrative examples showing the behaviour of the new semantics and discuss the need of introducing a new type of rule, which we callcausal-choice. This type of rule intuitively captures the idea of “Amay causeB” and, when causal information is disregarded, amounts to a usual choice rule under the standard stable model semantics.
APA, Harvard, Vancouver, ISO, and other styles
21

Rebagliato, Jordi, and Ventura Verdú. "On the Algebraization of Some Gentzen Systems1." Fundamenta Informaticae 18, no. 2-4 (April 1, 1993): 319–38. http://dx.doi.org/10.3233/fi-1993-182-417.

Full text
Abstract:
In this paper we study the algebraization of two Gentzen systems, both of them generating the implication-less fragment of the intuitionistic propositional calculus. We prove that they are algebraizable, the variety of pseudocomplemented distributive lattices being an equivalent algebraic semantics for them, in the sense that their Gentzen deduction and the equational deduction over this variety are interpretable in one another, these interpretations being essentially inverse to one another. As a consequence, the consistent deductive systems that satisfy the properties of Conjunction, Disjunction and Pseudo-Reductio ad Absurdum are described by giving apropriate Gentzen systems for them. All these Gentzen systems are algebraizable, the subvarieties of the variety of pseudocomplemented distributive lattices being their equivalent algebraic semantics respectively. Finally we give a Gentzen system for the conjunction and disjunction fragment of the classical propositional calculus, prove that the variety of distributive lattices is an equivalent algebraic semantics for it and give a Gentzen system, weaker than the latter, the variety of lattices being an equivalent algebraic semantics for it.
APA, Harvard, Vancouver, ISO, and other styles
22

Winkowski, Jozef. "An Algebraic Model for Communicating Processes." Fundamenta Informaticae 11, no. 1 (January 1, 1988): 65–115. http://dx.doi.org/10.3233/fi-1988-11106.

Full text
Abstract:
A new semantics for communicating processes is introduced which modifies the ideas of Milner (1980) and Winskel (1982, 1983, and 1986). This semantics, inspired by a model of Staples and Nguyen (1985) for nondeterministic data flow, allows one to avoid explicit representation of hidden events of processes, which simplifies the concept of observation equivalence of processes. It offers also a framework to cope with indivisible sets of communication events.
APA, Harvard, Vancouver, ISO, and other styles
23

Dai, Jianhua. "Generalized Rough Logics with Rough Algebraic Semantics." International Journal of Cognitive Informatics and Natural Intelligence 4, no. 2 (April 2010): 35–49. http://dx.doi.org/10.4018/jcini.2010040103.

Full text
Abstract:
The collection of the rough set pairs <lower approximation, upper approximation> of an approximation (U, R) can be made into a Stone algebra by defining two binary operators and one unary operator on the pairs. By introducing a more unary operator, one can get a regular double Stone algebra to describe the rough set pairs of an approximation space. Sequent calculi corresponding to the rough algebras, including rough Stone algebras, Stone algebras, rough double Stone algebras, and regular double Stone algebras are proposed in this paper. The sequent calculi are called rough Stone logic (RSL), Stone logic (SL), rough double Stone logic (RDSL), and double Stone Logic (DSL). The languages, axioms and rules are presented. The soundness and completeness of the logics are proved.
APA, Harvard, Vancouver, ISO, and other styles
24

Valiron, Benoît. "Semantics of a Typed Algebraic Lambda-Calculus." Electronic Proceedings in Theoretical Computer Science 26 (June 9, 2010): 147–58. http://dx.doi.org/10.4204/eptcs.26.14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Zamulin, A. V. "Algebraic Semantics of an Imperative Programming Language." Programming and Computer Software 29, no. 6 (November 2003): 328–37. http://dx.doi.org/10.1023/b:pacs.0000004133.80483.66.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Cruz Morales, John Alexander, and Boris Zilber. "The geometric semantics of algebraic quantum mechanics." Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 373, no. 2047 (August 6, 2015): 20140245. http://dx.doi.org/10.1098/rsta.2014.0245.

Full text
Abstract:
In this paper, we will present an ongoing project that aims to use model theory as a suitable mathematical setting for studying the formalism of quantum mechanics. We argue that this approach provides a geometric semantics for such a formalism by means of establishing a (non-commutative) duality between certain algebraic and geometric objects.
APA, Harvard, Vancouver, ISO, and other styles
27

FIADEIRO, JOSÉ LUIZ, and ANTÓNIA LOPES. "An algebraic semantics of event-based architectures." Mathematical Structures in Computer Science 17, no. 5 (October 2007): 1029–73. http://dx.doi.org/10.1017/s0960129507006299.

Full text
Abstract:
We propose a mathematical semantics for event-based architectures that serves two main purposes: to characterise the modularisation properties that result from the algebraic structures induced on systems by this discipline of coordination; and to further validate and extend the categorical approach to architectural modelling that we have been building around the language CommUnity with the ‘implicit invocation’, also known as ‘publish/subscribe’ architectural style. We then use this formalisation to bring together synchronous and asynchronous interactions within the same modelling approach. We see this effort as a first step towards a form of engineering of architectural styles. Our approach adopts transition systems extended with events as a mathematical model of implicit invocation, and a family of logics that support abstract levels of modelling.
APA, Harvard, Vancouver, ISO, and other styles
28

Yang, Eunsuk. "Algebraic Kripke-Style Semantics for Relevance Logics." Journal of Philosophical Logic 43, no. 4 (June 19, 2013): 803–26. http://dx.doi.org/10.1007/s10992-013-9290-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Covington, Michael A. "Algebraic Semantics in Language and Philosophy (review)." Language 77, no. 3 (2001): 610–11. http://dx.doi.org/10.1353/lan.2001.0145.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

Abramsky, Samson, and Steven Vickers. "Quantales, observational logic and process semantics." Mathematical Structures in Computer Science 3, no. 2 (June 1993): 161–227. http://dx.doi.org/10.1017/s0960129500000189.

Full text
Abstract:
Various notions of observing and testing processes are placed in a uniform algebraic framework in which observations are taken as constituting a quantale. General completeness criteria are stated, and proved in our applications.
APA, Harvard, Vancouver, ISO, and other styles
31

Tong, Haotian, and Dag Westerståhl. "Carnap’s Problem for Intuitionistic Propositional Logic." Logics 1, no. 4 (September 22, 2023): 163–81. http://dx.doi.org/10.3390/logics1040009.

Full text
Abstract:
We show that intuitionistic propositional logic is Carnap categorical: the only interpretation of the connectives consistent with the intuitionistic consequence relation is the standard interpretation. This holds with respect to the most well-known semantics relative to which intuitionistic logic is sound and complete; among them Kripke semantics, Beth semantics, Dragalin semantics, topological semantics, and algebraic semantics. These facts turn out to be consequences of an observation about interpretations in Heyting algebras.
APA, Harvard, Vancouver, ISO, and other styles
32

DA RE, BRUNO, and DAMIAN SZMUC. "Immune Logics." Australasian Journal of Logic 18, no. 1 (February 11, 2021): 29–52. http://dx.doi.org/10.26686/ajl.v18i1.6582.

Full text
Abstract:
This article is concerned with an exploration of a family of systems—called immune logics—that arise from certain dualizations of the well-known family of infectious logics. The distinctive feature of the semantic of infectious logics is the presence of a certain “infectious” semantic value, by which two different though equivalent things are meant. On the one hand, it is meant that these values are zero elements for all the operations in the underlying algebraic structure. On the other hand, it is meant that these values behave in a value-in-value-out fashion for all the operations in the underlying algebraic structure. Thus, in a rather informal manner, we will refer to immune logics as those systems whose underlying semantics count with a certain “immune” semantic value behaving in a way that is somewhat dual to that of the infectious values. In a more formal manner, carrying out this dualization will prove to be not as straightforward as one could imagine, since the two characterizations of infectiousness discussed above lead to two different outcomes when one tries to conduct them. We explore these alternatives and provide technical results regarding them, and the various logical systems defined using such semantics.
APA, Harvard, Vancouver, ISO, and other styles
33

Wagner, Eric G. "Algebraic Theories, Data Types, and Control Constructs." Fundamenta Informaticae 9, no. 3 (July 1, 1986): 343–70. http://dx.doi.org/10.3233/fi-1986-9305.

Full text
Abstract:
The aim of this paper is to model recursive types, equational types, and elementary programming control constructs (such as conditionals and while-do) in one, comparatively simple, algebraic framework, that can be used for theoretical studies and as a basis for data type and program specification. To this end we introduce a new kind of algebraic theory, the RV-theory. We give simple examples of the use of such theories for data type specification. We provide a mathematical semantics for these specifications that extends the initial algebra semantics for equational specification to include recursive types.
APA, Harvard, Vancouver, ISO, and other styles
34

SUBRAHMANIAN, V. S. "A RING-THEORETIC BASIS FOR LOGIC PROGRAMMING." International Journal of Foundations of Computer Science 01, no. 01 (March 1990): 23–48. http://dx.doi.org/10.1142/s0129054190000047.

Full text
Abstract:
Investigations into the semantics of logic programming have largely restricted themselves to the case when the set of truth values being considered is a complete lattice. While a few theorems have been obtained which make do with weaker structures, to our knowledge there is no semantical characterization of logic programming which does not require that the set of truth values be partially ordered. We derive here semantical results on logic programming over a space of truth values that forms a commutative pseudo-ring (an algebraic structure a bit weaker than a ring) with identity. This permits us to study the semantics of multi-valued logic programming having a (possibly) non-partially ordered set of truth values.
APA, Harvard, Vancouver, ISO, and other styles
35

Plaza, Jan A. "Logic Programming from the Perspective of Algebraic Semantics." Fundamenta Informaticae 28, no. 1,2 (1996): 153–64. http://dx.doi.org/10.3233/fi-1996-281210.

Full text
APA, Harvard, Vancouver, ISO, and other styles
36

Polkowski, Lech T., and Maria Semeniuk Polkowska. "A semantics for anaphora resolution in algebraic linguistics." International Journal of Computer Mathematics 32, no. 3-4 (January 1990): 137–47. http://dx.doi.org/10.1080/00207169008803822.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Mobasher, Bamshad, Don Pigozzi, and Giora Slutzki. "Multi-valued logic programming semantics an algebraic approach." Theoretical Computer Science 171, no. 1-2 (January 1997): 77–109. http://dx.doi.org/10.1016/s0304-3975(96)00126-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
38

Melliès, Paul-André, and Nicolas Tabareau. "An Algebraic Account of References in Game Semantics." Electronic Notes in Theoretical Computer Science 249 (August 2009): 377–405. http://dx.doi.org/10.1016/j.entcs.2009.07.099.

Full text
APA, Harvard, Vancouver, ISO, and other styles
39

Cheng, Jingde. "An algebraic semantics of notional entailment logic Cn." Information Processing Letters 36, no. 3 (November 1990): 117–21. http://dx.doi.org/10.1016/0020-0190(90)90079-d.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Rodríguez, J. Tinguaro, Esko Turunen, Da Ruan, and Javier Montero. "Another paraconsistent algebraic semantics for Lukasiewicz–Pavelka logic." Fuzzy Sets and Systems 242 (May 2014): 132–47. http://dx.doi.org/10.1016/j.fss.2013.06.011.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

Krishnan, Padmanabhan. "A Process Algebraic Approach to Time Granularity Semantics." International Journal of Foundations of Computer Science 08, no. 04 (December 1997): 363–78. http://dx.doi.org/10.1142/s0129054197000239.

Full text
Abstract:
In this paper we develop a theory for timed systems which relate to time granularity. We use the well known equivalence of bisimulation to study the effect of changing granularity. We identify situations where measuring time more accurately has no effect on the equivalence. Similarly we also present a few situations where measuring time less accurately has no effect on the equivalence. We also present properties of the situations where the semantics is indeed altered by a change in time granularity.
APA, Harvard, Vancouver, ISO, and other styles
42

Mauw, S. "An Algebraic Semantics of Basic Message Sequence Charts." Computer Journal 37, no. 4 (April 1, 1994): 269–77. http://dx.doi.org/10.1093/comjnl/37.4.269.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Fu, Yuxi. "Semantics of constructions (II) — The initial algebraic approach." Journal of Computer Science and Technology 16, no. 2 (March 2001): 137–45. http://dx.doi.org/10.1007/bf02950418.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Słomczyńska, Katarzyna. "Algebraic semantics for the (↔, ¬¬)-fragment of IPC." Mathematical Logic Quarterly 58, no. 1-2 (November 15, 2011): 29–37. http://dx.doi.org/10.1002/malq.201110001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
45

Berghammer, R., and H. Zierer. "Relational algebraic semantics of deterministic and nondeterministic programs." Theoretical Computer Science 43 (1986): 123–47. http://dx.doi.org/10.1016/0304-3975(86)90172-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

Lastovetsky, Alexey L., and Sergey S. Gaissaryan. "An algebraic approach to semantics of programming languages." Theoretical Computer Science 135, no. 2 (December 1994): 267–88. http://dx.doi.org/10.1016/0304-3975(94)00022-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

Odintsov, Sergei P., and E. I. Latkin. "BK-lattices. Algebraic Semantics for Belnapian Modal Logics." Studia Logica 100, no. 1-2 (February 9, 2012): 319–38. http://dx.doi.org/10.1007/s11225-012-9380-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

Letychevskyi, O. O., V. S. Peschanenko, M. Yu Poltorackiy, Yu H. Tarasich, and M. O. Vinnyk. "Formal semantics and analysis of tokenomics properties." PROBLEMS IN PROGRAMMING, no. 3-4 (December 2022): 128–38. http://dx.doi.org/10.15407/pp2022.03-04.128.

Full text
Abstract:
Today we are witnessing the rapid development of products and services based on blockchain technology. Cryptocurrencies and tokens are becoming an integral part of a person’s daily life. One of the main and, at the same time, the most difficult task for each project is the creation of a self-governing token economy. The violation of properties, such as equilibrium and decentralization, can result in the failure of a project and financial losses. Using the math and formal methods is a simple and efficient way to create self-sustainable token economies right at the stage of MVP development. Despite the rapid development of tokenomics, its popularity, and the rapid pace of implementing blockchain technology in various business areas, only a small number of works have examined formal models of tokenomics. In this study, we present an algebraic approach to analyzing the properties of tokenomics. The algebraic modeling approach is implemented within the framework of the Insertion Modeling System (IMS) that was developed at the Glushkov Institute of Cybernetics of the National Academy of Sciences of Ukraine under the guidance of an Academician of the National Academy of Sciences of Ukraine, Professor A.A. Letichevsky. The algebraic modeling methods prove the properties of safety and liveness. Insertion modeling is an approach for modeling complex distributed systems, which is based on the theory of interaction between agents and environments. The modeling algorithm is based on the historical data of exchange trading and the liquidity of tokens - which allows us to make accurate predictions and show possible outcomes. The interaction of tokenomics agents and their behavior, represented by the equations of behavioral algebra, is considered. The use of the algebraic approach to tokenomics development for the Internet of Things is considered, and the formal representations and methods of property analysis are presented. The obtained results allow us to discuss the possibility of using formal methods in the study of tokenomics.
APA, Harvard, Vancouver, ISO, and other styles
49

Cintula, Petr, Francesc Esteva, Joan Gispert, Lluís Godo, Franco Montagna, and Carles Noguera. "Distinguished algebraic semantics for t-norm based fuzzy logics: Methods and algebraic equivalencies." Annals of Pure and Applied Logic 160, no. 1 (July 2009): 53–81. http://dx.doi.org/10.1016/j.apal.2009.01.012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
50

Zhu, Huibiao, Fan Yang, Jifeng He, Jonathan P. Bowen, Jeff W. Sanders, and Shengchao Qin. "Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language." Journal of Logic and Algebraic Programming 81, no. 1 (January 2012): 2–25. http://dx.doi.org/10.1016/j.jlap.2011.06.003.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Algebraic semantics' for other source types:
Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography