Selective Unification in (Constraint) Logic Programming*
From MaRDI portal
(Redirected from Publication:4988929)
Recommendations
- scientific article; zbMATH DE number 1332644
- Anti-unification in constraint logic programming
- Unification as a complexity measure for logic programming
- Replacing unification by constraint satisfaction to improve logic program expressiveness
- Synthesis of a unification algorithm in a logic programming calculus
- scientific article; zbMATH DE number 1223549
- Unifying theories for logic programming
- scientific article; zbMATH DE number 555223
- On the completeness of selective unification in concolic testing of logic programs
Cites work
- A linear operational semantics for termination and complexity analysis of ISO prolog
- A necessary condition for constructive negation in constraint logic programming
- Concolic testing in logic programming
- scientific article; zbMATH DE number 177828 (Why is no real title available?)
- scientific article; zbMATH DE number 1312992 (Why is no real title available?)
- Negation and constraint logic programming
- On the completeness of selective unification in concolic testing of logic programs
- The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
- Verification, Model Checking, and Abstract Interpretation
Cited in
(7)- An SMT-based concolic testing tool for logic programs
- Restricted combinatory unification
- On the completeness of selective unification in concolic testing of logic programs
- scientific article; zbMATH DE number 3921947 (Why is no real title available?)
- scientific article; zbMATH DE number 4078850 (Why is no real title available?)
- Feature-constraint logics for unification grammars
- Concolic testing in CLP
This page was built for publication: Selective Unification in (Constraint) Logic Programming*
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4988929)
