Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,642,946 papers from all fields of science
Search
Sign In
Create Free Account
Recursive set
Known as:
Computable set
, Recursively definable
, Decidable set
Expand
In computability theory, a set of natural numbers is called recursive, computable or decidable if there is an algorithm which terminates after a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
26 relations
Adian–Rabin theorem
Algorithm
Arithmetical hierarchy
Axiomatic system
Expand
Broader (2)
Computability theory
Theory of computation
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Finite Controllability of Conjunctive Query Answering with Existential Rules: Two Steps Forward
Giovanni Amendola
,
N. Leone
,
M. Manna
International Joint Conference on Artificial…
2018
Corpus ID: 51607618
Reasoning with existential rules typically consists of checking whether a Boolean conjunctive query is satisfied by all models of…
Expand
2011
2011
Extending H1-clauses with disequalities
H. Seidl
,
Andreas Reuß
Information Processing Letters
2011
Corpus ID: 37612760
2009
2009
On the Complexity of Nonassociative Lambek Calculus with Unit
Maria Bulinska
Studia Logica: An International Journal for…
2009
Corpus ID: 207242434
Nonassociative Lambek Calculus (NL) is a syntactic calculus of types introduced by Lambek [8]. The polynomial time decidability…
Expand
2007
2007
Conjunctive Query Entailment for SHOQ
Birte Glimm
,
Ian Horrocks
,
U. Sattler
Description Logics
2007
Corpus ID: 5773392
An important reasoning task, in addition to the standard DL reasoning services, is conjunctive query answering. In this paper, we…
Expand
1999
1999
Query Containment in the Presence of Limited Access Patterns
Chen Li
1999
Corpus ID: 18727449
In information-integration systems, sources may have access pattern limitations, i.e., they require values for certain attributes…
Expand
1997
1997
Delta-Languages for Sets and LOGSPACE Computable Graph Transformers
A. Lisitsa
,
V. Sazonov
Theoretical Computer Science
1997
Corpus ID: 7496901
1997
1997
Nonmonotonic rule systems with recursive sets of restraints
V. Marek
,
A. Nerode
,
J. Remmel
Archive for Mathematical Logic
1997
Corpus ID: 2988089
Abstract We study nonmonotonic rule systems with rules that admit infinitely many restraints. We concentrate on the case when the…
Expand
1994
1994
Negative set constraints with equality
Witold Charatonik
,
L. Pacholski
Proceedings Ninth Annual IEEE Symposium on Logic…
1994
Corpus ID: 18162170
Systems of set constraints describe relations between sets of ground terms. They have been successfully used in program analysis…
Expand
1993
1993
Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations
Jordi Levy
,
J. Agustí-Cullell
International Conference on Rewriting Techniques…
1993
Corpus ID: 14710645
We propose an extension of rewriting techniques to derive inclusion relations \(a \subseteq b\) between terms built from…
Expand
1986
1986
Floating-point error analysis of recursive least-squares and least-mean-squares adaptive filters
S. Ardalan
1986
Corpus ID: 8577896
A floating-point error analysis of the Recursive LeastSquares (RLS) and Least-Mean-Squares (LMS) algorithms is presented. Both…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE