O'Reilly logo

Handbook of Automated Reasoning by Andrei Voronkov, Alan J.A. Robinson

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

2.15. Example

Consider the trivial bounds where LB(( D , W si353_e ),FS) is the empty set and UB(( D , W si354_e ),FS) is the whole language, a default theory D si355_e = {:p/p}, W = {¬p} and a set FS = {not(¬p)}. Clearly, the second condition for conflict does not hold: FS covers negations of every justification in D si356_e , not(¬p) ¬ FS but ¬p

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required