A new algorithm for linear and integer feasibility in Horn constraints

DOI10.1007/978-3-642-21311-3_21MaRDI QIDQ3003291zbMATH OpenOpenAlexFDO

Authors J. Worthington, K. Subramani

Publication date 26 May 2011

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21311-3_21

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Linear programming (90C05) Analysis of algorithms (68W40) Integer programming (90C10)

Recommendations

• Feasibility checking in Horn constraint systems through a reduction based approach
• A combinatorial algorithm for Horn programs
• A combinatorial algorithm for Horn programs
• On a generalization of Horn constraint systems
• An efficient algorithm for a class of constraint satisfaction problems

Cited in

(6)

• Feasibility checking in Horn constraint systems through a reduction based approach
• Trichotomy for integer linear systems based on their sign patterns
• Analyzing fractional Horn constraint systems
• A combinatorial algorithm for Horn programs
• Projection methods for finding the greatest element of the intersection of max-closed convex sets
• A combinatorial algorithm for Horn programs

This page was built for publication: A new algorithm for linear and integer feasibility in Horn constraints

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