Results 31 to 40 of about 148,259 (301)
On Safety of Unary and Non-unary IFP-operators
Моделирование и анализ информационных систем, 2018 In this paper, we investigate the safety of unary inflationary fixed point operators (IFPoperators). The safety is a computability in finitely many steps.
Sergey Dudakov
doaj +1 more source
Around the root of random multidimensional quadtrees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We analyse the distribution of the root pattern of randomly grown multidimensional point quadtrees. In particular, exact, recursive and asymptotic formulas are given for the expected arity of the root.
Gilbert Labelle +2 more
doaj +1 more source
Parametrised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic [PDF]
, 2020 In this paper, we initiate a systematic study of the parametrised complexity in the field of Dependence Logics which finds its origin in the Dependence Logic of V\"a\"an\"anen from 2007.
A Durand +22 more
core +3 more sources
Cross-Sentence N-ary Relation Extraction using Lower-Arity Universal Schemas
Conference on Empirical Methods in Natural Language Processing, 2019 Most existing relation extraction approaches exclusively target binary relations, and n-ary relation extraction is relatively unexplored. Current state-of-the-art n-ary relation extraction method is based on a supervised learning approach and, therefore,
Kosuke Akimoto +3 more
semanticscholar +1 more source
Dynamic Complexity of Parity Exists Queries [PDF]
Logical Methods in Computer Science, 2021 Given a graph whose nodes may be coloured red, the parity of the number of red nodes can easily be maintained with first-order update rules in the dynamic complexity framework DynFO of Patnaik and Immerman.
Nils Vortmeier, Thomas Zeume
doaj +1 more source
Additive decomposability of functions over abelian groups [PDF]
, 2011 Abelian groups are classified by the existence of certain additive decompositions of group-valued functions of several variables with arity gap 2.Comment: 17 ...
ERKKO LEHTONEN +8 more
core +6 more sources
Essential arities in algebras of finite type and arity trees
Discrete Mathematics, 2002 Given an algebra \(A\), \(S(A)\) denotes the set of those nonnegative integers \(n\) for which there is a nontrivial essentially \(n\)-ary term operation on \(A\). In 1965, K. Urbanik characterized the sets \(S\) of integers such that \(S= S(A)\) for some idempotent algebra \(A\).
Kisielewicz, Andrzej, Tomasik, Jerzy
openaire +2 more sources
On the Mints Hierarchy in First-Order Intuitionistic Logic [PDF]
Logical Methods in Computer Science, 2017 We stratify intuitionistic first-order logic over $(\forall,\to)$ into fragments determined by the alternation of positive and negative occurrences of quantifiers (Mints hierarchy). We study the decidability and complexity of these fragments.
Aleksy Schubert +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
CUHK at MRP 2019: Transition-Based Parser with Cross-Framework Variable-Arity Resolve Action
Conference on Computational Natural Language Learning, 2019 This paper describes our system (RESOLVER) submitted to the CoNLL 2019 shared task on Cross-Framework Meaning Representation Parsing (MRP). Our system implements a transition-based parser with a directed acyclic graph (DAG) to tree preprocessor and a ...
Sunny Lai +3 more
semanticscholar +1 more source