Results 1 to 10 of about 6,811,260 (293)
On the Expressive Power of Homomorphism Counts [PDF]
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2021 A classical result by Lovász asserts that two graphs $G$ and $H$ are isomorphic if and only if they have the same left profile, that is, for every graph $F$, the number of homomorphisms from $F$ to $G$ coincides with the number of homomorphisms from $F$ to $H$.
Atserias, Albert +2 more
openaire +5 more sources
The Expressive Power of SPARQL [PDF]
Lecture Notes in Computer Science, 2008 This paper studies the expressive power of SPARQL. The main result is that SPARQL and non-recursive safe Datalog with negation have equivalent expressive power, and hence, by classical results, SPARQL is equivalent from an expressiveness point of view to Relational Algebra.
Claudio Gutierrez, Gutierrez Claudio
exaly +2 more sources
On the Expressive Power of OCL [PDF]
Lecture Notes in Computer Science, 1999 This paper examines the expressive power of OCL in terms of navigability and computability. First the expressive power of OCL is compared with the relational calculus; it is showed that OCL is not equivalent to the relational calculus. Then an algorithm computing the transitive closure of a binary relation -operation that cannot be encoded in the ...
Luis Mandel, María Victoria Cengarle
exaly +2 more sources
On the expressive power of query languages [PDF]
ACM Transactions on Information Systems, 1994 Two main topics are addressed. First, an algebraic approach is presented to define a general notion of expressive power. Heterogeneous algebras represent information systems and morphisms represent the correspondences between the instances of databases, the correspondences between answers, and the correspondences between queries.
Peter Schauble
exaly +3 more sources
On Higher-Order Probabilistic Subrecursion [PDF]
Logical Methods in Computer Science, 2021 We study the expressive power of subrecursive probabilistic higher-order calculi. More specifically, we show that endowing a very expressive deterministic calculus like G\"odel's $\mathbb{T}$ with various forms of probabilistic choice operators may ...
Flavien Breuvart +2 more
doaj +1 more source
Bipolar Morphological Neural Networks: Gate-Efficient Architecture for Computer Vision
IEEE Access, 2021 The priority of building hardware-oriented neural network models is growing steadily. The target goals for their development are the performance and energy efficiency of promising hardware-software solutions.
Elena E. Limonova +3 more
doaj +1 more source
Using the past for resolving the future
Frontiers in Computer Science, 2023 Nondeterminism models an ability to see the future: An automaton with an infinite look ahead can successfully resolve its nondeterministic choices. An automaton is history deterministic (HD) if it can successfully resolve its nondeterministic choices in ...
Orna Kupferman
doaj +1 more source
Revue Italienne d'Etudes Françaises, 2023 The article looks at the phenomenon of the rediscovery of Irène Némirovsky through the eyes of a particular reader: a journalist-researcher responsible for presenting, in the pages of the Italian daily with which she collaborated, all of Irène's novels ...
Gabriella Bosco
doaj +1 more source
CC-circuits and the expressive power of nilpotent algebras [PDF]
Logical Methods in Computer Science, 2022 We show that CC-circuits of bounded depth have the same expressive power as circuits over finite nilpotent algebras from congruence modular varieties. We use this result to phrase and discuss a new algebraic version of Barrington, Straubing and Th\'erien'
Michael Kompatscher
doaj +1 more source
THE EXPRESSIVE POWER OF TRUTH [PDF]
The Review of Symbolic Logic, 2014 AbstractThere are two perspectives from which formal theories can be viewed. On the one hand, one can take a theory to be about some privileged models. On the other hand, one can take all models of a theory to be on a par. In contrast with what is usually done in philosophical debates, we adopt the latter viewpoint.
Fischer, Martin, Horsten, Leon
openaire +2 more sources