scientific article

zbMath0607.68072MaRDI QIDQ3746920

Taisuke Sato, Hisao Tamaki

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

logic programmingdepth-first searchSLD-resolutionOLD refutationOLD-resolutionPROLOG interpreterPROLOG search strategiestabulation techniques

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Mechanization of proofs and logical operations (03B35)

Related Items (37)

Towards an efficient evaluation of recursive aggregates in deductive databases ⋮ Precise specification matching for adaptive reuse in embedded systems ⋮ Termination of logic programs with imperfect information: applications and query procedure ⋮ Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction ⋮ What is failure? An approach to constructive negation ⋮ Specialisation of Prolog and FCP programs using abstract interpretation ⋮ Constraint-Based Inference in Probabilistic Logic Programs ⋮ An Improved Depth-First Control Strategy for Query-Subquery Nets in Evaluating Queries to Horn Knowledge Bases ⋮ Generating contrastive explanations for inductive logic programming based on a near miss approach ⋮ Information flow in tabular interpretations for generalized push-down automata ⋮ Terminating Evaluation of Logic Programs with Finite Three-Valued Models ⋮ Fifty Years of Prolog and Beyond ⋮ Planning as tabled logic programming ⋮ Evaluation of the Implementation of an Abstract Interpretation Algorithm using Tabled CLP ⋮ An extended constraint deductive database: theory and implementation ⋮ Integrated Query Answering with Weighted Fuzzy Rules ⋮ Unnamed Item ⋮ Unnamed Item ⋮ PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control ⋮ Bottom-up evaluation and query optimization of well-founded models ⋮ Abstract interpretation: a kind of magic ⋮ A New Proposal for Debugging Datalog Programs ⋮ Dynamic reordering of alternatives for definite logic programs ⋮ Generalizing completeness results for loop checks in logic programming ⋮ A framework for computing finite SLD trees ⋮ Enhancing global SLS-resolution with loop cutting and tabling mechanisms ⋮ Loop checks for logic programs with functions ⋮ New Advances in Logic-Based Probabilistic Modeling by PRISM ⋮ Description, Implementation, and Evaluation of a Generic Design for Tabled CLP ⋮ On the Efficiency of Query-Subquery Nets with Right/Tail-Recursion Elimination in Evaluating Queries to Horn Knowledge Bases ⋮ Recursive query processing: The power of logic ⋮ Negation in rule-based database languages: A survey ⋮ OLDTNF-based evaluation method for handling recursive queries in deductive databases ⋮ Loop checking in SLD-derivations by well-quasi-ordering of goals ⋮ Type inference in Prolog: A new approach ⋮ Bottom-up abstract interpretation of logic programs ⋮ Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation

This page was built for publication: