Backchain iteration: Towards a practical inference method that is simple enough to be proved terminating, sound, and complete
type: Item
instance of: scholarly article
title: Backchain iteration: Towards a practical inference method that is simple enough to be proved terminating, sound, and complete
zbMATH Open document ID: 0784.68025
DOI: 10.1007/BF00881898
author: Adrian Walker
published in: Journal of Automated Reasoning
publication date: 1994-01-13T00:00:00Z
Mathematics Subject Classification ID: 68N17
zbMATH DE Number: 484762
zbMATH Keywords: termination
zbMATH Keywords: completeness
zbMATH Keywords: soundness
zbMATH Keywords: efficiency
zbMATH Keywords: executable specification
zbMATH Keywords: database application
zbMATH Keywords: re-use of methods
zbMATH Keywords: stratified datalog programs with negation
zbMATH Keywords: deductive database
zbMATH Keywords: meta-interpreter
zbMATH Keywords: Backchain iteration
MaRDI profile type: Publication
cites work: Contributions to the Theory of Logic Programming
cites work: Translation of logic programs into functional fixpoint equations
cites work: A Proof Procedure Using Connection Graphs
cites work: The Semantics of Predicate Logic as a Programming Language
cites work: Recursive query processing: The power of logic
cites work: Q3796698
full work available at URL: https://doi.org/10.1007/bf00881898
OpenAlex ID: W1989282019
description: scientific article; zbMATH DE number 484762