Optimization 努兹:看到已经放弃的规则了吗?
有没有可能检查一下,NuZ放弃了问题的哪种软断言 让我们看看这个例子:Optimization 努兹:看到已经放弃的规则了吗?,optimization,z3,Optimization,Z3,有没有可能检查一下,NuZ放弃了问题的哪种软断言 让我们看看这个例子: (declare-fun x () Int) (declare-fun y () Int) (assert-soft (=> (= x 2) (= y 1)) :weight 1) (assert-soft (=> (= x 3) (= y 2)) :weight 1) (assert-soft (=> (= x 4) (= y 2)) :weight 1) (assert-soft (=> (=
(declare-fun x () Int)
(declare-fun y () Int)
(assert-soft (=> (= x 2) (= y 1)) :weight 1)
(assert-soft (=> (= x 3) (= y 2)) :weight 1)
(assert-soft (=> (= x 4) (= y 2)) :weight 1)
(assert-soft (=> (= x 4) (= y 3)) :weight 1)
;(assert (= x 1))
;(assert (= x 2))
;(assert (= x 3))
(assert (= x 4))
;(assert (not (= y 3)))
(check-sat)
(get-model)
结果如下所示:
|-> 1
sat
(model
(define-fun y () Int
3)
(define-fun x () Int
4)
)
费用是1美元。但哪些规则已经被放弃了呢
当然,在这个简单的例子中,可以很容易地推断出这一点。在一个更复杂的场景中,这可能有点困难,甚至是不可能的。一层间接层起到了作用:
(declare-fun A1 () Bool)
(declare-fun A2 () Bool)
(declare-fun B1 () Bool)
(declare-fun x () Int)
(declare-fun y () Int)
(assert-soft (= A1 true) :weight 1)
(assert-soft (= A2 true) :weight 2)
(assert-soft (= B1 true) :weight 2)
(assert (=> A1 (=> (and (<= 2 x) (<= x 7)) (= y 1))))
(assert (=> A2 (=> (and (<= 3 x) (<= x 6)) (= y 2))))
(assert (=> B1 (=> (and (<= 4 x) (<= x 9)) (= y 3))))
(assert (= x 4))
(check-sat)
(get-model)
对于A1、A2和B1,您确切地知道哪些规则被使用,哪些规则被放弃
|-> 3
sat
(model
(define-fun A1 () Bool false)
(define-fun y () Int 2)
(define-fun A2 () Bool true)
(define-fun B1 () Bool false)
(define-fun x () Int 4)
)