I have the following code:
1{p(1..10)}10.
:- p(I*2).
and it shows 31 answers, But I just need the max subset p(1) p(3) p(5) p(7) p(9).
How can I do it?
clingo return the max subset
264 Views Asked by Reason At
1
There are 1 best solutions below
Related Questions in ANSWER-SET-PROGRAMMING
- Error trying to generate Makefile for glBinding
- Eclipse Makefile: Make Variables are skipped
- Errors in makefile for qemu 0.14.1 in ubuntu 15.04 64 bit
- C++ Struct prototyping in separate header file
- Reuse jquery plugin without conflict
- How do I a conditional build through a make file?
- basic makefile ifeq how to
- (automake, libtool) build fails in automake when using same source file name in different directory
- Makefile pattern rules differences
- Errors while trying to run make on source code
Related Questions in CLINGO
- Error trying to generate Makefile for glBinding
- Eclipse Makefile: Make Variables are skipped
- Errors in makefile for qemu 0.14.1 in ubuntu 15.04 64 bit
- C++ Struct prototyping in separate header file
- Reuse jquery plugin without conflict
- How do I a conditional build through a make file?
- basic makefile ifeq how to
- (automake, libtool) build fails in automake when using same source file name in different directory
- Makefile pattern rules differences
- Errors while trying to run make on source code
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular # Hahtags
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
You are searching for an optimization. Easiest fix would be adding
resulting in
Don't worry about the negative score, clingo converts
#maximizeinto#minimize, therefore the negation. So what does#maximize{I:p(I)}.do? In general you want to maximize overIfor allp(I), which in this case is the sum ofI. Just counting would beresulting in