A graph [Formula: see text] is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function defined on vertices. Then text]well-covered weight. For every text], set functions such text]-well-covered vector space, denoted as WCW(G). Deciding whether an input co-NP-complete. Therefore, finding WCW(G) co-NP-hard. generating subgraph induced complete b...

We present a system for textual inference (the task of inferring whether a sentence follows from another text) that uses learning and a logical-formula semantic representation of the text. More precisely, our system begins by parsing and then transforming sentences into a logical formula-like representation similar to the one used by (Harabagiu et al., 2000). An abductive theorem prover then tr...