From LP to LP: Programming with constraints

DOI10.1007/3-540-54415-1_57zbMath1493.68116OpenAlexW1488923734MaRDI QIDQ5096231

Jean-Louis Lassez

Publication date: 16 August 2022

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

Full work available at URL: https://doi.org/10.1007/3-540-54415-1_57

Mathematics Subject Classification ID

Linear programming (90C05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

A linear programming primer: from Fourier to Karmarkar

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Fourier's algorithm for linear arithmetic constraints
• CAL: A theoretical background of constraint logic programming and its applications
• Constraint propagation with interval labels
• History and basic features of the critical-pair/completion procedure
• Real quantifier elimination is doubly exponential
• A survey of motion planning and related geometric algorithms
• A canonical form for generalized linear constraints
• Algebraic and logic programming. Second international conference, Nancy, France, October 1--3, 1990. Proceedings
• Logic-based decision support. Mixed integer model formulation
• Negative Boolean constraints
• Computational complexity and constraint logic programming languages
• Truly concurrent constraint programming
• Spatial query optimization: From Boolean constraints to range queries
• HORNLOG: A graph-based interpreter for general Horn clauses
• Alfred Tarski's elimination theory for real closed fields
• On the SUP-INF Method for Proving Presburger Formulas
• Application of pseudo-Boolean programming to the theory of graphs

This page was built for publication: From LP to LP: Programming with constraints