Abstract
Let F be a conjunction of atoms of the form max (x,y) + k ≥ z, where x, y, z are variables and k is a constant value. Here we consider the satisfiability problem of such formulas (e.g., over the integers or rationals). This problem, which appears in unexpected forms in many applications, is easily shown to be in NP. However, decades of efforts (in several research communities, see below) have not produced any polynomial decision procedure nor an NP-hardness result for this – apparently so simple – problem.
Here we develop several ingredients (small-model property and lattice structure of the model class, a polynomially tractable subclass and an inference system) which altogether allow us to prove the existence of small unsatisfiability certificates, and hence membership in NP intersection co-NP. As a by-product, we also obtain a weakly polynomial decision procedure.
We show that the Max-atom problem is PTIME-equivalent to several other well-known – and at first sight unrelated – problems on hypergraphs and on Discrete Event Systems, problems for which the existence of PTIME algorithms is also open. Since there are few interesting problems in NP intersection co-NP that are not known to be polynomial, the Max-atom problem appears to be relevant.
Partially supported by Spanish Ministry Educ. and Science LogicTools-2 project (TIN2007-68093-C02-01).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ausiello, G., Italiano, G., Nanni, U.: Optimal traversal of directed hypergraphs. Tech. Rep. TR-92-073, ICSI, Berkeley, CA (1992)
Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P. Annals of Mathematics 160(2), 781–793 (2004)
Bezem, M., Nieuwenhuis, R., Rodriguez-Carbonell, E.: Exponential behaviour of the Butkovič-Zimmermann algorithm for solving two-sided linear systems in max-algebra. Discrete Applied Mathematics (to appear)
Butkovič, P., Zimmermann, K.: A strongly polynomial algorithm for solving two-sided linear systems in max-algebra. Discrete Applied Mathematics 154(3), 437–446 (2006)
Condon, A.: The complexity of stochastic games. Information and Computation 96(2), 203–224 (1992)
Gallo, G., Longo, G., Pallottino, S., Nguyen, S.: Directed hypergraphs and applications. Discrete Applied Mathematics 42, 177–201 (1993)
Gunawardena, J.: Min-max functions. Discrete Events Dynamic Systems 4, 377–406 (1994)
Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT Modulo Theories: from an Abstract Davis-Putnam-Logemann-Loveland Procedure to DPLL(T). Journal of the ACM 53(6), 937–977 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bezem, M., Nieuwenhuis, R., Rodríguez-Carbonell, E. (2008). The Max-Atom Problem and Its Relevance. In: Cervesato, I., Veith, H., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2008. Lecture Notes in Computer Science(), vol 5330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89439-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-89439-1_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89438-4
Online ISBN: 978-3-540-89439-1
eBook Packages: Computer ScienceComputer Science (R0)