Zobrazeno 1 - 10
of 814
pro vyhledávání: '"Equational logic"'
Autor:
Giacomo Bergami
Publikováno v:
Logics, Vol 2, Iss 2, Pp 79-111 (2024)
This paper considers a specification rewriting meachanism for a specific fragment of Linear Temporal Logic for Finite traces, DECLAREd, working through an equational logic and rewriting mechanism under customary practitioner assumptions from the Busi
Externí odkaz:
https://doaj.org/article/1695d28d287e4b1289da476a382c1521
Autor:
Citkin, Alex, author, Muravitsky, Alexei, author
Publikováno v:
Consequence Relations : An Introduction to the Lindenbaum-Tarski Method, 2022.
Externí odkaz:
https://doi.org/10.1093/oso/9780192866417.003.0008
Autor:
Benzmüller, Christoph, Heule, Marijn J.H., Schmidt, Renate A.
Infotext (nur auf Basis des Vorgängers): This two-volume set of LNAI 14739-14740 constitute the proceedings of the 12th International Joint Conference on Automated Reasoning, IJCAR 2024, held in Nancy, France, during July 3-6, 2024. The 39 full rese
Externí odkaz:
https://library.oapen.org/handle/20.500.12657/92348
Publikováno v:
ACM Transactions on Computational Logic, 23(4):22, 1-56. Association for Computing Machinery (ACM)
ACM Transactions on Computational Logic, 23(4):22. Association for Computing Machinery, Inc
Aceto, L, Castiglioni, V, Fokkink, W, Ingólfsdóttir, A & Luttik, B 2022, ' Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? ', ACM Transactions on Computational Logic, vol. 23, no. 4, 22, pp. 1-56 . https://doi.org/10.1145/3529535
ACM Transactions on Computational Logic, 23(4):22. Association for Computing Machinery, Inc
Aceto, L, Castiglioni, V, Fokkink, W, Ingólfsdóttir, A & Luttik, B 2022, ' Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? ', ACM Transactions on Computational Logic, vol. 23, no. 4, 22, pp. 1-56 . https://doi.org/10.1145/3529535
Bergstra and Klop have shown that bisimilarity has a finite equational axiomatisation over ACP/CCS extended with the binary left and communication merge operators. Moller proved that auxiliary operators are necessary to obtain a finite axiomatisation
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa7910a19045e6f8fc15641b740573d0
https://doi.org/10.1145/3529535
https://doi.org/10.1145/3529535
Autor:
Shintani, Kiraku, Hirokawa, Nao
We show how confluence criteria based on decreasing diagrams are generalized to ones composable with other criteria. For demonstration of the method, the confluence criteria of orthogonality, rule labeling, and critical pair systems for term rewritin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eea103a4687ba170f0c3b3915c36f6f2
http://arxiv.org/abs/2303.03906
http://arxiv.org/abs/2303.03906
In this paper, we present a linear and reversible programming language with inductives types and recursion. The semantics of the languages is based on pattern-matching; we show how ensuring syntactical exhaustivity and non-overlapping of clauses is e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3da2a93a80c6a990d1a6db977a6586a3
http://arxiv.org/abs/2302.11887
http://arxiv.org/abs/2302.11887
Autor:
Vilmart, Renaud
Publikováno v:
CSL 2023-31st EACSL Annual Conference on Computer Science Logic
CSL 2023-31st EACSL Annual Conference on Computer Science Logic, Feb 2023, Warsaw, Poland. pp.36:1--36:17, ⟨10.4230/LIPIcs.CSL.2023.36⟩
CSL 2023-31st EACSL Annual Conference on Computer Science Logic, Feb 2023, Warsaw, Poland. pp.36:1--36:17, ⟨10.4230/LIPIcs.CSL.2023.36⟩
The "Sum-Over-Paths" formalism is a way to symbolically manipulate linear maps that describe quantum systems, and is a tool that is used in formal verification of such systems. We give here a new set of rewrite rules for the formalism, and show that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6f409797f7f1aa24513ab22dc1a8be37
https://hal.science/hal-03654438v2/document
https://hal.science/hal-03654438v2/document
Autor:
Faggian, Claudia
Rewriting is a foundation for the operational theory of programming languages. The process of rewriting describes the computation of a result (typically, a normal form), with lambda-calculus being the paradigmatic example for rewriting as an abstract
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8fa2396dd3d27b179bd296083bd41c5a
Autor:
Barenbaum, Pablo, Bonelli, Eduardo
Proof terms are syntactic expressions that represent computations in term rewriting. They were introduced by Meseguer and exploited by van Oostrom and de Vrijer to study equivalence of reductions in (left-linear) first-order term rewriting systems. W
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ea85a5e9b702ee33cdf6c979413dbcb8
Autor:
Ivanov, Ievgen
We propose a generalization of Newman’s lemma which gives a criterion of confluence for a wide class of not-necessarily-terminating abstract rewriting systems. We show that ordinary Newman’s lemma for terminating systems can be considered as a co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d7261ff881800e41c0c2fa792ee542a6