Zobrazeno 1 - 10
of 462
pro vyhledávání: '"Term algebra"'
Autor:
Westerståhl, Dag
Publikováno v:
Journal of Philosophical Logic, 2004 Dec 01. 33(6), 549-582.
Externí odkaz:
https://www.jstor.org/stable/30226824
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, 2019, 777, pp.204-231. ⟨10.1016/j.tcs.2019.01.029⟩
Theoretical Computer Science, Elsevier, 2019, 777, pp.204-231. ⟨10.1016/j.tcs.2019.01.029⟩
Theoretical Computer Science, 2019, 777, pp.204-231. ⟨10.1016/j.tcs.2019.01.029⟩
Theoretical Computer Science, Elsevier, 2019, 777, pp.204-231. ⟨10.1016/j.tcs.2019.01.029⟩
International audience; We are interested in a natural generalization of term-rewriting techniques to what we call drags, viz. finite, directed, ordered, rooted multigraphs, each vertex of which is labeled by a function symbol. To this end, we develo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3a4e9dd0a91bb146b94a90e2e6d7c140
https://doi.org/10.1016/j.tcs.2019.01.029
https://doi.org/10.1016/j.tcs.2019.01.029
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030719944
FoSSaCS
FoSSaCS
We define nominal equational problems of the form $$\exists \overline{W} \forall \overline{Y} : P$$ ∃ W ¯ ∀ Y ¯ : P , where $$P$$ P consists of conjunctions and disjunctions of equations $$s\approx _\alpha t$$ s ≈ α t , freshness constraints
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4908759c6dc64629ba774b754b5a6408
https://doi.org/10.1007/978-3-030-71995-1_2
https://doi.org/10.1007/978-3-030-71995-1_2
Autor:
Marius Bozga, Radu Iosif
Publikováno v:
Formal Aspects of Component Software ISBN: 9783030906351
FACS
FACS
We introduce a term algebra as a new formal specification language for the coordinating architectures of distributed systems consisting of a finite yet unbounded number of components. The language allows to describe infinite sets of systems whose coo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87b921fb23c22d5b137f80b5560effeb
https://doi.org/10.1007/978-3-030-90636-8_6
https://doi.org/10.1007/978-3-030-90636-8_6
Autor:
Schneider, Carsten
A general overview of the existing difference ring theory for symbolic summation is given. Special emphasis is put on the user interface: the translation and back translation of the corresponding representations within the term algebra and the formal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3361::13724cebdd6d2cb27c4fc9886a10d26b
https://epub.jku.at/doi/10.35011/risc.21-03
https://epub.jku.at/doi/10.35011/risc.21-03
Publikováno v:
Computability. 6:125-164
An alpha-automaton (for alpha some ordinal) is an automaton similar to a Muller automaton that processes words of length alpha. A structure is called alpha-automatic if it can be presented by alpha-automata (completely analogous to the notion of auto
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::965e8dbb4079fce57b8504660e049fd5
https://doi.org/10.3233/com-160057
https://doi.org/10.3233/com-160057
Publikováno v:
Advances in Applied Clifford Algebras
Advances in Applied Clifford Algebras, Springer Verlag, 2017, 1, pp.1-19. ⟨10.1007/s00006-017-0770-6⟩
Advances in Applied Clifford Algebras, 2017, 1, pp.1-19. ⟨10.1007/s00006-017-0770-6⟩
Advances in Applied Clifford Algebras, Springer Verlag, 2017, 1, pp.1-19. ⟨10.1007/s00006-017-0770-6⟩
Advances in Applied Clifford Algebras, 2017, 1, pp.1-19. ⟨10.1007/s00006-017-0770-6⟩
International audience; This paper presents an efficient implementation of geometric algebra, based on a recursive representation of the algebra elements using binary trees. The proposed approach consists in restructuring a state of the art recursive
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8e671b73ee579787f2662b3371318c67
https://doi.org/10.1007/s00006-017-0770-6
https://doi.org/10.1007/s00006-017-0770-6
Publikováno v:
Fuzzy Sets and Systems. 298:128-157
This paper gives a survey on the categorical term construction based on the free algebra algorithm. In the framework of monoidal biclosed and cocomplete categories a possible concept of signature for finitary theories is introduced. Applications of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab8c5910a8fd6d4fd0480e2fb26fcff5
https://doi.org/10.1016/j.fss.2015.07.003
https://doi.org/10.1016/j.fss.2015.07.003
Autor:
Peter Höfner, Bernhard Möller
Publikováno v:
Journal of Logical and Algebraic Methods in Programming. 85:952-971
Feature Algebra was introduced as an abstract framework for feature-oriented software development. One goal is to provide a common, clearly defined basis for the key ideas of feature-orientation. The algebra captures major aspects of feature-orientat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5b227b31d60bcdae99f9c2ae60b38173
https://doi.org/10.1016/j.jlamp.2015.12.002
https://doi.org/10.1016/j.jlamp.2015.12.002
Autor:
Andrew John Ylvisaker
Publikováno v:
Algebra universalis. 75:127-154
In this paper, we exhibit a relation algebra reduct of any diagonal-free cylindric algebra of dimension 3 having sufficiently strong projection and equality parameters. We also offer a complete (and corrected) proof that full first-order logic can be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cfa6eff6d2b91005cf7f358f208ef6c4
https://doi.org/10.1007/s00012-016-0367-2
https://doi.org/10.1007/s00012-016-0367-2