On generating all solutions of generalized satisfiability problems
RAIRO-Theor. Inf. Appl., 31 6 (1997) 499-511
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Modular SAT-based techniques for reasoning tasks in team semantics
Arnaud Durand, Juha Kontinen and Jouko VäänänenJournal of Computer and System Sciences 146 103575 (2024)
https://doi.org/10.1016/j.jcss.2024.103575
Efficiently enumerating hitting sets of hypergraphs arising in data profiling
Thomas Bläsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks and Martin SchirneckJournal of Computer and System Sciences 124 192 (2022)
https://doi.org/10.1016/j.jcss.2021.10.002
Compression with Wildcards: From CNFs to Orthogonal DNFs by Imposing the Clauses One-by-One
Marcel WildThe Computer Journal 65 (5) 1073 (2022)
https://doi.org/10.1093/comjnl/bxaa142
On rainbow-free colourings of uniform hypergraphs
Ragnar Groot Koerkamp and Stanislav ŽivnýTheoretical Computer Science 885 69 (2021)
https://doi.org/10.1016/j.tcs.2021.06.022
Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem
Victor Lagerkvist and Biman RoyJournal of Computer and System Sciences 117 23 (2021)
https://doi.org/10.1016/j.jcss.2020.10.004
1 (2021)
https://doi.org/10.1109/LICS52264.2021.9470632
Enumerating models of DNF faster: Breaking the dependency on the formula size
Florent Capelli and Yann StrozeckiDiscrete Applied Mathematics 303 203 (2021)
https://doi.org/10.1016/j.dam.2020.02.014
Incremental FPT Delay
Arne MeierAlgorithms 13 (5) 122 (2020)
https://doi.org/10.3390/a13050122
Using a Min-Cut Generalisation to Go Beyond Boolean Surjective VCSPs
Gregor Matl and Stanislav ŽivnýAlgorithmica 82 (12) 3492 (2020)
https://doi.org/10.1007/s00453-020-00735-1
Parameterised Enumeration for Modification Problems
Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive and Heribert VollmerAlgorithms 12 (9) 189 (2019)
https://doi.org/10.3390/a12090189
Incremental delay enumeration: Space and time
Florent Capelli and Yann StrozeckiDiscrete Applied Mathematics 268 179 (2019)
https://doi.org/10.1016/j.dam.2018.06.038
A complexity theory for hard enumeration problems
Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek and Heribert VollmerDiscrete Applied Mathematics 268 191 (2019)
https://doi.org/10.1016/j.dam.2019.02.025
Gap theorems for robust satisfiability: Boolean CSPs and beyond
Lucy HamTheoretical Computer Science 676 69 (2017)
https://doi.org/10.1016/j.tcs.2017.03.006
Paradigms for Parameterized Enumeration
Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt and Heribert VollmerTheory of Computing Systems 60 (4) 737 (2017)
https://doi.org/10.1007/s00224-016-9702-4
Language and Automata Theory and Applications
Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek and Heribert VollmerLecture Notes in Computer Science, Language and Automata Theory and Applications 10168 183 (2017)
https://doi.org/10.1007/978-3-319-53733-7_13
Tractability in constraint satisfaction problems: a survey
Clément Carbonnel and Martin C. CooperConstraints 21 (2) 115 (2016)
https://doi.org/10.1007/s10601-015-9198-6
Language and Automata Theory and Applications
Nadia Creignou, Raïda Ktari, Arne Meier, et al.Lecture Notes in Computer Science, Language and Automata Theory and Applications 8977 524 (2015)
https://doi.org/10.1007/978-3-319-15579-1_41
8635 408 (2014)
https://doi.org/10.1007/978-3-662-44465-8_35
Structural tractability of enumerating CSP solutions
Gianluigi Greco and Francesco ScarcelloConstraints 18 (1) 38 (2013)
https://doi.org/10.1007/s10601-012-9129-8
Mathematical Foundations of Computer Science 2013
Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt and Heribert VollmerLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2013 8087 290 (2013)
https://doi.org/10.1007/978-3-642-40313-2_27
Principles and Practice of Constraint Programming
Hannes UppmanLecture Notes in Computer Science, Principles and Practice of Constraint Programming 7514 38 (2012)
https://doi.org/10.1007/978-3-642-33558-7_6
The complexity of surjective homomorphism problems—a survey
Manuel Bodirsky, Jan Kára and Barnaby MartinDiscrete Applied Mathematics 160 (12) 1680 (2012)
https://doi.org/10.1016/j.dam.2012.03.029
Theory and Applications of Satisfiability Testing - SAT 2011
Nadia Creignou, Frédéric Olive and Johannes SchmidtLecture Notes in Computer Science, Theory and Applications of Satisfiability Testing - SAT 2011 6695 120 (2011)
https://doi.org/10.1007/978-3-642-21581-0_11
165 (2010)
https://doi.org/10.1145/1804669.1804691
Complexity of Constraints
Nadia Creignou and Heribert VollmerLecture Notes in Computer Science, Complexity of Constraints 5250 3 (2008)
https://doi.org/10.1007/978-3-540-92800-3_2
Complexity of Constraints
Henning Schnoor and Ilka SchnoorLecture Notes in Computer Science, Complexity of Constraints 5250 229 (2008)
https://doi.org/10.1007/978-3-540-92800-3_9
Computation and Logic in the Real World
Heribert VollmerLecture Notes in Computer Science, Computation and Logic in the Real World 4497 748 (2007)
https://doi.org/10.1007/978-3-540-73001-9_80
STACS 2007
Henning Schnoor and Ilka SchnoorLecture Notes in Computer Science, STACS 2007 4393 694 (2007)
https://doi.org/10.1007/978-3-540-70918-3_59
SIGACT news complexity theory column 43
Lane A. HemaspaandraACM SIGACT News 35 (1) 22 (2004)
https://doi.org/10.1145/970831.970840
On unique graph 3-colorability and parsimonious reductions in the plane
Régis BarbanchonTheoretical Computer Science 319 (1-3) 455 (2004)
https://doi.org/10.1016/j.tcs.2004.02.003
STACS 2004
Elmar Böhler, Edith Hemaspaandra, Steffen Reith and Heribert VollmerLecture Notes in Computer Science, STACS 2004 2996 164 (2004)
https://doi.org/10.1007/978-3-540-24749-4_15
Recognition of Simple Enlarged Horn Formulas and Simple Extended Horn Formulas
Emmanuel Benoist and Jean-Jacques HébrardAnnals of Mathematics and Artificial Intelligence 37 (3) 251 (2003)
https://doi.org/10.1023/A:1021243928374
Optimal satisfiability for propositional calculi and constraint satisfaction problems
Steffen Reith and Heribert VollmerInformation and Computation 186 (1) 1 (2003)
https://doi.org/10.1016/S0890-5401(03)00092-0
The complexity of minimal satisfiability problems
Lefteris M. Kirousis and Phokion G. KolaitisInformation and Computation 187 (1) 20 (2003)
https://doi.org/10.1016/S0890-5401(03)00037-3
Computer Science Logic
Elmar Böhler, Edith Hemaspaandra, Steffen Reith and Heribert VollmerLecture Notes in Computer Science, Computer Science Logic 2471 412 (2002)
https://doi.org/10.1007/3-540-45793-3_28
SIGACT news complexity theory column 34
Lane A. HemaspaandraACM SIGACT News 32 (4) 24 (2001)
https://doi.org/10.1145/568425.568432
Logic Programming and Nonmotonic Reasoning
Leferis M. Kirousis and Phokion G. KolaitisLecture Notes in Computer Science, Logic Programming and Nonmotonic Reasoning 2173 42 (2001)
https://doi.org/10.1007/3-540-45402-0_3
71 (2001)
https://doi.org/10.1109/LICS.2001.932484
Mathematical Foundations of Computer Science 2000
Steffen Reith and Heribert VollmerLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2000 1893 640 (2000)
https://doi.org/10.1007/3-540-44612-5_59