The following pages link to (Q3789064):
Displaying 50 items.
- Reverse universal resolving algorithm and inverse driving (Q444478) (← links)
- Proximity-based unification theory (Q529054) (← links)
- A geometric interpretation of LD-resolution (Q596040) (← links)
- A compositional semantic basis for the analysis of equational Horn programs (Q671509) (← links)
- Transformations of CLP modules (Q671648) (← links)
- A non-ground realization of the stable and well-founded semantics (Q671655) (← links)
- Computing minimal models by partial instantiation (Q672131) (← links)
- A complete and recursive feature theory (Q673135) (← links)
- Intensional aspects of function definitions (Q673180) (← links)
- Multi-valued logic programming semantics An algebraic approach (Q673383) (← links)
- Abstract interpretation: a kind of magic (Q673498) (← links)
- Difference-list transformation for Prolog (Q685124) (← links)
- Complete axiomatizations of some quotient term algebras (Q685393) (← links)
- Average-case analysis of unification algorithms (Q685442) (← links)
- A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete (Q689290) (← links)
- Debugging Maude programs via runtime assertion checking and trace slicing (Q739630) (← links)
- First order compiler: A deterministic logic program synthesis algorithm (Q908686) (← links)
- Automatic inference of determinacy and mutual exclusion for logic programs using mode and type analyses (Q980470) (← links)
- Theories with the independence property (Q993495) (← links)
- An improved reductant calculus using fuzzy partial evaluation techniques (Q1037854) (← links)
- Context unification with one context variable (Q1041589) (← links)
- On the transformation of logic programs with instantiation based computation rules (Q1119029) (← links)
- The quotient of an abstract interpretation (Q1128983) (← links)
- Semantic models for concurrent logic languages (Q1177921) (← links)
- A canonical form for generalized linear constraints (Q1186697) (← links)
- A completeness result for allowed semi-strict programs with respect to well-behaved and allowed query clauses (Q1193863) (← links)
- Unfolding and fixpoint semantics of concurrent constraint logic programs (Q1200981) (← links)
- C-expressions: A variable-free calculus for equational logic programming (Q1208416) (← links)
- Compositionality properties of SLD-derivations (Q1274454) (← links)
- The reduced relative power operation on abstract domains (Q1285656) (← links)
- A compositional semantics for logic programs (Q1314414) (← links)
- Sound and complete partial deduction with unfolding based on well-founded measures (Q1314419) (← links)
- A feature constraint system for logic programming with entailment (Q1314426) (← links)
- Logic program synthesis from incomplete specifications (Q1322854) (← links)
- Logic of proofs (Q1326774) (← links)
- Computing definite logic programs by partial instantiation (Q1326778) (← links)
- The role of standardising apart in logic programming (Q1329744) (← links)
- Most specific logic programs (Q1356224) (← links)
- Incremental constraint satisfaction for equational logic programming (Q1367535) (← links)
- On deciding subsumption problems (Q1777407) (← links)
- Proving quantified literals in defeasible logic (Q1818760) (← links)
- Explicit versus implicit representations of subsets of the Herbrand universe. (Q1853582) (← links)
- Evolution of rule-based programs (Q1878711) (← links)
- Linearisability on Datalog programs (Q1884881) (← links)
- Category-based modularisation for equational logic programming (Q1901708) (← links)
- On inductive inference of cyclic structures (Q1924733) (← links)
- Syntactical models and fixed points for the basic logic of proofs (Q1924755) (← links)
- The powerset operator on abstract interpretations (Q1960538) (← links)
- On fuzzy unfolding: A multi-adjoint approach (Q2386238) (← links)
- A modular order-sorted equational generalization algorithm (Q2437800) (← links)
