Constraint solving on terms

DOI10.1007/3-540-45406-3_2MaRDI QIDQ2762629zbMATH OpenFDO

Authors Hubert Comon, Claude Kirchner

Publication date 9 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2002/2002047.

Mathematics Subject Classification ID

Logic in computer science (03B70)

Review text

In this chapter, we focus on constraint solving on terms, also called Herbrand constraints in the introductory chapter, and we follow the main concepts introduced in that chapter. For the entire collection see [Zbl 0961.00024].

Cited in

(7)

• Abstract canonical presentations
• Incremental variable splitting
• Constraint Answer Set Solving
• Concolic testing in CLP
• Automated Reasoning
• An Iabelle/HOL formalization of narrowing and multiset narrowing for E-unifiability, reachability and infeasibility
• Anti-patterns for rule-based languages

This page was built for publication: Constraint solving on terms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2762629)