On the public citation graph

The Alexander Method — A technique for the processing of recursive axioms in deductive databases

0 signed · 122 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/978-1-4684-3384-5_6openalex-snapshot

Deductive Question-Answering on Relational Data Bases

inferredcites →https://doi.org/10.1007/978-1-4684-3384-5_8openalex-snapshot

DEDUCE 2: Further Investigations of Deduction in Relational Data Bases

inferredcites →https://doi.org/10.1016/0167-9236(86)90084-9openalex-snapshot

Recursive axioms in deductive databases: The query/subquery approach

inferredcites →https://doi.org/10.1145/2422.2423openalex-snapshot

On compiling queries in recursive first-order databases

inferredcites →https://doi.org/10.1145/6012.15399openalex-snapshot

Magic sets and other strange ways to implement logic programs (extended abstract)

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/(sici)1098-111x(199703)12:3<203::aid-int3>3.0.co;2-topenalex-snapshot

Magic sets and stratified databases

inferred← citeshttps://doi.org/10.1006/jcss.1996.0038openalex-snapshot

An Extension of Van Gelder's Alternating Fixpoint to Magic Programs

inferred← citeshttps://doi.org/10.1007/3-540-17943-7_142openalex-snapshot

An overview of DDC: Delta driven computer

inferred← citeshttps://doi.org/10.1007/3-540-18203-9_8openalex-snapshot

DDC delta driven computer a parallel machine for symbolic processing

inferred← citeshttps://doi.org/10.1007/3-540-19129-1_5openalex-snapshot

Rule rewriting methods for efficient implementations of horn logic

inferred← citeshttps://doi.org/10.1007/3-540-45653-8_29openalex-snapshot

Efficient Computation of the Well-Founded Model Using Update Propagation

inferred← citeshttps://doi.org/10.1007/3-540-53557-8_24openalex-snapshot

Integrity and recursion: two key issues for deductive databases

inferred← citeshttps://doi.org/10.1007/3-540-54444-5_107openalex-snapshot

Abstract interpretation: A kind of magic

inferred← citeshttps://doi.org/10.1007/3-540-55425-4_13openalex-snapshot

Non-WAM models of logic programming and their support by novel parallel hardware

inferred← citeshttps://doi.org/10.1007/3-540-56804-2_12openalex-snapshot

Towards intelligent databases

inferred← citeshttps://doi.org/10.1007/3-540-57287-2_61openalex-snapshot

A uniform framework for Deductive Database derivation strategies

inferred← citeshttps://doi.org/10.1007/3-540-57877-3_26openalex-snapshot

Solving demand versions of interprocedural analysis problems

inferred← citeshttps://doi.org/10.1007/3-540-58025-5_54openalex-snapshot

Computing cost estimates for proof strategies

inferred← citeshttps://doi.org/10.1007/3-540-58156-1_23openalex-snapshot

On intuitionistic query answering in description bases

inferred← citeshttps://doi.org/10.1007/3-540-60794-3_19openalex-snapshot

Magic checking: Constraint checking for database query optimisation

inferred← citeshttps://doi.org/10.1007/3-540-63104-6_18openalex-snapshot

Non-horn magic sets to incorporate top-down inference into bottom-up theorem proving

inferred← citeshttps://doi.org/10.1007/978-1-4613-1679-4_35openalex-snapshot

DDC: A Deductive Database Machine

inferred← citeshttps://doi.org/10.1007/978-1-4615-2207-2_8openalex-snapshot

Demand Interprocedural Program Analysis Using Logic Databases

inferred← citeshttps://doi.org/10.1007/978-1-4615-3506-5_11openalex-snapshot

Efficient Bottom-Up Evaluation of Logic Programs

inferred← citeshttps://doi.org/10.1007/978-3-319-06569-4_21openalex-snapshot

An Improved Depth-First Control Strategy for Query-Subquery Nets in Evaluating Queries to Horn Knowledge Bases

inferred← citeshttps://doi.org/10.1007/978-3-540-79355-7_14openalex-snapshot

Generalizing the QSQR Evaluation Method for Horn Knowledge Bases

inferred← citeshttps://doi.org/10.1007/978-3-642-24206-9_19openalex-snapshot

Datalog Relaunched: Simulation Unification and Value Invention

inferred← citeshttps://doi.org/10.1007/978-3-642-34630-9_25openalex-snapshot

Query-Subquery Nets

inferred← citeshttps://doi.org/10.1007/978-3-642-41524-1_5openalex-snapshot

A Uniform Fixpoint Approach to the Implementation of Inference Methods for Deductive Databases

inferred← citeshttps://doi.org/10.1007/978-3-642-60211-5_18openalex-snapshot

Logic and Databases: a 20 Year Retrospective -Updated in Honor of Ray Reiter

inferred← citeshttps://doi.org/10.1007/978-3-642-75182-0_3openalex-snapshot

Can we reach a uniform paradigm for deductive query evaluation?

inferred← citeshttps://doi.org/10.1007/978-3-642-78545-0_19openalex-snapshot

Neuere Entwicklungen der deklarativen KI-Programmierung

inferred← citeshttps://doi.org/10.1007/978-3-642-82937-6_14openalex-snapshot

From Databases to Artificial Intelligence: A Hardware Point of View

inferred← citeshttps://doi.org/10.1007/978-3-7091-7553-8_89openalex-snapshot

An Algorithm for Selection Operator Propagation in Resolution Graph

inferred← citeshttps://doi.org/10.1007/978-3-7091-7555-2_12openalex-snapshot

Using Relaxation Techniques to Evaluate Queries in Deductive Databases

inferred← citeshttps://doi.org/10.1007/978-94-009-0705-8_20openalex-snapshot

EDS — Collaborating For a High Performance Parallel Relational Database

inferred← citeshttps://doi.org/10.1007/978-94-009-1063-8_28openalex-snapshot

Parallel Computers for Advanced Information Processing: The achievements of ESPRIT Project 415

inferred← citeshttps://doi.org/10.1007/bf00881955openalex-snapshot

Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction

inferred← citeshttps://doi.org/10.1007/bf01228880openalex-snapshot

The CORAL deductive system

inferred← citeshttps://doi.org/10.1007/bf01264013openalex-snapshot

A survey of parallel execution strategies for transitive closure and logic programs

inferred← citeshttps://doi.org/10.1007/bf01530759openalex-snapshot

Overview of disjunctive logic programming

inferred← citeshttps://doi.org/10.1007/bf01530928openalex-snapshot

Parallelism in logic programs

inferred← citeshttps://doi.org/10.1007/bf02948423openalex-snapshot

Query optimization for Deductive Databases

inferred← citeshttps://doi.org/10.1007/bf03037185openalex-snapshot

Incorporating top-down information into bottom-up hypothetical reasoning

inferred← citeshttps://doi.org/10.1007/bf03037212openalex-snapshot

Chart parsers as inference systems for fixed-mode logic programs

inferred← citeshttps://doi.org/10.1007/bf03037339openalex-snapshot

Towards an efficient evaluation of recursive aggregates in deductive databases

inferred← citeshttps://doi.org/10.1007/bfb0022042openalex-snapshot

Efficient answer extraction of deductive databases modeled by HLPN

inferred← citeshttps://doi.org/10.1007/bfb0027401openalex-snapshot

MGTP: A model generation theorem prover — Its advanced features and applications —

inferred← citeshttps://doi.org/10.1007/bfb0031734openalex-snapshot

Logic and databases: A 20 year retrospective

inferred← citeshttps://doi.org/10.1007/s10817-007-9091-0openalex-snapshot

A Logical Characterization of Forward and Backward Chaining in the Inverse Method

inferred← citeshttps://doi.org/10.1016/0165-6074(88)90117-2openalex-snapshot

DDC: Delta driven computer, and μSyC: microprogrammable symbolic coprocessor

inferred← citeshttps://doi.org/10.1016/0169-023x(90)90017-8openalex-snapshot

Query evaluation in recursive databases: bottom-up and top-down reconciled

inferred← citeshttps://doi.org/10.1016/0169-023x(91)90008-lopenalex-snapshot

A pipelined strategy for processing recursive queries in parallel

inferred← citeshttps://doi.org/10.1016/0304-3975(51)90005-9openalex-snapshot

The semantics of incomplete databases as an expression of preferences

inferred← citeshttps://doi.org/10.1016/0304-3975(51)90010-2openalex-snapshot

An efficient strategy for non-Horn deductive databases

inferred← citeshttps://doi.org/10.1016/0304-3975(89)90088-1openalex-snapshot

Recursive query processing: the power of logic

inferred← citeshttps://doi.org/10.1016/0304-3975(89)90089-3openalex-snapshot

A relational approach to logic programming: the extended Alexander method

inferred← citeshttps://doi.org/10.1016/0304-3975(93)90013-jopenalex-snapshot

A transformation system for deductive database modules with perfect model semantics

inferred← citeshttps://doi.org/10.1016/0304-3975(94)00223-6openalex-snapshot

Abstract interpretation: A kind of magic

inferred← citeshttps://doi.org/10.1016/0304-3975(94)90055-8openalex-snapshot

Bottom-up abstract interpretation of logic programs

inferred← citeshttps://doi.org/10.1016/0304-3975(96)00072-2openalex-snapshot

Precise interprocedural dataflow analysis with applications to constant propagation

inferred← citeshttps://doi.org/10.1016/0743-1066(91)90026-lopenalex-snapshot

Magic templates: a spellbinding approach to logic programs

inferred← citeshttps://doi.org/10.1016/0743-1066(91)90030-sopenalex-snapshot

Efficient bottom-up computation of queries on stratified databases

inferred← citeshttps://doi.org/10.1016/0743-1066(93)90012-6openalex-snapshot

Abstract interpretation based on Alexander Templates

inferred← citeshttps://doi.org/10.1016/0743-1066(94)00039-9openalex-snapshot

A survey of deductive database systems

inferred← citeshttps://doi.org/10.1016/b978-0-12-046370-1.50018-8openalex-snapshot

Rule Transformation Methods in the Implementation of Logic Based Languages

inferred← citeshttps://doi.org/10.1016/b978-0-444-88433-6.50010-1openalex-snapshot

Query Evaluation in Recursive Databases: Bottom-up and Top-down Reconciled

inferred← citeshttps://doi.org/10.1016/b978-0-444-88433-6.50015-0openalex-snapshot

On Deductive Query Evaluation in the DedGin* System

inferred← citeshttps://doi.org/10.1016/b978-0-934613-40-8.50017-8openalex-snapshot

A Superjoin Algorithm for Deductive Databases

inferred← citeshttps://doi.org/10.1016/b978-0-934613-53-8.50030-3openalex-snapshot

An Amateur's Introduction to Recursive Query Processing Strategies ††This is a revised version of a paper that appeared under the same title in the proceedings of SIGMOD 86. This work was performed while the first author was at MCC, Austin, and the second author was at the University of Texas at…

inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00167-4openalex-snapshot

Loop checking in SLD-derivations by well-quasi-ordering of goals

inferred← citeshttps://doi.org/10.1016/s0950-5849(98)00093-7openalex-snapshot

Program analysis via graph reachability

inferred← citeshttps://doi.org/10.1017/s1471068421000211openalex-snapshot

Analysis and Transformation of Constrained Horn Clauses for Program Verification

inferred← citeshttps://doi.org/10.1023/a:1018940713446openalex-snapshot

State‐saving transformations for efficient bottom‐up evaluation of logic programs and rule‐based systems

inferred← citeshttps://doi.org/10.1023/a:1020109502432openalex-snapshot

Duality for Goal-Driven Query Processing in Disjunctive Deductive Databases

inferred← citeshttps://doi.org/10.1080/01969729208927465openalex-snapshot

FC: A RELATIONAL QUERY LANGUAGE HAVING THE PROPERTY OF FUNCTIONAL COMPLETENESS

inferred← citeshttps://doi.org/10.1080/24751839.2017.1295664openalex-snapshot

Query–subquery nets for Horn knowledge bases in first-order logic

inferred← citeshttps://doi.org/10.1109/32.42735openalex-snapshot

SYGRAF: implementing logic programs in a database style

inferred← citeshttps://doi.org/10.1109/40.62724openalex-snapshot

Parallel computers for advanced information processing

inferred← citeshttps://doi.org/10.1109/69.298169openalex-snapshot

Rule ordering in bottom-up fixpoint evaluation of logic programs

inferred← citeshttps://doi.org/10.1109/69.43410openalex-snapshot

What you always wanted to know about Datalog (and never dared to ask)

inferred← citeshttps://doi.org/10.1109/cmpcon.1990.63730openalex-snapshot

The theory of deductive database systems

inferred← citeshttps://doi.org/10.1109/dexa.1996.558268openalex-snapshot

Optimizing query evaluation in deductive databases using reductions

inferred← citeshttps://doi.org/10.1109/dpds.1990.113697openalex-snapshot

A transitive closure and magic functions machine

inferred← citeshttps://doi.org/10.1109/icde.1991.131472openalex-snapshot

A rule-based query rewriter in an extensible DBMS

inferred← citeshttps://doi.org/10.1109/icde.1993.344023openalex-snapshot

A bottom-up query evaluation method for stratified databases

inferred← citeshttps://doi.org/10.1109/icse.2015.75openalex-snapshot

Database-Backed Program Analysis for Scalable Error Propagation

inferred← citeshttps://doi.org/10.1109/pacrim.1991.160737openalex-snapshot

PHI: a deductive database system

inferred← citeshttps://doi.org/10.1109/tai.1993.633975openalex-snapshot

Evaluating logical queries by means of communicating processes

inferred← citeshttps://doi.org/10.1145/1142473.1142485openalex-snapshot

Declarative networking

inferred← citeshttps://doi.org/10.1145/131295.131299openalex-snapshot

Memoing for logic programs

inferred← citeshttps://doi.org/10.1145/16856.16859openalex-snapshot

An amateur's introduction to recursive query processing strategies

inferred← citeshttps://doi.org/10.1145/201019.201027openalex-snapshot

Decomposition of magic rewriting

inferred← citeshttps://doi.org/10.1145/215465.215466openalex-snapshot

Shape analysis as a generalized path problem

inferred← citeshttps://doi.org/10.1145/222124.222146openalex-snapshot

Demand interprocedural dataflow analysis

inferred← citeshttps://doi.org/10.1145/222132.222146openalex-snapshot

Demand interprocedural dataflow analysis

inferred← citeshttps://doi.org/10.1145/231379.231399openalex-snapshot

Practical program analysis using general purpose logic programming systems—a case study

inferred← citeshttps://doi.org/10.1145/233269.233360openalex-snapshot

Cost-based optimization for magic

inferred← citeshttps://doi.org/10.1145/235809.235814openalex-snapshot

An analysis of magic sets and related optimization strategies for logic queries

inferred← citeshttps://doi.org/10.1145/235968.233360openalex-snapshot

Cost-based optimization for magic

inferred← citeshttps://doi.org/10.1145/2362355.2362360openalex-snapshot

A Generalized QSQR Evaluation Method for Horn Knowledge Bases

inferred← citeshttps://doi.org/10.1145/249069.231399openalex-snapshot

Practical program analysis using general purpose logic programming systems—a case study

inferred← citeshttps://doi.org/10.1145/2542050.2542085openalex-snapshot

On the efficiency of query-subquery nets

inferred← citeshttps://doi.org/10.1145/28659.28696openalex-snapshot

Optimizing datalog programs

inferred← citeshttps://doi.org/10.1145/298514.298562openalex-snapshot

Backward chaining evaluation in stratified disjunctive theories

inferred← citeshttps://doi.org/10.1145/3062341.3062348openalex-snapshot

HoTTSQL: proving query rewrites with univalent SQL semantics

inferred← citeshttps://doi.org/10.1145/3140587.3062348openalex-snapshot

HoTTSQL: proving query rewrites with univalent SQL semantics

inferred← citeshttps://doi.org/10.1145/319057.319063openalex-snapshot

A transitive closure and magic functions machine

inferred← citeshttps://doi.org/10.1145/581771.581774openalex-snapshot

On the complexity analysis of static analyses

inferred← citeshttps://doi.org/10.1145/62437.62482openalex-snapshot

A parallel multiprocessor machine dedicated to relational and deductive data bases

inferred← citeshttps://doi.org/10.1145/73721.73725openalex-snapshot

Logic programming as constructivism: a formalization and its application to databases

inferred← citeshttps://doi.org/10.1145/73721.73737openalex-snapshot

On the power of Alexander templates

inferred← citeshttps://doi.org/10.1145/75427.75436openalex-snapshot

An interpreter for large knowledge bases

inferred← citeshttps://doi.org/10.1145/773153.773164openalex-snapshot

Soft stratification for magic set based query evaluation in deductive databases

inferred← citeshttps://doi.org/10.1145/96709.96734openalex-snapshot

Parallelism in logic programs

inferred← citeshttps://doi.org/10.1609/aimag.v18i3.1304openalex-snapshot

Logic and Databases Past, Present, and Future

inferred← citeshttps://doi.org/10.2200/s00403ed1v01y201202dtm023openalex-snapshot

Declarative Networking

inferred← citeshttps://doi.org/10.48550/arxiv.1201.2564openalex-snapshot

Query-Subquery Nets

inferred← citeshttps://doi.org/10.4995/thesis/10251/5760openalex-snapshot

Generación de reglas restauradoras de la consistencia en esquemas relacionales con vistas.

inferred← citeshttps://doi.org/10.5282/ubm/epub.8509openalex-snapshot

Upside-down Deduction

inferred← citeshttps://doi.org/10.7551/mitpress/4283.003.0008openalex-snapshot

Program Analysis via Graph Reachability

inferred← citeshttps://doi.org/10.7551/mitpress/4316.003.0058openalex-snapshot

Fast and Precise Regular Approximations of Logic Programs

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.