id stringlengths 25 48 | prompt stringlengths 398 17.4k | cond stringclasses 5
values | gold stringclasses 3
values | rec_id stringclasses 264
values | axis stringclasses 6
values | difficulty stringclasses 21
values |
|---|---|---|---|---|---|---|
hv3trn-cnf_n8-i0-none::none | Answer using ordinary commonsense reasoning about the rules below.
Rules:
Proposition v3 is true if proposition w3 is not true. Proposition bad is true if proposition w4 is true and proposition v6 is true and proposition w1 is true and proposition bad is not true. Proposition bad is true if proposition w1 is true and ... | none | null | hv3trn-cnf_n8-i0 | cnf | cnf_n8 |
hv3trn-cnf_n8-i0-closed_world::closed_world | Use the CLOSED-WORLD ASSUMPTION with NEGATION-AS-FAILURE, interpreted operationally as in Prolog-style reasoning. A positive goal is 'true' if it can be derived by a terminating proof from the rules. A positive goal is 'false' if every attempted proof of it finitely fails. The default-negated goal not G is 'true' if th... | closed_world | C | hv3trn-cnf_n8-i0 | cnf | cnf_n8 |
hv3trn-cnf_n8-i0-cred::cred | Use STABLE-MODEL, also called ANSWER-SET, semantics with CREDULOUS, also called BRAVE, reasoning. An answer set is a self-consistent set of atoms that is closed under the program rules and contains exactly the atoms justified by those rules under the assumptions made in that same set. Equivalently, after evaluating eac... | cred | A | hv3trn-cnf_n8-i0 | cnf | cnf_n8 |
hv3trn-cnf_n8-i0-skept::skept | Use STABLE-MODEL, also called ANSWER-SET, semantics with SKEPTICAL, also called CAUTIOUS, reasoning. Consider all answer sets of the program. Each answer set is a self-consistent scenario that is closed under the rules and contains exactly the atoms justified by those rules under its own assumptions about default negat... | skept | B | hv3trn-cnf_n8-i0 | cnf | cnf_n8 |
hv3trn-cnf_n8-i0-wfs::wfs | Use WELL-FOUNDED semantics, with three truth values: 'true', 'false', and 'undefined'. A statement is 'true' if it has founded support: that is, it follows from rules whose positive conditions are 'true' and whose default-negated conditions are 'false', with the justification ultimately grounded rather than relying onl... | wfs | C | hv3trn-cnf_n8-i0 | cnf | cnf_n8 |
hv3trn-cnf_n8-i1-none::none | Answer using ordinary commonsense reasoning about the rules below.
Rules:
Proposition bad is true if proposition v1 is true and proposition v3 is true and proposition v2 is true and proposition bad is not true. Proposition v7 is true if proposition w7 is not true. Proposition w5 is true if proposition v5 is not true. ... | none | null | hv3trn-cnf_n8-i1 | cnf | cnf_n8 |
hv3trn-cnf_n8-i1-closed_world::closed_world | Use the CLOSED-WORLD ASSUMPTION with NEGATION-AS-FAILURE, interpreted operationally as in Prolog-style reasoning. A positive goal is 'true' if it can be derived by a terminating proof from the rules. A positive goal is 'false' if every attempted proof of it finitely fails. The default-negated goal not G is 'true' if th... | closed_world | C | hv3trn-cnf_n8-i1 | cnf | cnf_n8 |
hv3trn-cnf_n8-i1-cred::cred | Use STABLE-MODEL, also called ANSWER-SET, semantics with CREDULOUS, also called BRAVE, reasoning. An answer set is a self-consistent set of atoms that is closed under the program rules and contains exactly the atoms justified by those rules under the assumptions made in that same set. Equivalently, after evaluating eac... | cred | B | hv3trn-cnf_n8-i1 | cnf | cnf_n8 |
hv3trn-cnf_n8-i1-skept::skept | Use STABLE-MODEL, also called ANSWER-SET, semantics with SKEPTICAL, also called CAUTIOUS, reasoning. Consider all answer sets of the program. Each answer set is a self-consistent scenario that is closed under the rules and contains exactly the atoms justified by those rules under its own assumptions about default negat... | skept | B | hv3trn-cnf_n8-i1 | cnf | cnf_n8 |
hv3trn-cnf_n8-i1-wfs::wfs | Use WELL-FOUNDED semantics, with three truth values: 'true', 'false', and 'undefined'. A statement is 'true' if it has founded support: that is, it follows from rules whose positive conditions are 'true' and whose default-negated conditions are 'false', with the justification ultimately grounded rather than relying onl... | wfs | C | hv3trn-cnf_n8-i1 | cnf | cnf_n8 |
hv3trn-cnf_n8-i2-none::none | Answer using ordinary commonsense reasoning about the rules below.
Rules:
Proposition v7 is true if proposition w7 is not true. Proposition etrue is true. Proposition bad is true if proposition w3 is true and proposition v6 is true and proposition w2 is true and proposition bad is not true. Proposition bad is true if ... | none | null | hv3trn-cnf_n8-i2 | cnf | cnf_n8 |
hv3trn-cnf_n8-i2-closed_world::closed_world | Use the CLOSED-WORLD ASSUMPTION with NEGATION-AS-FAILURE, interpreted operationally as in Prolog-style reasoning. A positive goal is 'true' if it can be derived by a terminating proof from the rules. A positive goal is 'false' if every attempted proof of it finitely fails. The default-negated goal not G is 'true' if th... | closed_world | C | hv3trn-cnf_n8-i2 | cnf | cnf_n8 |
hv3trn-cnf_n8-i2-cred::cred | Use STABLE-MODEL, also called ANSWER-SET, semantics with CREDULOUS, also called BRAVE, reasoning. An answer set is a self-consistent set of atoms that is closed under the program rules and contains exactly the atoms justified by those rules under the assumptions made in that same set. Equivalently, after evaluating eac... | cred | A | hv3trn-cnf_n8-i2 | cnf | cnf_n8 |
hv3trn-cnf_n8-i2-skept::skept | Use STABLE-MODEL, also called ANSWER-SET, semantics with SKEPTICAL, also called CAUTIOUS, reasoning. Consider all answer sets of the program. Each answer set is a self-consistent scenario that is closed under the rules and contains exactly the atoms justified by those rules under its own assumptions about default negat... | skept | A | hv3trn-cnf_n8-i2 | cnf | cnf_n8 |
hv3trn-cnf_n8-i2-wfs::wfs | Use WELL-FOUNDED semantics, with three truth values: 'true', 'false', and 'undefined'. A statement is 'true' if it has founded support: that is, it follows from rules whose positive conditions are 'true' and whose default-negated conditions are 'false', with the justification ultimately grounded rather than relying onl... | wfs | C | hv3trn-cnf_n8-i2 | cnf | cnf_n8 |
hv3trn-cnf_n8-i3-none::none | Answer using ordinary commonsense reasoning about the rules below.
Rules:
Proposition w6 is true if proposition v6 is not true. Proposition bad is true if proposition w0 is true and proposition w3 is true and proposition v5 is true and proposition bad is not true. Proposition bad is true if proposition w7 is true and ... | none | null | hv3trn-cnf_n8-i3 | cnf | cnf_n8 |
hv3trn-cnf_n8-i3-closed_world::closed_world | Use the CLOSED-WORLD ASSUMPTION with NEGATION-AS-FAILURE, interpreted operationally as in Prolog-style reasoning. A positive goal is 'true' if it can be derived by a terminating proof from the rules. A positive goal is 'false' if every attempted proof of it finitely fails. The default-negated goal not G is 'true' if th... | closed_world | C | hv3trn-cnf_n8-i3 | cnf | cnf_n8 |
hv3trn-cnf_n8-i3-cred::cred | Use STABLE-MODEL, also called ANSWER-SET, semantics with CREDULOUS, also called BRAVE, reasoning. An answer set is a self-consistent set of atoms that is closed under the program rules and contains exactly the atoms justified by those rules under the assumptions made in that same set. Equivalently, after evaluating eac... | cred | B | hv3trn-cnf_n8-i3 | cnf | cnf_n8 |
hv3trn-cnf_n8-i3-skept::skept | Use STABLE-MODEL, also called ANSWER-SET, semantics with SKEPTICAL, also called CAUTIOUS, reasoning. Consider all answer sets of the program. Each answer set is a self-consistent scenario that is closed under the rules and contains exactly the atoms justified by those rules under its own assumptions about default negat... | skept | A | hv3trn-cnf_n8-i3 | cnf | cnf_n8 |
hv3trn-cnf_n8-i3-wfs::wfs | Use WELL-FOUNDED semantics, with three truth values: 'true', 'false', and 'undefined'. A statement is 'true' if it has founded support: that is, it follows from rules whose positive conditions are 'true' and whose default-negated conditions are 'false', with the justification ultimately grounded rather than relying onl... | wfs | C | hv3trn-cnf_n8-i3 | cnf | cnf_n8 |
hv3trn-cnf_n8-i4-none::none | Answer using ordinary commonsense reasoning about the rules below.
Rules:
Proposition bad is true if proposition w1 is true and proposition w3 is true and proposition w2 is true and proposition bad is not true. Proposition bad is true if proposition v5 is true and proposition v1 is true and proposition w6 is true and ... | none | null | hv3trn-cnf_n8-i4 | cnf | cnf_n8 |
hv3trn-cnf_n8-i4-closed_world::closed_world | Use the CLOSED-WORLD ASSUMPTION with NEGATION-AS-FAILURE, interpreted operationally as in Prolog-style reasoning. A positive goal is 'true' if it can be derived by a terminating proof from the rules. A positive goal is 'false' if every attempted proof of it finitely fails. The default-negated goal not G is 'true' if th... | closed_world | C | hv3trn-cnf_n8-i4 | cnf | cnf_n8 |
hv3trn-cnf_n8-i4-cred::cred | Use STABLE-MODEL, also called ANSWER-SET, semantics with CREDULOUS, also called BRAVE, reasoning. An answer set is a self-consistent set of atoms that is closed under the program rules and contains exactly the atoms justified by those rules under the assumptions made in that same set. Equivalently, after evaluating eac... | cred | B | hv3trn-cnf_n8-i4 | cnf | cnf_n8 |
hv3trn-cnf_n8-i4-skept::skept | Use STABLE-MODEL, also called ANSWER-SET, semantics with SKEPTICAL, also called CAUTIOUS, reasoning. Consider all answer sets of the program. Each answer set is a self-consistent scenario that is closed under the rules and contains exactly the atoms justified by those rules under its own assumptions about default negat... | skept | B | hv3trn-cnf_n8-i4 | cnf | cnf_n8 |
hv3trn-cnf_n8-i4-wfs::wfs | Use WELL-FOUNDED semantics, with three truth values: 'true', 'false', and 'undefined'. A statement is 'true' if it has founded support: that is, it follows from rules whose positive conditions are 'true' and whose default-negated conditions are 'false', with the justification ultimately grounded rather than relying onl... | wfs | C | hv3trn-cnf_n8-i4 | cnf | cnf_n8 |
hv3trn-cnf_n8-i5-none::none | Answer using ordinary commonsense reasoning about the rules below.
Rules:
Proposition q is true if proposition t0 is true and proposition wide is true. Proposition w1 is true if proposition v1 is not true. Proposition bad is true if proposition w5 is true and proposition w0 is true and proposition w3 is true and propo... | none | null | hv3trn-cnf_n8-i5 | cnf | cnf_n8 |
hv3trn-cnf_n8-i5-closed_world::closed_world | Use the CLOSED-WORLD ASSUMPTION with NEGATION-AS-FAILURE, interpreted operationally as in Prolog-style reasoning. A positive goal is 'true' if it can be derived by a terminating proof from the rules. A positive goal is 'false' if every attempted proof of it finitely fails. The default-negated goal not G is 'true' if th... | closed_world | C | hv3trn-cnf_n8-i5 | cnf | cnf_n8 |
hv3trn-cnf_n8-i5-cred::cred | Use STABLE-MODEL, also called ANSWER-SET, semantics with CREDULOUS, also called BRAVE, reasoning. An answer set is a self-consistent set of atoms that is closed under the program rules and contains exactly the atoms justified by those rules under the assumptions made in that same set. Equivalently, after evaluating eac... | cred | B | hv3trn-cnf_n8-i5 | cnf | cnf_n8 |
hv3trn-cnf_n8-i5-skept::skept | Use STABLE-MODEL, also called ANSWER-SET, semantics with SKEPTICAL, also called CAUTIOUS, reasoning. Consider all answer sets of the program. Each answer set is a self-consistent scenario that is closed under the rules and contains exactly the atoms justified by those rules under its own assumptions about default negat... | skept | A | hv3trn-cnf_n8-i5 | cnf | cnf_n8 |
hv3trn-cnf_n8-i5-wfs::wfs | Use WELL-FOUNDED semantics, with three truth values: 'true', 'false', and 'undefined'. A statement is 'true' if it has founded support: that is, it follows from rules whose positive conditions are 'true' and whose default-negated conditions are 'false', with the justification ultimately grounded rather than relying onl... | wfs | C | hv3trn-cnf_n8-i5 | cnf | cnf_n8 |
hv3trn-cnf_n8-i6-none::none | Answer using ordinary commonsense reasoning about the rules below.
Rules:
Proposition bad is true if proposition v1 is true and proposition w5 is true and proposition v3 is true and proposition bad is not true. Proposition s3 is true. Proposition w6 is true if proposition v6 is not true. Proposition v4 is true if prop... | none | null | hv3trn-cnf_n8-i6 | cnf | cnf_n8 |
hv3trn-cnf_n8-i6-closed_world::closed_world | Use the CLOSED-WORLD ASSUMPTION with NEGATION-AS-FAILURE, interpreted operationally as in Prolog-style reasoning. A positive goal is 'true' if it can be derived by a terminating proof from the rules. A positive goal is 'false' if every attempted proof of it finitely fails. The default-negated goal not G is 'true' if th... | closed_world | C | hv3trn-cnf_n8-i6 | cnf | cnf_n8 |
hv3trn-cnf_n8-i6-cred::cred | Use STABLE-MODEL, also called ANSWER-SET, semantics with CREDULOUS, also called BRAVE, reasoning. An answer set is a self-consistent set of atoms that is closed under the program rules and contains exactly the atoms justified by those rules under the assumptions made in that same set. Equivalently, after evaluating eac... | cred | B | hv3trn-cnf_n8-i6 | cnf | cnf_n8 |
hv3trn-cnf_n8-i6-skept::skept | Use STABLE-MODEL, also called ANSWER-SET, semantics with SKEPTICAL, also called CAUTIOUS, reasoning. Consider all answer sets of the program. Each answer set is a self-consistent scenario that is closed under the rules and contains exactly the atoms justified by those rules under its own assumptions about default negat... | skept | A | hv3trn-cnf_n8-i6 | cnf | cnf_n8 |
hv3trn-cnf_n8-i6-wfs::wfs | Use WELL-FOUNDED semantics, with three truth values: 'true', 'false', and 'undefined'. A statement is 'true' if it has founded support: that is, it follows from rules whose positive conditions are 'true' and whose default-negated conditions are 'false', with the justification ultimately grounded rather than relying onl... | wfs | C | hv3trn-cnf_n8-i6 | cnf | cnf_n8 |
hv3trn-cnf_n8-i7-none::none | Answer using ordinary commonsense reasoning about the rules below.
Rules:
Proposition w1 is true if proposition v1 is not true. Proposition bad is true if proposition w2 is true and proposition w5 is true and proposition w4 is true and proposition bad is not true. Proposition t2 is true if proposition t3 is true. Prop... | none | null | hv3trn-cnf_n8-i7 | cnf | cnf_n8 |
hv3trn-cnf_n8-i7-closed_world::closed_world | Use the CLOSED-WORLD ASSUMPTION with NEGATION-AS-FAILURE, interpreted operationally as in Prolog-style reasoning. A positive goal is 'true' if it can be derived by a terminating proof from the rules. A positive goal is 'false' if every attempted proof of it finitely fails. The default-negated goal not G is 'true' if th... | closed_world | C | hv3trn-cnf_n8-i7 | cnf | cnf_n8 |
hv3trn-cnf_n8-i7-cred::cred | Use STABLE-MODEL, also called ANSWER-SET, semantics with CREDULOUS, also called BRAVE, reasoning. An answer set is a self-consistent set of atoms that is closed under the program rules and contains exactly the atoms justified by those rules under the assumptions made in that same set. Equivalently, after evaluating eac... | cred | A | hv3trn-cnf_n8-i7 | cnf | cnf_n8 |
hv3trn-cnf_n8-i7-skept::skept | Use STABLE-MODEL, also called ANSWER-SET, semantics with SKEPTICAL, also called CAUTIOUS, reasoning. Consider all answer sets of the program. Each answer set is a self-consistent scenario that is closed under the rules and contains exactly the atoms justified by those rules under its own assumptions about default negat... | skept | A | hv3trn-cnf_n8-i7 | cnf | cnf_n8 |
hv3trn-cnf_n8-i7-wfs::wfs | Use WELL-FOUNDED semantics, with three truth values: 'true', 'false', and 'undefined'. A statement is 'true' if it has founded support: that is, it follows from rules whose positive conditions are 'true' and whose default-negated conditions are 'false', with the justification ultimately grounded rather than relying onl... | wfs | C | hv3trn-cnf_n8-i7 | cnf | cnf_n8 |
hv3trn-cnf_n8-i8-none::none | Answer using ordinary commonsense reasoning about the rules below.
Rules:
Proposition bad is true if proposition v7 is true and proposition v2 is true and proposition w5 is true and proposition bad is not true. Proposition bad is true if proposition v5 is true and proposition v6 is true and proposition w4 is true and ... | none | null | hv3trn-cnf_n8-i8 | cnf | cnf_n8 |
hv3trn-cnf_n8-i8-closed_world::closed_world | Use the CLOSED-WORLD ASSUMPTION with NEGATION-AS-FAILURE, interpreted operationally as in Prolog-style reasoning. A positive goal is 'true' if it can be derived by a terminating proof from the rules. A positive goal is 'false' if every attempted proof of it finitely fails. The default-negated goal not G is 'true' if th... | closed_world | C | hv3trn-cnf_n8-i8 | cnf | cnf_n8 |
hv3trn-cnf_n8-i8-cred::cred | Use STABLE-MODEL, also called ANSWER-SET, semantics with CREDULOUS, also called BRAVE, reasoning. An answer set is a self-consistent set of atoms that is closed under the program rules and contains exactly the atoms justified by those rules under the assumptions made in that same set. Equivalently, after evaluating eac... | cred | A | hv3trn-cnf_n8-i8 | cnf | cnf_n8 |
hv3trn-cnf_n8-i8-skept::skept | Use STABLE-MODEL, also called ANSWER-SET, semantics with SKEPTICAL, also called CAUTIOUS, reasoning. Consider all answer sets of the program. Each answer set is a self-consistent scenario that is closed under the rules and contains exactly the atoms justified by those rules under its own assumptions about default negat... | skept | B | hv3trn-cnf_n8-i8 | cnf | cnf_n8 |
hv3trn-cnf_n8-i8-wfs::wfs | Use WELL-FOUNDED semantics, with three truth values: 'true', 'false', and 'undefined'. A statement is 'true' if it has founded support: that is, it follows from rules whose positive conditions are 'true' and whose default-negated conditions are 'false', with the justification ultimately grounded rather than relying onl... | wfs | C | hv3trn-cnf_n8-i8 | cnf | cnf_n8 |
hv3trn-cnf_n8-i9-none::none | Answer using ordinary commonsense reasoning about the rules below.
Rules:
Proposition bad is true if proposition v6 is true and proposition w4 is true and proposition v3 is true and proposition bad is not true. Proposition t1 is true if proposition t2 is true. Proposition bad is true if proposition v2 is true and prop... | none | null | hv3trn-cnf_n8-i9 | cnf | cnf_n8 |
hv3trn-cnf_n8-i9-closed_world::closed_world | Use the CLOSED-WORLD ASSUMPTION with NEGATION-AS-FAILURE, interpreted operationally as in Prolog-style reasoning. A positive goal is 'true' if it can be derived by a terminating proof from the rules. A positive goal is 'false' if every attempted proof of it finitely fails. The default-negated goal not G is 'true' if th... | closed_world | C | hv3trn-cnf_n8-i9 | cnf | cnf_n8 |
hv3trn-cnf_n8-i9-cred::cred | Use STABLE-MODEL, also called ANSWER-SET, semantics with CREDULOUS, also called BRAVE, reasoning. An answer set is a self-consistent set of atoms that is closed under the program rules and contains exactly the atoms justified by those rules under the assumptions made in that same set. Equivalently, after evaluating eac... | cred | B | hv3trn-cnf_n8-i9 | cnf | cnf_n8 |
hv3trn-cnf_n8-i9-skept::skept | Use STABLE-MODEL, also called ANSWER-SET, semantics with SKEPTICAL, also called CAUTIOUS, reasoning. Consider all answer sets of the program. Each answer set is a self-consistent scenario that is closed under the rules and contains exactly the atoms justified by those rules under its own assumptions about default negat... | skept | A | hv3trn-cnf_n8-i9 | cnf | cnf_n8 |
hv3trn-cnf_n8-i9-wfs::wfs | Use WELL-FOUNDED semantics, with three truth values: 'true', 'false', and 'undefined'. A statement is 'true' if it has founded support: that is, it follows from rules whose positive conditions are 'true' and whose default-negated conditions are 'false', with the justification ultimately grounded rather than relying onl... | wfs | C | hv3trn-cnf_n8-i9 | cnf | cnf_n8 |
hv3trn-cnf_n8-i10-none::none | Answer using ordinary commonsense reasoning about the rules below.
Rules:
Proposition v2 is true if proposition w2 is not true. Proposition bad is true if proposition v3 is true and proposition w4 is true and proposition w7 is true and proposition bad is not true. Proposition w2 is true if proposition v2 is not true. ... | none | null | hv3trn-cnf_n8-i10 | cnf | cnf_n8 |
hv3trn-cnf_n8-i10-closed_world::closed_world | Use the CLOSED-WORLD ASSUMPTION with NEGATION-AS-FAILURE, interpreted operationally as in Prolog-style reasoning. A positive goal is 'true' if it can be derived by a terminating proof from the rules. A positive goal is 'false' if every attempted proof of it finitely fails. The default-negated goal not G is 'true' if th... | closed_world | C | hv3trn-cnf_n8-i10 | cnf | cnf_n8 |
hv3trn-cnf_n8-i10-cred::cred | Use STABLE-MODEL, also called ANSWER-SET, semantics with CREDULOUS, also called BRAVE, reasoning. An answer set is a self-consistent set of atoms that is closed under the program rules and contains exactly the atoms justified by those rules under the assumptions made in that same set. Equivalently, after evaluating eac... | cred | B | hv3trn-cnf_n8-i10 | cnf | cnf_n8 |
hv3trn-cnf_n8-i10-skept::skept | Use STABLE-MODEL, also called ANSWER-SET, semantics with SKEPTICAL, also called CAUTIOUS, reasoning. Consider all answer sets of the program. Each answer set is a self-consistent scenario that is closed under the rules and contains exactly the atoms justified by those rules under its own assumptions about default negat... | skept | A | hv3trn-cnf_n8-i10 | cnf | cnf_n8 |
hv3trn-cnf_n8-i10-wfs::wfs | Use WELL-FOUNDED semantics, with three truth values: 'true', 'false', and 'undefined'. A statement is 'true' if it has founded support: that is, it follows from rules whose positive conditions are 'true' and whose default-negated conditions are 'false', with the justification ultimately grounded rather than relying onl... | wfs | C | hv3trn-cnf_n8-i10 | cnf | cnf_n8 |
hv3trn-cnf_n8-i11-none::none | Answer using ordinary commonsense reasoning about the rules below.
Rules:
Proposition w0 is true if proposition v0 is not true. Proposition s0 is true. Proposition bad is true if proposition v1 is true and proposition v3 is true and proposition v5 is true and proposition bad is not true. Proposition bad is true if pro... | none | null | hv3trn-cnf_n8-i11 | cnf | cnf_n8 |
hv3trn-cnf_n8-i11-closed_world::closed_world | Use the CLOSED-WORLD ASSUMPTION with NEGATION-AS-FAILURE, interpreted operationally as in Prolog-style reasoning. A positive goal is 'true' if it can be derived by a terminating proof from the rules. A positive goal is 'false' if every attempted proof of it finitely fails. The default-negated goal not G is 'true' if th... | closed_world | C | hv3trn-cnf_n8-i11 | cnf | cnf_n8 |
hv3trn-cnf_n8-i11-cred::cred | Use STABLE-MODEL, also called ANSWER-SET, semantics with CREDULOUS, also called BRAVE, reasoning. An answer set is a self-consistent set of atoms that is closed under the program rules and contains exactly the atoms justified by those rules under the assumptions made in that same set. Equivalently, after evaluating eac... | cred | B | hv3trn-cnf_n8-i11 | cnf | cnf_n8 |
hv3trn-cnf_n8-i11-skept::skept | Use STABLE-MODEL, also called ANSWER-SET, semantics with SKEPTICAL, also called CAUTIOUS, reasoning. Consider all answer sets of the program. Each answer set is a self-consistent scenario that is closed under the rules and contains exactly the atoms justified by those rules under its own assumptions about default negat... | skept | B | hv3trn-cnf_n8-i11 | cnf | cnf_n8 |
hv3trn-cnf_n8-i11-wfs::wfs | Use WELL-FOUNDED semantics, with three truth values: 'true', 'false', and 'undefined'. A statement is 'true' if it has founded support: that is, it follows from rules whose positive conditions are 'true' and whose default-negated conditions are 'false', with the justification ultimately grounded rather than relying onl... | wfs | C | hv3trn-cnf_n8-i11 | cnf | cnf_n8 |
hv3trn-cnf_n8-i12-none::none | Answer using ordinary commonsense reasoning about the rules below.
Rules:
Proposition bad is true if proposition w5 is true and proposition w2 is true and proposition w4 is true and proposition bad is not true. Proposition v3 is true if proposition w3 is not true. Proposition bad is true if proposition w2 is true and ... | none | null | hv3trn-cnf_n8-i12 | cnf | cnf_n8 |
hv3trn-cnf_n8-i12-closed_world::closed_world | Use the CLOSED-WORLD ASSUMPTION with NEGATION-AS-FAILURE, interpreted operationally as in Prolog-style reasoning. A positive goal is 'true' if it can be derived by a terminating proof from the rules. A positive goal is 'false' if every attempted proof of it finitely fails. The default-negated goal not G is 'true' if th... | closed_world | C | hv3trn-cnf_n8-i12 | cnf | cnf_n8 |
hv3trn-cnf_n8-i12-cred::cred | Use STABLE-MODEL, also called ANSWER-SET, semantics with CREDULOUS, also called BRAVE, reasoning. An answer set is a self-consistent set of atoms that is closed under the program rules and contains exactly the atoms justified by those rules under the assumptions made in that same set. Equivalently, after evaluating eac... | cred | A | hv3trn-cnf_n8-i12 | cnf | cnf_n8 |
hv3trn-cnf_n8-i12-skept::skept | Use STABLE-MODEL, also called ANSWER-SET, semantics with SKEPTICAL, also called CAUTIOUS, reasoning. Consider all answer sets of the program. Each answer set is a self-consistent scenario that is closed under the rules and contains exactly the atoms justified by those rules under its own assumptions about default negat... | skept | A | hv3trn-cnf_n8-i12 | cnf | cnf_n8 |
hv3trn-cnf_n8-i12-wfs::wfs | Use WELL-FOUNDED semantics, with three truth values: 'true', 'false', and 'undefined'. A statement is 'true' if it has founded support: that is, it follows from rules whose positive conditions are 'true' and whose default-negated conditions are 'false', with the justification ultimately grounded rather than relying onl... | wfs | C | hv3trn-cnf_n8-i12 | cnf | cnf_n8 |
hv3trn-cnf_n8-i13-none::none | Answer using ordinary commonsense reasoning about the rules below.
Rules:
Proposition bad is true if proposition w4 is true and proposition v3 is true and proposition w2 is true and proposition bad is not true. Proposition bad is true if proposition w4 is true and proposition w0 is true and proposition v6 is true and ... | none | null | hv3trn-cnf_n8-i13 | cnf | cnf_n8 |
hv3trn-cnf_n8-i13-closed_world::closed_world | Use the CLOSED-WORLD ASSUMPTION with NEGATION-AS-FAILURE, interpreted operationally as in Prolog-style reasoning. A positive goal is 'true' if it can be derived by a terminating proof from the rules. A positive goal is 'false' if every attempted proof of it finitely fails. The default-negated goal not G is 'true' if th... | closed_world | C | hv3trn-cnf_n8-i13 | cnf | cnf_n8 |
hv3trn-cnf_n8-i13-cred::cred | Use STABLE-MODEL, also called ANSWER-SET, semantics with CREDULOUS, also called BRAVE, reasoning. An answer set is a self-consistent set of atoms that is closed under the program rules and contains exactly the atoms justified by those rules under the assumptions made in that same set. Equivalently, after evaluating eac... | cred | B | hv3trn-cnf_n8-i13 | cnf | cnf_n8 |
hv3trn-cnf_n8-i13-skept::skept | Use STABLE-MODEL, also called ANSWER-SET, semantics with SKEPTICAL, also called CAUTIOUS, reasoning. Consider all answer sets of the program. Each answer set is a self-consistent scenario that is closed under the rules and contains exactly the atoms justified by those rules under its own assumptions about default negat... | skept | B | hv3trn-cnf_n8-i13 | cnf | cnf_n8 |
hv3trn-cnf_n8-i13-wfs::wfs | Use WELL-FOUNDED semantics, with three truth values: 'true', 'false', and 'undefined'. A statement is 'true' if it has founded support: that is, it follows from rules whose positive conditions are 'true' and whose default-negated conditions are 'false', with the justification ultimately grounded rather than relying onl... | wfs | C | hv3trn-cnf_n8-i13 | cnf | cnf_n8 |
hv3trn-cnf_n8-i14-none::none | Answer using ordinary commonsense reasoning about the rules below.
Rules:
Proposition bad is true if proposition v0 is true and proposition w5 is true and proposition w2 is true and proposition bad is not true. Proposition bad is true if proposition v4 is true and proposition v7 is true and proposition v1 is true and ... | none | null | hv3trn-cnf_n8-i14 | cnf | cnf_n8 |
hv3trn-cnf_n8-i14-closed_world::closed_world | Use the CLOSED-WORLD ASSUMPTION with NEGATION-AS-FAILURE, interpreted operationally as in Prolog-style reasoning. A positive goal is 'true' if it can be derived by a terminating proof from the rules. A positive goal is 'false' if every attempted proof of it finitely fails. The default-negated goal not G is 'true' if th... | closed_world | C | hv3trn-cnf_n8-i14 | cnf | cnf_n8 |
hv3trn-cnf_n8-i14-cred::cred | Use STABLE-MODEL, also called ANSWER-SET, semantics with CREDULOUS, also called BRAVE, reasoning. An answer set is a self-consistent set of atoms that is closed under the program rules and contains exactly the atoms justified by those rules under the assumptions made in that same set. Equivalently, after evaluating eac... | cred | B | hv3trn-cnf_n8-i14 | cnf | cnf_n8 |
hv3trn-cnf_n8-i14-skept::skept | Use STABLE-MODEL, also called ANSWER-SET, semantics with SKEPTICAL, also called CAUTIOUS, reasoning. Consider all answer sets of the program. Each answer set is a self-consistent scenario that is closed under the rules and contains exactly the atoms justified by those rules under its own assumptions about default negat... | skept | B | hv3trn-cnf_n8-i14 | cnf | cnf_n8 |
hv3trn-cnf_n8-i14-wfs::wfs | Use WELL-FOUNDED semantics, with three truth values: 'true', 'false', and 'undefined'. A statement is 'true' if it has founded support: that is, it follows from rules whose positive conditions are 'true' and whose default-negated conditions are 'false', with the justification ultimately grounded rather than relying onl... | wfs | C | hv3trn-cnf_n8-i14 | cnf | cnf_n8 |
hv3trn-cnf_n8-i15-none::none | Answer using ordinary commonsense reasoning about the rules below.
Rules:
Proposition bad is true if proposition v2 is true and proposition w5 is true and proposition v3 is true and proposition bad is not true. Proposition s0 is true. Proposition bad is true if proposition w0 is true and proposition w3 is true and pro... | none | null | hv3trn-cnf_n8-i15 | cnf | cnf_n8 |
hv3trn-cnf_n8-i15-closed_world::closed_world | Use the CLOSED-WORLD ASSUMPTION with NEGATION-AS-FAILURE, interpreted operationally as in Prolog-style reasoning. A positive goal is 'true' if it can be derived by a terminating proof from the rules. A positive goal is 'false' if every attempted proof of it finitely fails. The default-negated goal not G is 'true' if th... | closed_world | C | hv3trn-cnf_n8-i15 | cnf | cnf_n8 |
hv3trn-cnf_n8-i15-cred::cred | Use STABLE-MODEL, also called ANSWER-SET, semantics with CREDULOUS, also called BRAVE, reasoning. An answer set is a self-consistent set of atoms that is closed under the program rules and contains exactly the atoms justified by those rules under the assumptions made in that same set. Equivalently, after evaluating eac... | cred | B | hv3trn-cnf_n8-i15 | cnf | cnf_n8 |
hv3trn-cnf_n8-i15-skept::skept | Use STABLE-MODEL, also called ANSWER-SET, semantics with SKEPTICAL, also called CAUTIOUS, reasoning. Consider all answer sets of the program. Each answer set is a self-consistent scenario that is closed under the rules and contains exactly the atoms justified by those rules under its own assumptions about default negat... | skept | A | hv3trn-cnf_n8-i15 | cnf | cnf_n8 |
hv3trn-cnf_n8-i15-wfs::wfs | Use WELL-FOUNDED semantics, with three truth values: 'true', 'false', and 'undefined'. A statement is 'true' if it has founded support: that is, it follows from rules whose positive conditions are 'true' and whose default-negated conditions are 'false', with the justification ultimately grounded rather than relying onl... | wfs | C | hv3trn-cnf_n8-i15 | cnf | cnf_n8 |
hv3trn-cnf_n8-i16-none::none | Answer using ordinary commonsense reasoning about the rules below.
Rules:
Proposition bad is true if proposition w6 is true and proposition w5 is true and proposition v4 is true and proposition bad is not true. Proposition bad is true if proposition v0 is true and proposition v1 is true and proposition w6 is true and ... | none | null | hv3trn-cnf_n8-i16 | cnf | cnf_n8 |
hv3trn-cnf_n8-i16-closed_world::closed_world | Use the CLOSED-WORLD ASSUMPTION with NEGATION-AS-FAILURE, interpreted operationally as in Prolog-style reasoning. A positive goal is 'true' if it can be derived by a terminating proof from the rules. A positive goal is 'false' if every attempted proof of it finitely fails. The default-negated goal not G is 'true' if th... | closed_world | C | hv3trn-cnf_n8-i16 | cnf | cnf_n8 |
hv3trn-cnf_n8-i16-cred::cred | Use STABLE-MODEL, also called ANSWER-SET, semantics with CREDULOUS, also called BRAVE, reasoning. An answer set is a self-consistent set of atoms that is closed under the program rules and contains exactly the atoms justified by those rules under the assumptions made in that same set. Equivalently, after evaluating eac... | cred | A | hv3trn-cnf_n8-i16 | cnf | cnf_n8 |
hv3trn-cnf_n8-i16-skept::skept | Use STABLE-MODEL, also called ANSWER-SET, semantics with SKEPTICAL, also called CAUTIOUS, reasoning. Consider all answer sets of the program. Each answer set is a self-consistent scenario that is closed under the rules and contains exactly the atoms justified by those rules under its own assumptions about default negat... | skept | A | hv3trn-cnf_n8-i16 | cnf | cnf_n8 |
hv3trn-cnf_n8-i16-wfs::wfs | Use WELL-FOUNDED semantics, with three truth values: 'true', 'false', and 'undefined'. A statement is 'true' if it has founded support: that is, it follows from rules whose positive conditions are 'true' and whose default-negated conditions are 'false', with the justification ultimately grounded rather than relying onl... | wfs | C | hv3trn-cnf_n8-i16 | cnf | cnf_n8 |
hv3trn-cnf_n8-i17-none::none | Answer using ordinary commonsense reasoning about the rules below.
Rules:
Proposition t3 is true if proposition v6 is true. Proposition w1 is true if proposition v1 is not true. Proposition bad is true if proposition w5 is true and proposition v3 is true and proposition w0 is true and proposition bad is not true. Prop... | none | null | hv3trn-cnf_n8-i17 | cnf | cnf_n8 |
hv3trn-cnf_n8-i17-closed_world::closed_world | Use the CLOSED-WORLD ASSUMPTION with NEGATION-AS-FAILURE, interpreted operationally as in Prolog-style reasoning. A positive goal is 'true' if it can be derived by a terminating proof from the rules. A positive goal is 'false' if every attempted proof of it finitely fails. The default-negated goal not G is 'true' if th... | closed_world | C | hv3trn-cnf_n8-i17 | cnf | cnf_n8 |
hv3trn-cnf_n8-i17-cred::cred | Use STABLE-MODEL, also called ANSWER-SET, semantics with CREDULOUS, also called BRAVE, reasoning. An answer set is a self-consistent set of atoms that is closed under the program rules and contains exactly the atoms justified by those rules under the assumptions made in that same set. Equivalently, after evaluating eac... | cred | B | hv3trn-cnf_n8-i17 | cnf | cnf_n8 |
hv3trn-cnf_n8-i17-skept::skept | Use STABLE-MODEL, also called ANSWER-SET, semantics with SKEPTICAL, also called CAUTIOUS, reasoning. Consider all answer sets of the program. Each answer set is a self-consistent scenario that is closed under the rules and contains exactly the atoms justified by those rules under its own assumptions about default negat... | skept | B | hv3trn-cnf_n8-i17 | cnf | cnf_n8 |
hv3trn-cnf_n8-i17-wfs::wfs | Use WELL-FOUNDED semantics, with three truth values: 'true', 'false', and 'undefined'. A statement is 'true' if it has founded support: that is, it follows from rules whose positive conditions are 'true' and whose default-negated conditions are 'false', with the justification ultimately grounded rather than relying onl... | wfs | C | hv3trn-cnf_n8-i17 | cnf | cnf_n8 |
hv3trn-cnf_n8-i18-none::none | Answer using ordinary commonsense reasoning about the rules below.
Rules:
Proposition bad is true if proposition w5 is true and proposition v6 is true and proposition w0 is true and proposition bad is not true. Proposition bad is true if proposition w0 is true and proposition v2 is true and proposition w4 is true and ... | none | null | hv3trn-cnf_n8-i18 | cnf | cnf_n8 |
hv3trn-cnf_n8-i18-closed_world::closed_world | Use the CLOSED-WORLD ASSUMPTION with NEGATION-AS-FAILURE, interpreted operationally as in Prolog-style reasoning. A positive goal is 'true' if it can be derived by a terminating proof from the rules. A positive goal is 'false' if every attempted proof of it finitely fails. The default-negated goal not G is 'true' if th... | closed_world | C | hv3trn-cnf_n8-i18 | cnf | cnf_n8 |
hv3trn-cnf_n8-i18-cred::cred | Use STABLE-MODEL, also called ANSWER-SET, semantics with CREDULOUS, also called BRAVE, reasoning. An answer set is a self-consistent set of atoms that is closed under the program rules and contains exactly the atoms justified by those rules under the assumptions made in that same set. Equivalently, after evaluating eac... | cred | A | hv3trn-cnf_n8-i18 | cnf | cnf_n8 |
hv3trn-cnf_n8-i18-skept::skept | Use STABLE-MODEL, also called ANSWER-SET, semantics with SKEPTICAL, also called CAUTIOUS, reasoning. Consider all answer sets of the program. Each answer set is a self-consistent scenario that is closed under the rules and contains exactly the atoms justified by those rules under its own assumptions about default negat... | skept | B | hv3trn-cnf_n8-i18 | cnf | cnf_n8 |
hv3trn-cnf_n8-i18-wfs::wfs | Use WELL-FOUNDED semantics, with three truth values: 'true', 'false', and 'undefined'. A statement is 'true' if it has founded support: that is, it follows from rules whose positive conditions are 'true' and whose default-negated conditions are 'false', with the justification ultimately grounded rather than relying onl... | wfs | C | hv3trn-cnf_n8-i18 | cnf | cnf_n8 |
hv3trn-cnf_n8-i19-none::none | Answer using ordinary commonsense reasoning about the rules below.
Rules:
Proposition w7 is true if proposition v7 is not true. Proposition v5 is true if proposition w5 is not true. Proposition bad is true if proposition v1 is true and proposition w5 is true and proposition v6 is true and proposition bad is not true. ... | none | null | hv3trn-cnf_n8-i19 | cnf | cnf_n8 |
hv3trn-cnf_n8-i19-closed_world::closed_world | Use the CLOSED-WORLD ASSUMPTION with NEGATION-AS-FAILURE, interpreted operationally as in Prolog-style reasoning. A positive goal is 'true' if it can be derived by a terminating proof from the rules. A positive goal is 'false' if every attempted proof of it finitely fails. The default-negated goal not G is 'true' if th... | closed_world | C | hv3trn-cnf_n8-i19 | cnf | cnf_n8 |
hv3trn-cnf_n8-i19-cred::cred | Use STABLE-MODEL, also called ANSWER-SET, semantics with CREDULOUS, also called BRAVE, reasoning. An answer set is a self-consistent set of atoms that is closed under the program rules and contains exactly the atoms justified by those rules under the assumptions made in that same set. Equivalently, after evaluating eac... | cred | B | hv3trn-cnf_n8-i19 | cnf | cnf_n8 |
hv3trn-cnf_n8-i19-skept::skept | Use STABLE-MODEL, also called ANSWER-SET, semantics with SKEPTICAL, also called CAUTIOUS, reasoning. Consider all answer sets of the program. Each answer set is a self-consistent scenario that is closed under the rules and contains exactly the atoms justified by those rules under its own assumptions about default negat... | skept | A | hv3trn-cnf_n8-i19 | cnf | cnf_n8 |
hv3trn-cnf_n8-i19-wfs::wfs | Use WELL-FOUNDED semantics, with three truth values: 'true', 'false', and 'undefined'. A statement is 'true' if it has founded support: that is, it follows from rules whose positive conditions are 'true' and whose default-negated conditions are 'false', with the justification ultimately grounded rather than relying onl... | wfs | C | hv3trn-cnf_n8-i19 | cnf | cnf_n8 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.