scientific article; zbMATH DE number 3982556
From MaRDI portal
Publication:3746920
zbMATH Open0607.68072MaRDI QIDQ3746920FDOQ3746920
Authors: Taisuke Sato, Hisao Tamaki 
Publication date: 1986
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 440107
- Resolving resolution dimensions
- Empirical investigation on combining tableaux and resolution
- Notes on resolving resolution dimensions
- Abstract interpretation based on oldt resolution
- scientific article; zbMATH DE number 4090348
- Tabular verification and refinement
- Resolution search
- On linear resolution
depth-first searchlogic programmingSLD-resolutionOLD refutationOLD-resolutionPROLOG interpreterPROLOG search strategiestabulation techniques
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Mechanization of proofs and logical operations (03B35)
Cited In (39)
- PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control
- A framework for computing finite SLD trees
- Specialisation of Prolog and FCP programs using abstract interpretation
- Enhancing global SLS-resolution with loop cutting and tabling mechanisms
- Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction
- Description, implementation, and evaluation of a generic design for tabled CLP
- An improved depth-first control strategy for query-subquery nets in evaluating queries to Horn knowledge bases
- On the efficiency of query-subquery nets with right/tail-recursion elimination in evaluating queries to Horn knowledge bases
- Dynamic reordering of alternatives for definite logic programs
- A new proposal for debugging Datalog programs
- Information flow in tabular interpretations for generalized push-down automata
- Planning as tabled logic programming
- An extended constraint deductive database: theory and implementation
- Loop checks for logic programs with functions
- Type inference in Prolog: A new approach
- Precise specification matching for adaptive reuse in embedded systems
- Title not available (Why is that?)
- Prolegomena to logic programming for non-monotonic reasoning
- New Advances in Logic-Based Probabilistic Modeling by PRISM
- What is failure? An approach to constructive negation
- Generating contrastive explanations for inductive logic programming based on a near miss approach
- Evaluation of the implementation of an abstract interpretation algorithm using tabled CLP*
- Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation
- Towards an efficient evaluation of recursive aggregates in deductive databases
- Fifty Years of Prolog and Beyond
- Recursive query processing: The power of logic
- Title not available (Why is that?)
- Integrated Query Answering with Weighted Fuzzy Rules
- Negation in rule-based database languages: A survey
- Terminating evaluation of logic programs with finite three-valued models
- Constraint-based inference in probabilistic logic programs
- OLDTNF-based evaluation method for handling recursive queries in deductive databases
- Generalizing completeness results for loop checks in logic programming
- Termination of logic programs with imperfect information: applications and query procedure
- Loop checking in SLD-derivations by well-quasi-ordering of goals
- Linear tabulated resolution based on Prolog control strategy
- Bottom-up abstract interpretation of logic programs
- Bottom-up evaluation and query optimization of well-founded models
- Abstract interpretation: a kind of magic
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3746920)
