A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Logics for 'generally' were introduced for handling, by non-standard generalized quantifiers, assertions with vague notions (important issues in Logic and in Artificial Intelligence). Filter logic is intended to address (some versions) of 'most'. We show that filter logic can be faithfully embedded into a first-order theory of compatible predicates. We also use representative predicates to eliminate the generalized quantifier. These devices permit using classical first-order methods to reasonfatcat:rgdjvprqcbe5fbkqe2pxbe6vaq