On the public citation graph
Semantics and Expressive Power of Nondeterministic Constructs in Deductive Databases
0 signed · 58 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1993.1051openalex-snapshot
Reasoning about Termination of Pure Prolog Programs
inferredcites →https://doi.org/10.1007/3-540-55015-1_7openalex-snapshot
Non-determinism in deductive databases
inferredcites →https://doi.org/10.1007/3-540-57530-8_4openalex-snapshot
Datalog with non-deterministic choice computes NDB-PTIME
inferredcites →https://doi.org/10.1007/3-540-58907-4_8openalex-snapshot
DATALOG queries with stratified negation and choice: from P to D P
inferredcites →https://doi.org/10.1007/978-3-642-60085-2_18openalex-snapshot
Logic-Based User-Defined Aggregates for the Next Generation of Database Systems
inferredcites →https://doi.org/10.1007/bf01530924openalex-snapshot
Non-determinism in logic-based languages
inferredcites →https://doi.org/10.1016/0022-0000(82)90012-5openalex-snapshot
Structure and complexity of relational queries
inferredcites →https://doi.org/10.1016/0022-0000(90)90036-kopenalex-snapshot
Procedural languages for database queries and updates
inferredcites →https://doi.org/10.1016/0168-0072(86)90055-2openalex-snapshot
Fixed-point extensions of first-order logic
inferredcites →https://doi.org/10.1016/0743-1066(85)90002-0openalex-snapshot
Horn clause queries and generalizations
inferredcites →https://doi.org/10.1016/0890-5401(91)90059-bopenalex-snapshot
The expressive power of stratified logic programs
inferredcites →https://doi.org/10.1016/b978-1-4832-1313-2.50038-xopenalex-snapshot
Non-Deterministic Choice in Datalog
inferredcites →https://doi.org/10.1016/s0019-9958(86)80029-8openalex-snapshot
Relational queries computable in polynomial time
inferredcites →https://doi.org/10.1016/s0743-1066(97)10004-8openalex-snapshot
Datalog with non-deterministic choice computes NDB-PTIME
inferredcites →https://doi.org/10.1023/a:1018903705269openalex-snapshot
``Possible is certain'' is desirable and can be expressive
inferredcites →https://doi.org/10.1023/a:1018999404360openalex-snapshot
Programming with non-determinism in deductive databases
inferredcites →https://doi.org/10.1109/lics.1989.39160openalex-snapshot
Fixpoint extensions of first-order logic and datalog-like languages
inferredcites →https://doi.org/10.1137/0216051openalex-snapshot
Languages that Capture Complexity Classes
inferredcites →https://doi.org/10.1145/298514.298542openalex-snapshot
On the expressive power of datalog
inferredcites →https://doi.org/10.1145/298514.298572openalex-snapshot
Stable models and non-determinism in logic programs with negation
inferredcites →https://doi.org/10.1145/356924.356929openalex-snapshot
Logic and Databases: A Deductive Approach
inferredcites →https://doi.org/10.1145/800061.808765openalex-snapshot
Languages which capture complexity classes
inferredcites →https://doi.org/10.5860/choice.26-5107openalex-snapshot
Principles of database and knowledge-base systems
inferredcites →https://doi.org/10.5860/choice.27-0349openalex-snapshot
A logical language for data and knowledge bases
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-44543-9_4openalex-snapshot
User-Defined Aggregates in Database Languages
inferred← citeshttps://doi.org/10.1007/3-540-45571-x_42openalex-snapshot
Making Knowledge Extraction and Reasoning Closer
inferred← citeshttps://doi.org/10.1007/3-540-45607-4_2openalex-snapshot
A Transformation Technique for Datalog Programs Based on Non-deterministic Constructs
inferred← citeshttps://doi.org/10.1007/3-540-45632-5_3openalex-snapshot
Search and Optimization Problems in Datalog
inferred← citeshttps://doi.org/10.1007/3-540-45632-5_5openalex-snapshot
Key Constraints and Monotonic Aggregates in Deductive Databases
inferred← citeshttps://doi.org/10.1007/3-540-63792-3_21openalex-snapshot
Datalog++: A basis for active object-oriented databases
inferred← citeshttps://doi.org/10.1007/978-1-4615-1567-8_22openalex-snapshot
Nonmonotonic Reasoning in LDL++
inferred← citeshttps://doi.org/10.1007/978-3-030-89051-3_10openalex-snapshot
The Choice Construct in the Soufflé Language
inferred← citeshttps://doi.org/10.1007/978-3-031-01854-1openalex-snapshot
Datalog and Logic Databases
inferred← citeshttps://doi.org/10.1007/978-3-540-44497-8_4openalex-snapshot
Towards a Logic Query Language for Data Mining
inferred← citeshttps://doi.org/10.1007/978-3-642-11266-9_28openalex-snapshot
Destructive Rule-Based Properties and First-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-14309-0_9openalex-snapshot
Logic Programming Languages for Databases and the Web
inferred← citeshttps://doi.org/10.1007/978-3-642-18690-5_9openalex-snapshot
Logical Languages for Data Mining
inferred← citeshttps://doi.org/10.1007/978-3-642-60085-2_18openalex-snapshot
Logic-Based User-Defined Aggregates for the Next Generation of Database Systems
inferred← citeshttps://doi.org/10.1007/978-3-7908-1834-5_40openalex-snapshot
Declarative Knowledge Extraction with Iterative User-Defined Aggregates
inferred← citeshttps://doi.org/10.1007/bfb0056000openalex-snapshot
Query answering in nondeterministic, nonmonotonic logic databases
inferred← citeshttps://doi.org/10.1007/pl00013306openalex-snapshot
Extending stratified datalog to capture complexity classes ranging from ${\cal P} to {\cal QH}$
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50013-7openalex-snapshot
Logic and Databases: A History of Deductive Databases
inferred← citeshttps://doi.org/10.1016/j.datak.2012.04.002openalex-snapshot
Repairing inconsistent dimensions in data warehouses
inferred← citeshttps://doi.org/10.1016/j.jal.2004.07.023openalex-snapshot
Deductive databases for computing certain and consistent answers from mediated data integration systems
inferred← citeshttps://doi.org/10.1017/s1471068401001090openalex-snapshot
Greedy algorithms in Datalog
inferred← citeshttps://doi.org/10.1017/s1471068402001515openalex-snapshot
The deductive database system [Lscr ][Dscr ][Lscr ]++
inferred← citeshttps://doi.org/10.1109/69.956102openalex-snapshot
Nondeterministic, nonmonotonic logic databases
inferred← citeshttps://doi.org/10.1109/tkde.2004.64openalex-snapshot
Specifying mining algorithms with iterative user-defined aggregates
inferred← citeshttps://doi.org/10.1145/1086365.1086390openalex-snapshot
Backtracking, interleaving, and terminating monad transformers
inferred← citeshttps://doi.org/10.1145/1090189.1086390openalex-snapshot
Backtracking, interleaving, and terminating monad transformers
inferred← citeshttps://doi.org/10.2200/s00648ed1v01y201505dtm041openalex-snapshot
Datalog and Logic Databases
inferred← citeshttps://doi.org/10.3233/fun-2006-72404openalex-snapshot
A Value-propagating Transformation Technique for Datalog Programs Based on Non-Deterministic Constructs
inferred← citeshttps://doi.org/10.48550/arxiv.2108.11212openalex-snapshot
The Choice Construct in the Souffle Language
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.