On the public citation graph

Non-determinism in logic-based languages

0 signed · 64 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-18170-9_158openalex-snapshot
Skolem normal forms concerning the least fixpoint
inferredcites →https://doi.org/10.1007/3-540-50171-1_13openalex-snapshot
Deciding whether a production rule is relational computable
inferredcites →https://doi.org/10.1016/0004-3702(86)90080-9openalex-snapshot
An assumption-based TMS
inferredcites →https://doi.org/10.1016/0022-0000(80)90032-xopenalex-snapshot
Computable queries for relational data bases
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/0022-0000(91)90032-zopenalex-snapshot
Datalog extensions for database queries and updates
inferredcites →https://doi.org/10.1016/0096-0551(86)90018-4openalex-snapshot
Programming expert systems in OPS5
inferredcites →https://doi.org/10.1016/0304-3975(51)90006-0openalex-snapshot
Fundamental properties of deterministic and nondeterministic extensions of Datalog
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-0-934613-40-8.50014-2openalex-snapshot
A Logic-based Language for Database Updates
inferredcites →https://doi.org/10.1016/b978-1-4832-1313-2.50031-7openalex-snapshot
THE CONNECTION OF STATIC CONSTRAINTS WITH DETERMINISM AND BOUNDEDNESS OF DYNAMIC SPECIFICATIONS
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.1109/lics.1989.39160openalex-snapshot
Fixpoint extensions of first-order logic and datalog-like languages
inferredcites →https://doi.org/10.1109/sfcs.1985.27openalex-snapshot
Fixed-point extensions of first-order logic
inferredcites →https://doi.org/10.1137/0214049openalex-snapshot
The Implication Problem for Functional and Inclusion Dependencies is Undecidable
inferredcites →https://doi.org/10.1137/0216051openalex-snapshot
Languages that Capture Complexity Classes
inferredcites →https://doi.org/10.1145/1634.1886openalex-snapshot
Incomplete Information in Relational Databases
inferredcites →https://doi.org/10.1145/28659.28696openalex-snapshot
Optimizing datalog programs
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/298514.298575openalex-snapshot
Non-deterministic languages to express deterministic transformations
inferredcites →https://doi.org/10.1145/308386.308422openalex-snapshot
Explicit control of logic programs through rule algebra
inferredcites →https://doi.org/10.1145/308386.308448openalex-snapshot
Procedural and declarative database update languages
inferredcites →https://doi.org/10.1145/567532.567537openalex-snapshot
Programming primitives for database languages
inferredcites →https://doi.org/10.1145/76359.76363openalex-snapshot
A transaction-based approach to relational database specification
inferredcites →https://doi.org/10.1145/800061.808765openalex-snapshot
Languages which capture complexity classes
inferredcites →https://doi.org/10.1145/93597.93621openalex-snapshot
IDLOG: extending the expressive power of deductive database languages
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.1006/inco.1998.2712openalex-snapshot
An Extension of Fixpoint Logic with a Symmetry-Based Choice Construct
inferred← citeshttps://doi.org/10.1006/jcss.1999.1699openalex-snapshot
Semantics and Expressive Power of Nondeterministic Constructs in Deductive Databases
inferred← citeshttps://doi.org/10.1007/10703163_8openalex-snapshot
Choice Construct and Lindström Logics
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-54009-1_23openalex-snapshot
Consistency and non-determinism in a database programming language
inferred← citeshttps://doi.org/10.1007/3-540-55015-1_8openalex-snapshot
Declarative specification and evaluation of database updates
inferred← citeshttps://doi.org/10.1007/3-540-57530-8_4openalex-snapshot
Datalog with non-deterministic choice computes NDB-PTIME
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_61openalex-snapshot
Expressiveness of efficient semi-deterministic choice constructs
inferred← citeshttps://doi.org/10.1007/978-1-4471-3554-8_1openalex-snapshot
Non-Deterministic Aspects of Object-Creating Database Transformations
inferred← citeshttps://doi.org/10.1007/978-1-4615-5137-9_8openalex-snapshot
On the Complexity of Search Queries
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-662-54069-5_4openalex-snapshot
Semantics and Proof Theory of the Epsilon Calculus
inferred← citeshttps://doi.org/10.1007/bfb0031757openalex-snapshot
A more expressive deterministic query language with efficient symmetry-based choice construct
inferred← citeshttps://doi.org/10.1016/0022-0000(91)90032-zopenalex-snapshot
Datalog extensions for database queries and updates
inferred← citeshttps://doi.org/10.1016/0743-1066(95)00091-7openalex-snapshot
Nondeterminism through well-founded choice
inferred← citeshttps://doi.org/10.1016/j.comnet.2026.112353openalex-snapshot
Understanding 5G From a Safety-Critical Perspective: How to Properly Trust Wireless Networks Through a Dependable-Aware Networking Service
inferred← citeshttps://doi.org/10.1016/s0743-1066(97)10004-8openalex-snapshot
Datalog with non-deterministic choice computes NDB-PTIME
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00066-7openalex-snapshot
More on tractable disjunctive Datalog
inferred← citeshttps://doi.org/10.1023/a:1018907806177openalex-snapshot
Rule-based languages
inferred← citeshttps://doi.org/10.1023/a:1018955722107openalex-snapshot
On non-determinism in machines and languages
inferred← citeshttps://doi.org/10.1023/a:1018965418898openalex-snapshot
A procedural semantics for stratified database updates
inferred← citeshttps://doi.org/10.1109/69.390249openalex-snapshot
G-Log: a graph-based query language
inferred← citeshttps://doi.org/10.1109/69.599933openalex-snapshot
Default logic as a query language
inferred← citeshttps://doi.org/10.1109/69.617052openalex-snapshot
Programming with logical queries, bulk updates, and hypothetical reasoning
inferred← citeshttps://doi.org/10.1109/69.991720openalex-snapshot
Production systems with negation as failure
inferred← citeshttps://doi.org/10.1109/lics.2001.932493openalex-snapshot
On definability of order in logic with choice
inferred← citeshttps://doi.org/10.1145/113413.113442openalex-snapshot
Tractable query languages for complex object databases
inferred← citeshttps://doi.org/10.1145/202106.202110openalex-snapshot
Declarative updates of relational databases
inferred← citeshttps://doi.org/10.1145/3196959.3196965openalex-snapshot
When Can We Answer Queries Using Result-Bounded Data Interfaces?
inferred← citeshttps://doi.org/10.1145/3452021.3458815openalex-snapshot
Datalog Unchained
inferred← citeshttps://doi.org/10.2307/2586700openalex-snapshot
The Logic of Choice
inferred← citeshttps://doi.org/10.2307/2695073openalex-snapshot
Epsilon-logic is more expressive than first-order logic over finite structures
inferred← citeshttps://doi.org/10.24963/ijcai.2019/216openalex-snapshot
Mixed-World Reasoning with Existential Rules under Active-Domain Semantics
inferred← citeshttps://doi.org/10.5441/002/icdt.2014.17openalex-snapshot
Deduction with Contradictions in Datalog
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.