Incremental Satisfiability and Implication for UTVPI Constraints

DOI10.1287/ijoc.1090.0369zbMath1243.90141arXiv0709.2961OpenAlexW2113188188MaRDI QIDQ2899084

Peter J. Stuckey, Andreas Schutt

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0709.2961

zbMATH Keywords

satisfactionimplicationtwo-variable-per-inequality constraints

Mathematics Subject Classification ID

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

Related Items (10)

Integer feasibility and refutations in UTVPI constraints using bit-scaling ⋮ Trichotomy for integer linear systems based on their sign patterns ⋮ A certifying algorithm for lattice point feasibility in a system of UTVPI constraints ⋮ General lower bounds and improved algorithms for infinite-domain CSPs ⋮ Incremental closure for systems of two variables per inequality ⋮ A combinatorial certifying algorithm for linear feasibility in UTVPI constraints ⋮ On integer closure in a system of unit two variable per inequality constraints ⋮ A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints ⋮ Incrementally closing octagons ⋮ Pure Nash equilibria in graphical games and treewidth

This page was built for publication: Incremental Satisfiability and Implication for UTVPI Constraints