On-line estimation of matching complexity in first order logic
The expressiveness of First Order Logic (FOL) languages is severely counterbalanced by the complexity of matching formulas on a universe. Matching is an instance of the class of Constraint Satisfaction Problems (CSP), which have shown to undergo a phase transition with respect to two order parameters: constraint density and constraint tightness. This paper analyzes the problem of satisfying FOL Horn clauses in the light of these recent results. By means of an extensive experimental analysis, we show how Horn clause verification exhibits a typical phase transition with respect to the number of binary (or greater arity) predicates, and with respect to the ratio between the number of constants in the universe and the cardinality of the basic predicates extension.
Unable to display preview. Download preview PDF.
- 1.Anglano C., Giordana A., Lo Bello G., and Saitta L. (1998). “An Experimental Evaluation of Coevolutive Concept Learning”. In Proc. 15th Int. Conf. on Machine Learning (Madison, WI), pp. 19–27.Google Scholar
- 2.Cheeseman P., Kanefsky B., and Taylor W.M. (1991). “Where the Really Hard Problems Are”. In Proc. 12th Int. Joint Conf on Artificial Intelligence (Sidney, Australia), pp. 331–337.Google Scholar
- 5.Hogg T., Huberman B.A., and Williams C.P. (Eds.) (1996). Artificial Intelligence, Special Issue on Frontiers in Problem Solving: Phase Transitions and Complexity, 81 (1–2).Google Scholar
- 10.Smith B.M. (1994). “Phase Transition and the Mushy Region in Constraint Satisfaction”. In Proc. European Conf. on Artificial Intelligence (Amsterdam, The Netherlands), pp. 125–129.Google Scholar
- 12.Walsh T. (1998). “The Constrainedness Knife-Edge”. In Proc. 15th National Conf. on Artificial Intelligence (Madison, Wisconsin, USA), pp. 406–411.Google Scholar