Improved algorithms for optimal length resolution refutation in difference constraint systems
type: Item
instance of: scholarly article
title: Improved algorithms for optimal length resolution refutation in difference constraint systems
zbMATH Open document ID: 1259.68261
author: Matthew Williamson
author: Xiaofeng Gu
author: K. Subramani
published in: Formal Aspects of Computing
publication date: 2013-03-22T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 03B35
zbMATH DE Number: 6148363
zbMATH Keywords: optimal length resolution refutation
zbMATH Keywords: negative cycle detection
zbMATH Keywords: graph
zbMATH Keywords: difference constraint system
zbMATH Keywords: algorithm
describes a project that uses: DIMACS
MaRDI profile type: Publication
full work available at URL: s00165-011-0186-3
OpenAlex ID: W1987170234
cites work: Q4218098
cites work: Q4218929
cites work: Automated Reasoning
cites work: Q4809071
cites work: Scaling Algorithms for the Shortest Paths Problem
cites work: The intractability of resolution
cites work: Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
cites work: Q4943600
cites work: Q3525910
cites work: A Machine-Oriented Logic Based on the Resolution Principle
cites work: Q3813613
cites work: On deciding the non‐emptiness of 2SAT polytopes with respect to First Order Queries
cites work: An analysis of totally clairvoyant scheduling
cites work: Optimal length resolution refutations of difference constraint systems
cites work: The Complexity of Propositional Proofs
cites work: Fourier-Motzkin elimination extension to integer programming problems
DOI: 10.1007/S00165-011-0186-3
description: scientific article; zbMATH DE number 6148363