The following pages link to (Q4038706):
Displaying 17 items.
- A compositional semantic basis for the analysis of equational Horn programs (Q671509) (← links)
- Multi-valued logic programming semantics An algebraic approach (Q673383) (← links)
- Abstract interpretation of resolution-based semantics (Q1035705) (← links)
- From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic (Q1194328) (← links)
- C-expressions: A variable-free calculus for equational logic programming (Q1208416) (← links)
- Weighted systems of equations (Q1311966) (← links)
- A compositional semantics for logic programs (Q1314414) (← links)
- A denotational semantics and dataflow construction for logic programs (Q1318723) (← links)
- The role of standardising apart in logic programming (Q1329744) (← links)
- SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs (Q1350529) (← links)
- Logical optimality of groundness analysis (Q1605228) (← links)
- A framework for computing finite SLD trees (Q2258840) (← links)
- On fuzzy unfolding: A multi-adjoint approach (Q2386238) (← links)
- Abstract Diagnosis of First Order Functional Logic Programs (Q3003495) (← links)
- Selective Unification in (Constraint) Logic Programming* (Q4988929) (← links)
- A New Algorithm for Computing Least Generalization of a Set of Atoms (Q5041770) (← links)
- Seeking a safe and efficient similarity-based unfolding rule (Q6064255) (← links)
