ravensat 1.0.9 → 1.1.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 8b668d5f3c3a44e355f1cab471199b0ab4124a504e38081c40b33348b8d1611d
-  data.tar.gz: 9c622647b2a9bc34881178cbd546f332f882a07e8b2242c3c37e3f94e437c2c1
+  metadata.gz: e2be04a5683be973ab9a882393a2ac6ed25d40d19899d3222841a0727e7a9ccc
+  data.tar.gz: 6674ab1b25282eb389672ed0e53857272fe048a0d08c6ec0d632c56ff126bbc9
 SHA512:
-  metadata.gz: 986c50547e5026650eef971aaa706a8d7515e5a6e861d3c027ce6b273b56094448c62fcd796b6f9dd2734d96f10cde2e5ba7bd0ac58ac389e16ad5404a0cd623
-  data.tar.gz: 3a29d33a8761a862c8bf04ce69aa8b64c8241a64f867c1ee337eedf311eeafad2ffee899db6e1f3c544a0cec5df17ce554b24b16c125ca1181b1cb7b260ad099
+  metadata.gz: fb557522b6b17eeaec4171a76169887b1392a9d321ed6e723911df41d6caddcc00dd31e376e340c78cc71dd5a29267a0c4050a6f1c91bba21dbb4d4aafcebb61
+  data.tar.gz: d046a5e639fdb03a2c372b96cc992ef6c8ef6b1c3a73bf0c26f460a82acfce84495bc20ce4661cef99a858e7dc5ed5b6a373bb1788d78cb737c0c8eb7e20e273

data/lib/ravensat/ast/and_node.rb

@@ -11,5 +11,9 @@ module Ravensat
     def to_dimacs
       " 0\n"
     end
+
+    def eval
+      @children.map(&:eval).reduce(:&)
+    end
   end
 end

data/lib/ravensat/ast/node.rb

@@ -87,6 +87,9 @@ module Ravensat
       @children.map(&:cnf?).reduce(:&)
     end
 
+    def eval
+    end
+
     def vars
       self.select{|node| node.is_a? VarNode}.uniq
     end

data/lib/ravensat/ast/not_node.rb

@@ -7,5 +7,9 @@ module Ravensat
     def to_dimacs
       "-"
     end
+
+    def eval
+      @children.map(&:eval).first ^ true
+    end
   end
 end

data/lib/ravensat/ast/or_node.rb

@@ -16,5 +16,9 @@ module Ravensat
     def to_dimacs
       " "
     end
+
+    def eval
+      @children.map(&:eval).reduce(:|)
+    end
   end
 end

data/lib/ravensat/ast/var_node.rb

@@ -22,5 +22,9 @@ module Ravensat
     def to_dimacs
       @dimacs_name
     end
+
+    def eval
+      @value
+    end
   end
 end

data/lib/ravensat/claw.rb

@@ -1,6 +1,13 @@
 module Ravensat
   module Claw
-    def self.alo(bool_vars)
+    def self.at_most_one(bool_vars)
+      return Ravensat::NilNode.new if bool_vars.size == 1
+      bool_vars.combination(2).map do |e|
+        e.map(&:~@).reduce(:|)
+      end.reduce(:&)
+    end
+
+    def self.at_least_one(bool_vars)
       return Ravensat::NilNode.new if bool_vars.size == 1
       bool_vars.reduce(:|)
     end
@@ -15,19 +22,13 @@ module Ravensat
     def self.at_least_k(bool_vars, k)
       return Ravensat::NilNode.new if bool_vars.size == 1
       bool_vars.combination(k-1).map do |e|
-        alo(bool_vars - e)
+        at_least_one(bool_vars - e)
       end.reduce(:&)
     end
 
-    def self.pairwise_amo(bool_vars)
-      return Ravensat::NilNode.new if bool_vars.size == 1
-      bool_vars.combination(2).map do |e|
-        e.map(&:~@).reduce(:|)
-      end.reduce(:&)
-    end
 
     # NOTE: Klieber, W. and Kwon, G.: Efficient CNF Encoding for Selecting 1 from N Objects (2007).
-    def self.commander_amo(bool_vars)
+    def self.commander_at_most_one(bool_vars)
       return Ravensat::NilNode.new if bool_vars.size == 1
       # XXX: Operator unknown if bool_vars.size is very small.
       m = bool_vars.size / 2
@@ -36,16 +37,48 @@ module Ravensat
       bool_vars.each_slice(2) do |g|
         c = Ravensat::VarNode.new
         subset = g << ~c
-        formula &= pairwise_amo(subset)
-        formula &= alo(subset)
+        formula &= at_most_one(subset)
+        formula &= at_least_one(subset)
         commander_variables << c
       end
 
       if m < 6
-        formula &= pairwise_amo(commander_variables)
+        formula &= at_most_one(commander_variables)
       else
-        formula &= commander_amo(commander_variables)
+        formula &= commander_at_most_one(commander_variables)
+      end
+    end
+
+    def self.commander_at_most_k(bool_vars, k)
+      return Ravensat::NilNode.new if bool_vars.size == 1
+      group_size = k + 2
+      commander_variables = []
+      formula = Ravensat::InitialNode.new
+
+      bool_vars.each_slice(group_size) do |g|
+        cmds = Array.new(k){Ravensat::VarNode.new}
+        subset = g + cmds.map(&:~)
+        formula &= at_most_k(subset, k)
+        formula &= at_least_k(subset, k)
+        cmds.each_cons(2) do |e1, e2|
+          formula &= ~e1 | e2
+        end
+        commander_variables += cmds
       end
+
+      formula &= at_most_k(commander_variables, k)
+    end
+
+    def self.exactly_one(bool_vars)
+      formula = Ravensat::InitialNode.new
+      formula &= commander_at_most_one(bool_vars)
+      formula &= at_least_one(bool_vars)
+    end
+
+    def self.exactly_k(bool_vars, k)
+      formula = Ravensat::InitialNode.new
+      formula &= commander_at_most_k(bool_vars, k)
+      formula &= at_least_k(bool_vars, k)
     end
 
     def self.all_different(*int_vars)
@@ -57,7 +90,5 @@ module Ravensat
     def self.all_only_one(*int_vars)
       int_vars.map(&:only_one).reduce(:&)
     end
-
-    # alias :amo :pairwise_amo
   end
 end

data/lib/ravensat/version.rb

@@ -1,5 +1,5 @@
 # frozen_string_literal: true
 
 module Ravensat
-  VERSION = "1.0.9"
+  VERSION = "1.1.0"
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: ravensat
 version: !ruby/object:Gem::Version
-  version: 1.0.9
+  version: 1.1.0
 platform: ruby
 authors:
 - rikuto matsuda
 autorequire:
 bindir: exe
 cert_chain: []
-date: 2022-08-25 00:00:00.000000000 Z
+date: 2022-11-07 00:00:00.000000000 Z
 dependencies: []
 description:
 email: