On generating all solutions of generalized satisfiability problems
Article Properties
-
DOI (url)
-
Publication Date1997/01/01
-
Indian UGC (journal)
-
Refrences12
-
Citations20
-
N. Creignou
-
J.-J. Hebrard
Cite
Creignou, N., and J.-J. Hebrard. “On Generating All Solutions of Generalized Satisfiability Problems”. RAIRO - Theoretical Informatics and Applications, vol. 31, no. 6, 1997, pp. 499-11, https://doi.org/10.1051/ita/1997310604991.
Creignou, N., & Hebrard, J.-J. (1997). On generating all solutions of generalized satisfiability problems. RAIRO - Theoretical Informatics and Applications, 31(6), 499-511. https://doi.org/10.1051/ita/1997310604991
Creignou N, Hebrard JJ. On generating all solutions of generalized satisfiability problems. RAIRO - Theoretical Informatics and Applications. 1997;31(6):499-511.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| On the Structure of Polynomial Time Reducibility | Journal of the ACM |
| 248 | 1975 |
| On generating all maximal independent sets | Information Processing Letters |
| 282 | 1988 |
On sentences which are true of direct unions of algebras | The Journal of Symbolic Logic |
| 112 | 1951 |
| 10.1016/0095-8956(90)90132-J | ||||
| Linear-time algorithms for testing the satisfiability of propositional horn formulae | The Journal of Logic Programming | 336 | 1984 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Efficiently enumerating hitting sets of hypergraphs arising in data profiling | Journal of Computer and System Sciences |
| 1 | 2022 |
| Enumerating models of DNF faster: Breaking the dependency on the formula size | Discrete Applied Mathematics |
| 1 | 2021 |
| Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem | Journal of Computer and System Sciences |
| 1 | 2021 |
| On rainbow-free colourings of uniform hypergraphs | Theoretical Computer Science |
| 1 | 2021 |
Compression with Wildcards: From CNFs to Orthogonal DNFs by Imposing the Clauses One-by-One | The Computer Journal |
| 2 | 2021 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 13
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled SIGACT news complexity theory column 34 and was published in 2001. The most recent citation comes from a 2022 study titled Efficiently enumerating hitting sets of hypergraphs arising in data profiling. This article reached its peak citation in 2021, with 4 citations. It has been cited in 10 different journals, 10% of which are open access. Among related journals, the Discrete Applied Mathematics cited this research the most, with 4 citations. The chart below illustrates the annual citation trends for this article.