Selective Unification in (Constraint) Logic Programming*

DOI10.3233/FI-2020-1993zbMath1497.68087OpenAlexW3110946665MaRDI QIDQ4988929

Étienne Payet, Fred Mesnard, Germán Vidal

Publication date: 20 May 2021

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2020-1993

zbMATH Keywords

unificationlogic programmingconstraint logic programmingconcolic testing

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (1)

An SMT-based concolic testing tool for logic programs

Cites Work

• Unnamed Item
• Unnamed Item
• A necessary condition for constructive negation in constraint logic programming
• 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
• Concolic testing in logic programming
• A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: Selective Unification in (Constraint) Logic Programming*