749 research outputs found
Computational Complexity and Phase Transitions
Phase transitions in combinatorial problems have recently been shown to be
useful in locating "hard" instances of combinatorial problems. The connection
between computational complexity and the existence of phase transitions has
been addressed in Statistical Mechanics and Artificial Intelligence, but not
studied rigorously.
We take a step in this direction by investigating the existence of sharp
thresholds for the class of generalized satisfiability problems defined by
Schaefer. In the case when all constraints are clauses we give a complete
characterization of such problems that have a sharp threshold.
While NP-completeness does not imply (even in this restricted case) the
existence of a sharp threshold, it "almost implies" this, since clausal
generalized satisfiability problems that lack a sharp threshold are either
1. polynomial time solvable, or
2. predicted, with success probability lower bounded by some positive
constant by across all the probability range, by a single, trivial procedure.Comment: A (slightly) revised version of the paper submitted to the 15th IEEE
Conference on Computational Complexit
On Sub-Propositional Fragments of Modal Logic
In this paper, we consider the well-known modal logics ,
, , and , and we study some of their
sub-propositional fragments, namely the classical Horn fragment, the Krom
fragment, the so-called core fragment, defined as the intersection of the Horn
and the Krom fragments, plus their sub-fragments obtained by limiting the use
of boxes and diamonds in clauses. We focus, first, on the relative expressive
power of such languages: we introduce a suitable measure of expressive power,
and we obtain a complex hierarchy that encompasses all fragments of the
considered logics. Then, after observing the low expressive power, in
particular, of the Horn fragments without diamonds, we study the computational
complexity of their satisfiability problem, proving that, in general, it
becomes polynomial
A Structure-preserving Clause Form Translation
Most resolution theorem provers convert a theorem into clause form before attempting to find a proof. The conventional translation of a first-order formula into clause form often obscures the structure of the formula, and may increase the length of the formula by an exponential amount in the worst case. We present a non-standard clause form translation that preserves more of the structure of the formula than the conventional translation. This new translation also avoids the exponential increase in size which may occur with the standard translation. We show how this idea may be combined with the idea of replacing predicates by their definitions before converting to clause form. We give a method of lock resolution which is appropriate for the non-standard clause form translation, and which has yielded a spectacular reduction in search space and time for one example. These techniques should increase the attractiveness of resolution theorem provers for program verification applications, since the theorems that arise in program verification are often simple but tedious for humans to prove
Logical Reduction of Metarules
International audienceMany forms of inductive logic programming (ILP) use metarules, second-order Horn clauses, to define the structure of learnable programs and thus the hypothesis space. Deciding which metarules to use for a given learning task is a major open problem and is a trade-off between efficiency and expressivity: the hypothesis space grows given more metarules, so we wish to use fewer metarules, but if we use too few metarules then we lose expressivity. In this paper, we study whether fragments of metarules can be logically reduced to minimal finite subsets. We consider two traditional forms of logical reduction: subsumption and entailment. We also consider a new reduction technique called derivation reduction, which is based on SLD-resolution. We compute reduced sets of metarules for fragments relevant to ILP and theoretically show whether these reduced sets are reductions for more general infinite fragments. We experimentally compare learning with reduced sets of metarules on three domains: Michalski trains, string transformations, and game rules. In general, derivation reduced sets of metarules outperform subsumption and entailment reduced sets, both in terms of predictive accuracies and learning times
- âŠ