The following pages link to (Q3746920):
Displaying 37 items.
- Bottom-up evaluation and query optimization of well-founded models (Q673130) (← links)
- Abstract interpretation: a kind of magic (Q673498) (← links)
- Enhancing global SLS-resolution with loop cutting and tabling mechanisms (Q703484) (← links)
- Negation in rule-based database languages: A survey (Q753476) (← links)
- Specialisation of Prolog and FCP programs using abstract interpretation (Q1108783) (← links)
- Information flow in tabular interpretations for generalized push-down automata (Q1129130) (← links)
- Generalizing completeness results for loop checks in logic programming (Q1199926) (← links)
- Recursive query processing: The power of logic (Q1262144) (← links)
- OLDTNF-based evaluation method for handling recursive queries in deductive databases (Q1286645) (← links)
- Type inference in Prolog: A new approach (Q1311964) (← links)
- Bottom-up abstract interpretation of logic programs (Q1318725) (← links)
- Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation (Q1322838) (← links)
- Towards an efficient evaluation of recursive aggregates in deductive databases (Q1326572) (← links)
- Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction (Q1344881) (← links)
- What is failure? An approach to constructive negation (Q1346220) (← links)
- Loop checking in SLD-derivations by well-quasi-ordering of goals (Q1575249) (← links)
- PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control (Q1726305) (← links)
- Dynamic reordering of alternatives for definite logic programs (Q1749236) (← links)
- Generating contrastive explanations for inductive logic programming based on a near miss approach (Q2163226) (← links)
- A framework for computing finite SLD trees (Q2258840) (← links)
- Precise specification matching for adaptive reuse in embedded systems (Q2372190) (← links)
- Termination of logic programs with imperfect information: applications and query procedure (Q2372195) (← links)
- An extended constraint deductive database: theory and implementation (Q2436517) (← links)
- On the Efficiency of Query-Subquery Nets with Right/Tail-Recursion Elimination in Evaluating Queries to Horn Knowledge Bases (Q2808079) (← links)
- Terminating Evaluation of Logic Programs with Finite Three-Valued Models (Q2946744) (← links)
- An Improved Depth-First Control Strategy for Query-Subquery Nets in Evaluating Queries to Horn Knowledge Bases (Q3192964) (← links)
- Integrated Query Answering with Weighted Fuzzy Rules (Q3524990) (← links)
- Constraint-Based Inference in Probabilistic Logic Programs (Q4559821) (← links)
- Planning as tabled logic programming (Q4592996) (← links)
- Description, Implementation, and Evaluation of a Generic Design for Tabled CLP (Q4957184) (← links)
- (Q5020560) (← links)
- (Q5020994) (← links)
- Evaluation of the Implementation of an Abstract Interpretation Algorithm using Tabled CLP (Q5108525) (← links)
- A New Proposal for Debugging Datalog Programs (Q5403479) (← links)
- New Advances in Logic-Based Probabilistic Modeling by PRISM (Q5452024) (← links)
- Loop checks for logic programs with functions (Q5958765) (← links)
- Fifty Years of Prolog and Beyond (Q6063890) (← links)
