Results 31 to 40 of about 40,361 (263)
Answer Counting under Guarded TGDs [PDF]
Logical Methods in Computer Science, 2023 We study the complexity of answer counting for ontology-mediated queries and for querying under constraints, considering conjunctive queries and unions thereof (UCQs) as the query language and guarded TGDs as the ontology and constraint language ...
Cristina Feier +2 more
doaj +1 more source
Large-scale Parallel Stratified Defeasible Reasoning [PDF]
, 2012 We are recently experiencing an unprecedented explosion of available data from the Web, sensors readings, scientific databases, government authorities and more.
Antoniou, Grigoris +4 more
core +1 more source
Rewriting with Acyclic Queries: Mind Your Head [PDF]
Logical Methods in Computer Science, 2023 The paper studies the rewriting problem, that is, the decision problem whether, for a given conjunctive query $Q$ and a set $\mathcal{V}$ of views, there is a conjunctive query $Q'$ over $\mathcal{V}$ that is equivalent to $Q$, for cases where the query,
Gaetano Geck +3 more
doaj +1 more source
On the (un)decidability of a near-unanimity term [PDF]
, 2007 We investigate the near-unanimity problem: given a finite algebra, decide if it has a near-unanimity term of finite arity. We prove that it is undecidable of a finite algebra if it has a partial near-unanimity term on its underlying set excluding two ...
Maróti, Miklós
core +1 more source
Some simple varieties of trees arising in permutation analysis [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 After extending classical results on simple varieties of trees to trees counted by their number of leaves, we describe a filtration of the set of permutations based on their strong interval trees.
Mathilde Bouvel +2 more
doaj +1 more source
Testing formula satisfaction [PDF]
, 2012 We study the query complexity of testing for properties defined by read once formulae, as instances of massively parametrized properties, and prove several testability and non-testability results.
D. Ron +12 more
core +1 more source
The Mask of Odd Points n-Ary Interpolating Subdivision Scheme
Journal of Applied Mathematics, 2012 We present an explicit formula for the mask of odd points n-ary, for any odd n⩾3, interpolating subdivision schemes. This formula provides the mask of lower and higher arity schemes. The 3-point and 5-point a-ary schemes introduced by Lian, 2008, and (2m+
Ghulam Mustafa +3 more
doaj +1 more source
Green’s Relations on Submonoids of Generalized Hypersubstitutions of Type (n)
Discussiones Mathematicae - General Algebra and Applications, 2021 A generalized hypersubstitution of type τ = (n) is a function which takes the n-ary operation symbol f to the term of the same type σ(f ) which does not necessarily preserve the arity. Let HypG(n) be the set of all these generalized hypersubstitutions of
Kunama Pornpimol, Leeratanavalee Sorasak
doaj +1 more source
Optimization of Tree Modes for Parallel Hash Functions: A Case Study [PDF]
, 2017 This paper focuses on parallel hash functions based on tree modes of operation for an inner Variable-Input-Length function. This inner function can be either a single-block-length (SBL) and prefix-free MD hash function, or a sponge-based hash function ...
Atighehchi, Kevin, Rolland, Robert
core +1 more source
Arity Raising in Manticore [PDF]
, 2010 Compilers for polymorphic languages are required to treat values in programs in an abstract and generic way at the source level. The challenges of optimizing the boxing of raw values, flattening of argument tuples, and raising the arity of functions that handle complex structures to reduce memory usage are old ones, but take on newfound import with ...
Lars Bergstrom, John Reppy
openaire +1 more source