{"id":19199054,"url":"https://github.com/leungll/pm-coding","last_synced_at":"2025-02-23T05:15:31.360Z","repository":{"id":105367508,"uuid":"336582283","full_name":"leungll/PM-Coding","owner":"leungll","description":"Solver algorithm in #3 Paper: Diversified Top-K MaxSAT Solving with MaxSAT","archived":false,"fork":false,"pushed_at":"2024-03-31T13:08:59.000Z","size":57,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-04T11:29:51.087Z","etag":null,"topics":["clause","encoding","solver-algorithm","symmetry-breaking","top-k"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"apache-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/leungll.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null}},"created_at":"2021-02-06T16:28:24.000Z","updated_at":"2024-03-31T13:06:32.000Z","dependencies_parsed_at":null,"dependency_job_id":"66e978bf-85e7-4242-9f75-1092d7ee8494","html_url":"https://github.com/leungll/PM-Coding","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/leungll%2FPM-Coding","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/leungll%2FPM-Coding/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/leungll%2FPM-Coding/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/leungll%2FPM-Coding/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/leungll","download_url":"https://codeload.github.com/leungll/PM-Coding/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240271536,"owners_count":19774859,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["clause","encoding","solver-algorithm","symmetry-breaking","top-k"],"created_at":"2024-11-09T12:25:27.598Z","updated_at":"2025-02-23T05:15:31.343Z","avatar_url":"https://github.com/leungll.png","language":"C++","readme":"# PM-Coding\nSolver algorithm in #3 Paper: Diversified Top-K MaxSAT Solving with MaxSAT.\n\n![GitHub last commit](https://img.shields.io/github/last-commit/leungll/PM-Coding?color=red\u0026style=flat-square) ![C++11](https://img.shields.io/badge/C%2B%2B11-passing-yellow) ![GitHub repo size](https://img.shields.io/github/repo-size/leungll/PM-Coding?style=flat-square)\n ![GitHub license](https://img.shields.io/github/license/leungll/PM-Coding?color=orange\u0026style=flat-square) \n## Server Address\n```\n/home/zhoujp/liangll/PM_Coding\n```\n\n## Compile \u0026 Run\n### Compile\n```\ng++ -std=c++11 PM-Coding.cpp -o PM-Coding\n```\n\n### Run\n```\n./PM-Coding XXX.XXX K 1\n```\n- `XXX.XXX` : input file\n- `K` : number of extended variables\n- `1` : the first `vertex sorting method` , currently tentatively `1`\n\n## Example of Variable Numbering\n### Input File\n- V2.wcnf \n- K = 3\n\n```\np wcnf 4 5 20\n20 1 3 0\n20 -2 -3 -4 0\n1 -1 2 0\n1 -2 0\n1 -3 0\n```\n\n### Run\n```\n./PM-Coding V2.wcnf 3 1\n```\n\n### Serial Number\n- Extended Variables\n  ```\n    X11 X12 X13                                  1  2  3\n    X21 X22 X23                                  4  5  6\n    X31 X32 X33                                  7  8  9\n    X41 X42 X43                                  10 11 12\n  ```\n\n- Hard Clause\n    ```\n    X11 ∨ X31                                     1  7\n    X12 ∨ X32                                     2  8\n    X13 ∨ X33                                     3  9\n    ㄱX21 ∨ ㄱX31 ∨ ㄱX41                          -4 -7 -10\n    ㄱX22 ∨ ㄱX32 ∨ ㄱX42                          -5 -8 -11\n    ㄱX23 ∨ ㄱX33 ∨ ㄱX43                          -6 -9 -12\n    ```\n\n- Soft Clause\n    ```\n    ㄱX11 ∨ ㄱX12 ∨ ㄱX13 ∨ X21 ∨ X22 ∨ X23        -1 -2 -3 4 5 6 \n    ㄱX21 ∨ ㄱX22 ∨ ㄱX23                          -4 -5 -6\n    ㄱX31 ∨ ㄱX32 ∨ ㄱX33                          -7 -8 -9    \n    ```\n\n### Variable Ordering\n- `{3, 1, 2, 4}`\n\n- ```\n  X31 X32 X33     \n  X11 X12 X13     \n  X21 X22 X23       \n  X41 X42 X43     \n  ```\n-  `X32 = X33 = X13 = 0`\n- Renumber the Extension Variable\n    ```\n    X11 X12         1  2  \n    X21 X22 X23     3  4  5\n    X31             6\n    X41 X42 X43     7  8  9\n    ```\n\n### Result\n- Hard Clause\n    ```\n    X11 ∨ X31                                     1  6\n    X12                                           2\n    ㄱX21 ∨ ㄱX31 ∨ ㄱX41                          -3 -6 -7     \n    ```\n\n- Soft Clause\n    ```\n    ㄱX11 ∨ ㄱX12 ∨ X21 ∨ X22 ∨ X23               -1 -2 3 4 5 \n    ㄱX21 ∨ ㄱX22 ∨ ㄱX23                          -3 -4 -5\n    ㄱX31                                         -6\n    ```\n\n### Output File\n```\np wcnf 7 6 20\n1 -1 -2 3 4 5 0\n1 -3 -4 -5 0\n1 -6 0\n20 1 6 0\n20 2 0\n20 -3 -6 -7 0\n```\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fleungll%2Fpm-coding","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fleungll%2Fpm-coding","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fleungll%2Fpm-coding/lists"}