504 search results - page 10 / 101 » The Complexity of Symmetry-Breaking Formulas |
115
click to vote
SAT
2007
Springer
15 years 10 months ago
2007
Springer
We demonstrate hardness results for the detection of small backdoor sets with respect to base classes Mr of CNF formulas with maximum deficiency ≤ r (M0 is the class of matched...
143
Voted
AAAI
2012
13 years 6 months ago
2012
In recent years, several systems have been proposed that learn the rules of a simple card or board game solely from visual demonstration. These systems were constructed for speci...
148
Voted
ISMVL
2000
IEEE
15 years 8 months ago
2000
IEEE
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
142
click to vote
AAAI
1994
15 years 5 months ago
1994
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
152
Voted
PUK
2000
15 years 5 months ago
2000
The generation of the set of all ground actions for a given set of ADL operators, which are allowed to have conditional effects and preconditions that can be represented using arbi...