Access the full text.
Sign up today, get DeepDyve free for 14 days.
Stefan Porschen (2006)
Counting All Solutions of Minimum Weight Exact Satisfiability
S. Liao, K. Keutzer, S. Tjiang, S. Devadas (1998)
A new viewpoint on code generation for directed acyclic graphsACM Trans. Design Autom. Electr. Syst., 3
E. Giunchiglia, A. Tacchella (2004)
Theory and Applications of Satisfiability Testing: 6th International Conference, Sat 2003, Santa Margherita Ligure, Italy, May 5-8 2003: Selected Revised Papers (Lecture Notes in Computer Science, 2919)
Stefan Porschen (2005)
On Some Weighted Satisfiability and Graph Problems
Jesper Byskov, B. Jurik, Bjarke Skjernaa (2003)
New algorithms for Exact SatisfiabilityTheor. Comput. Sci., 332
D. Applegate, W. Cook (1991)
Solving Large-Scale Matching Problems
L. Valiant (1979)
The Complexity of Enumeration and Reliability ProblemsSIAM J. Comput., 8
Stefan Porschen, B. Randerath, Ewald Speckenmeyer (2005)
Exact 3-Satisfiability Is Decidable in Time O (2 0.16254 n )Annals of Mathematics and Artificial Intelligence, 43
A. Aho, M. Ganapathi, S. Tjiang (1989)
Code generation using tree matching and dynamic programmingACM Transactions on Programming Languages and Systems (TOPLAS), 11
Bengt Aspvall, M. Plass, R. Tarjan (1979)
A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean FormulasInf. Process. Lett., 8
L. Valiant (1979)
The Complexity of Computing the PermanentTheor. Comput. Sci., 8
L. Fortnow, Steven Homer (2009)
Computational Complexity
M.R. Garey, D.S. Johnson (1979)
Computers and Intractability: A Guide to the Theory of NP-Completeness
David Johnson, C. Papadimitriou, M. Yannakakis (1988)
On Generating All Maximal Independent SetsInf. Process. Lett., 27
Daniel Berre, Laurent Simon (2003)
The Essentials of the SAT 2003 Competition
Vilhelm Dahllöf, P. Jonsson, R. Beigel (2004)
Algorithms for four variants of the exact satisfiability problemTheor. Comput. Sci., 320
David Johnson (1982)
The NP-Completeness Column: An Ongoing GuideJ. Algorithms, 4
T. Schaefer (1978)
The complexity of satisfiability problemsProceedings of the tenth annual ACM symposium on Theory of computing
S. Cook (1971)
The complexity of theorem-proving proceduresProceedings of the third annual ACM symposium on Theory of computing
Vilhelm Dahllöf, P. Jonsson (2002)
An algorithm for counting maximum weighted independent sets and its applications
(2006)
Über Variablen-Gewichtete X3SAT Optimierungs-Probleme
(1981)
Upper bounds for covering problems
Stefan Porschen (2005)
Solving Minimum Weight Exact Satisfiability in Time O(20.2441n)
M. Garey (1979)
Johnson: computers and intractability: a guide to the theory of np- completeness (freeman
We show that the NP-hard optimization problems minimum and maximum weight exact satisfiability (XSAT) for a CNF formula C over n propositional variables equipped with arbitrary real-valued weights can be solved in O(||C||20.2441n ) time. To the best of our knowledge, the algorithms presented here are the first handling weighted XSAT optimization versions in non-trivial worst case time. We also investigate the corresponding weighted counting problems, namely we show that the number of all minimum, resp. maximum, weight exact satisfiability solutions of an arbitrarily weighted formula can be determined in O(n 2·||C|| + 20.40567n ) time. In recent years only the unweighted counterparts of these problems have been studied (Dahllöf and Jonsson, An algorithm for counting maximum weighted independent sets and its applications. In: Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms, pp. 292–298, 2002; Dahllöf et al., Theor Comp Sci 320: 373–394, 2004; Porschen, On some weighted satisfiability and graph problems. In: Proceedings of the 31st Conference on Current Trends in Theory and Practice of Informatics (SOFSEM 2005). Lecture Notes in Comp. Science, vol. 3381, pp. 278–287. Springer, 2005).
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Oct 10, 2007
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.