scientific article; zbMATH DE number 3982556
From MaRDI portal
Publication:3746920
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
Cited in
(40)- Specialisation of Prolog and FCP programs using abstract interpretation
- Information flow in tabular interpretations for generalized push-down automata
- Generalizing completeness results for loop checks in logic programming
- Recursive query processing: The power of logic
- OLDTNF-based evaluation method for handling recursive queries in deductive databases
- 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
- Towards an efficient evaluation of recursive aggregates in deductive databases
- Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction
- What is failure? An approach to constructive negation
- Loop checking in SLD-derivations by well-quasi-ordering of goals
- PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control
- Dynamic reordering of alternatives for definite logic programs
- Generating contrastive explanations for inductive logic programming based on a near miss approach
- A framework for computing finite SLD trees
- Precise specification matching for adaptive reuse in embedded systems
- Termination of logic programs with imperfect information: applications and query procedure
- An extended constraint deductive database: theory and implementation
- On the efficiency of query-subquery nets with right/tail-recursion elimination in evaluating queries to Horn knowledge bases
- Terminating evaluation of logic programs with finite three-valued models
- An improved depth-first control strategy for query-subquery nets in evaluating queries to Horn knowledge bases
- Integrated Query Answering with Weighted Fuzzy Rules
- Linear tabulated resolution based on Prolog control strategy
- Constraint-based inference in probabilistic logic programs
- Planning as tabled logic programming
- Description, implementation, and evaluation of a generic design for tabled CLP
- Extended magic for negation: efficient demand-driven evaluation of stratified Datalog with precise complexity guarantees
- scientific article; zbMATH DE number 7455734 (Why is no real title available?)
- Evaluation of the implementation of an abstract interpretation algorithm using tabled CLP*
- A new proposal for debugging Datalog programs
- New Advances in Logic-Based Probabilistic Modeling by PRISM
- Loop checks for logic programs with functions
- Fifty Years of Prolog and Beyond
- Prolegomena to logic programming for non-monotonic reasoning
- Bottom-up evaluation and query optimization of well-founded models
- Abstract interpretation: a kind of magic
- Enhancing global SLS-resolution with loop cutting and tabling mechanisms
- Domain-independent dynamic programming
- Negation in rule-based database languages: A survey
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)
