Zobrazeno 1 - 10
of 2 874
pro vyhledávání: '"Relation algebra"'
Autor:
Pace, Lorenzo
Recently, Gavazzo has developed a relational theory of symbolic manipulation, that allows to study syntax-based rewriting systems without relying on specific notions of syntax. This theory was obtained by extending the algebra of relations with synta
Externí odkaz:
http://arxiv.org/abs/2312.02996
This paper presents the development of a software tool that enables the translation of first-order predicate logic with at most three variables into relation algebra. The tool was developed using the Z3 theorem prover, leveraging its capabilities to
Externí odkaz:
http://arxiv.org/abs/2308.02513
Autor:
Backhouse, Roland, Voermans, Ed
We introduce the general notions of an index and a core of a relation. We postulate a limited form of the axiom of choice -- specifically that all partial equivalence relations have an index -- and explore the consequences of adding the axiom to stan
Externí odkaz:
http://arxiv.org/abs/2309.02017
Publikováno v:
Logical Methods in Computer Science, Volume 20, Issue 3 (September 4, 2024) lmcs:11328
We investigate a number of semantically defined fragments of Tarski's algebra of binary relations, including the function-preserving fragment. We address the question whether they are generated by a finite set of operations. We obtain several positiv
Externí odkaz:
http://arxiv.org/abs/2305.04656
Publikováno v:
Logical Methods in Computer Science, Vol Volume 20, Issue 3 (2024)
We investigate a number of semantically defined fragments of Tarski's algebra of binary relations, including the function-preserving fragment. We address the question whether they are generated by a finite set of operations. We obtain several positiv
Externí odkaz:
https://doaj.org/article/0aabc79542ca4600ae1616505a27e6da
Autor:
Šemrl, Jaš
The decision problem of membership in the Representation Class of Relation Algebras (RRA) for finite structures is undecidable. However, this does not hold for many Relation Algebra reduct languages. Two well known properties that are sufficient for
Externí odkaz:
http://arxiv.org/abs/2111.01213
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
{log} ('setlog') is a satisfiability solver for formulas of the theory of finite sets and finite set relation algebra (FSTRA). As such, it can be used as an automated theorem prover (ATP) for this theory. {log} is able to automatically prove a number
Externí odkaz:
http://arxiv.org/abs/2101.07700
Publikováno v:
In Journal of Logical and Algebraic Methods in Programming April 2022 126
Autor:
Alm, Jeremy F., Levet, Michael, Moazami, Saeed, Montero-Vallejo, Jorge, Pham, Linda, Sexton, Dave, Xu, Xiaonan
Publikováno v:
Algebra universalis, 2022
In this paper, we shed new light on the spectrum of the relation algebra we call $A_{n}$, which is obtained by splitting the non-flexible diversity atom of $6_{7}$ into $n$ symmetric atoms. Precisely, we show that the minimum value in $\text{Spec}(A_
Externí odkaz:
http://arxiv.org/abs/1911.00620