In this paper we experimentally assess, from both algorithmic and pragmatic perspectives, the adequacy of linguistic descriptions real data generated by two metaheuristics: simulated annealing genetic algorithm meta-heuristics. The type consider are fuzzy quantified statements (both Zadeh's type-1 type-2) involving three well-known quantification models (Zadeh's scalar Delgado's GD). We conduct...

I claim that an argument from the philosophy of statistics can be improved by using Carnapian inductive logic. \citet{GelmanShalizi2012} criticise a philosophical account of how statisticians ought to choose statistical models which they call `the received view of Bayesian inference' and propose a different account inspired by falsificationist philosophy of science. I introduce another philosop...

Most recent strides in scaling up planning have centered around two competing themes–disjunctive planners, exemplified by Graphplan, and heuristic state search planners, exemplified by UNPOP, HSP and HSP-r. In this paper, we present a novel approach for successfully harnessing the advantages of the two competing paradigms to develop planners that are significantly more powerful than either of t...

This paper advances the hypothesis that engineering design is most effective when heuristics are used in many aspects of the design process, particularly in structuring sequences of experiments and adapting the design based on data. These heuristics appear to be natural behavior in the sense that engineers will use them when no training or external incentives are offered to encourage alternativ...

Two prominent approaches to describing how people make decisions between risky options are algebraic models and heuristics. The two approaches are based on fundamentally different algorithms and are thus usually treated as antithetical, suggesting that they may be incommensurable. Using cumulative prospect theory (CPT; Tversky & Kahneman, 1992) as an illustrative case of an algebraic model, we ...

There are two major uses of abstraction in planning and search: refinement (where abstract solutions are extended into concrete solutions) and heuristics (where abstract solutions are used to compute heuristics for the original search space). These two approaches are usually viewed as unrelated in the literature. It is reasonable to believe, though, that they are related, since they are both in...

Autonomous agents that act in the real-world can often improve their success by capturing the uncertainty that arises because of their imperfect knowledge and potentially faulty actions. By making plans robust to uncertainty, agents can be prepared to counteract plan failure or act upon information that becomes available during plan execution. Such robust plans are valuable, but are often diffi...