Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “plan complexity”

Assessing the Complexity of Plan Recognition

2008

This paper presents a discussion of the theoretical complexity of plan recognition on the basis of an analysis of the number of explanations that any complete plan recognition algorithm must consider given various properties of the plan library. On the basis of these results it points out properties of plan libraries that make them computationally expensive.

Cited by 0

A Complexity-Based Plan for Evaluating Transformation

Jonny Morell · Journal of MultiDisciplinary Evaluation · 2023

This article presents a case for more rigorous application of complexity science in our efforts to evaluate activity that seeks to bring about transformative change. It builds on the work that is already going on in the evaluation community. Three constructs from complexity science are employed – sensitive dependence, emergence, and social attractors. The paper argues that if–then logic is recommended for small-scale change within transformation efforts, but that to evaluate transformation writ large, data from if–then evaluation must be embedded in, and interpreted in terms of, complex behavior. Methodologies for evaluating within this framework are presented. The argument is linked to a definition of transformation that is multidimensional, non-linear, and measurable. The paper is built around a generic model of transformational change and shows how that model can be customized for specific transformation scenarios. It also shows how evaluation with respect to complexity can be accomplished with methodologies that are well known and well-practiced in the evaluation community. Background: “Transformation” is becoming an important concept in evaluation. Purpose: Promote a complexity approach to evaluating transformation. Setting: Not applicable. Intervention: Not applicable. Research Design: Not applicable. Data Collection and Analysis: Not applicable. Findings: Not applicable.

Cited by 2Open access

On computational complexity of plan curve invariants

Fedor Duzhin, Biaoshuai Tao · Online Journal of Analytic Combinatorics · 2014

The theory of generic smooth closed plane curves initiated by Vladimir Arnold is a beautiful fusion of topology, combinatorics, and analysis. The theory remains fairly undeveloped. We review existing methods to describe generic smooth closed plane curves combinatorially, introduce a new one, and give an algorithm for efficient computation of Arnold’s invariants. Our results provide a good source of future research projects that involve computer experiments with plane curves. The reader is not required to have background in topology and even undergraduate students with basic knowledge of differential geometry and graph theory will easily understand our paper.

Cited by 0Open access

Data Management Plan for Complexity in Complementation

Smith, Eleanor · Zenodo (CERN European Organization for Nuclear Research) · 2023

<strong>The PhD project to be carried out by Eleanor Smith is part of an FWO junior research project. The main objective is to establish the impact of interindividual differences in cognitive representations on long-term population-level language change. In examining how the individual and community levels interact, the project seeks to contribute to a theory of language as a complex adaptive system. This theory views language as a self-organizing network which at the macro-level shows properties that are not recurrent at the individual level and yet emerge out of complex behaviour at that level. A more specific goal is to chart, and explain, the range of variation in the English complementation system by studying variation between patterns such as ‘I remember that a detective came in’ and ‘I remember a detective coming in’. While a certain amount of variation can probably be accounted for by a desire of varying itself, it has been shown that the choice between complement variants is influenced by factors such as animacy (human or abstract) or clause length. At the same time existing studies have experienced difficulties with robustly accounting for the variation by means of population-level (social) variables only. When social clues are insufficient to determine usage, cognitive mechanisms may come into play that are different between individuals and therefore cannot easily be averaged over. This project seeks to advance our insight in the functionality of abstract grammatical variation of this kind by putting individual-level analysis more central. </strong> <strong>The data for the project will be collected as part of the PhD and will consist of a sample of the collected works of 40 prolific 18th-19th century authors. The theoretical framework will be that of construction grammar (e.g. Goldberg 2006, Traugott &amp; Trousdale 2013) and cognitive science more generally. </strong>

Cited by 0Open access

Data Management Plan for Complexity in Complementation

Smith, Eleanor · Zenodo (CERN European Organization for Nuclear Research) · 2023

<strong>The PhD project to be carried out by Eleanor Smith is part of an FWO junior research project. The main objective is to establish the impact of interindividual differences in cognitive representations on long-term population-level language change. In examining how the individual and community levels interact, the project seeks to contribute to a theory of language as a complex adaptive system. This theory views language as a self-organizing network which at the macro-level shows properties that are not recurrent at the individual level and yet emerge out of complex behaviour at that level. A more specific goal is to chart, and explain, the range of variation in the English complementation system by studying variation between patterns such as ‘I remember that a detective came in’ and ‘I remember a detective coming in’. While a certain amount of variation can probably be accounted for by a desire of varying itself, it has been shown that the choice between complement variants is influenced by factors such as animacy (human or abstract) or clause length. At the same time existing studies have experienced difficulties with robustly accounting for the variation by means of population-level (social) variables only. When social clues are insufficient to determine usage, cognitive mechanisms may come into play that are different between individuals and therefore cannot easily be averaged over. This project seeks to advance our insight in the functionality of abstract grammatical variation of this kind by putting individual-level analysis more central. </strong> <strong>The data for the project will be collected as part of the PhD and will consist of a sample of the collected works of 40 prolific 18th-19th century authors. The theoretical framework will be that of construction grammar (e.g. Goldberg 2006, Traugott &amp; Trousdale 2013) and cognitive science more generally. </strong>

Cited by 0Open access

On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence

Association for Artificial Intelligence 2024, Bercher, Pascal, Helmert, Malte et al. · Underline Science Inc. · 2024

In this paper we study the computational complexity of several reasoning tasks centered around the bounded plan existence problem. We do this for standard classical planning and hierarchical task network (HTN) planning and each for a grounded and a lifted representation. Whereas bounded plan existence complexity is known for classical planning, it has not yet been studied for HTN planning. For plan verification, results were available for both formalisms except for the lifted HTN planning. We will present lower and upper bounds of the complexity of plan verification in lifted HTN planning and provide novel insights into its grounded counterpart, in which we show that verification is not just NP-complete in the general case, but already for a severely restricted special case. Finally, we show the complexity concerning verifying the optimality of a given plan and discuss its connection to the bounded plan existence problem.

Cited by 0Open access

On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence

Songtuan Lin, Conny Olz, Malte Helmert et al. · Proceedings of the AAAI Conference on Artificial Intelligence · 2024

In this paper we study the computational complexity of several reasoning tasks centered around the bounded plan existence problem. We do this for standard classical planning and hierarchical task network (HTN) planning and each for a grounded and a lifted representation. Whereas bounded plan existence complexity is known for classical planning, it has not yet been studied for HTN planning. For plan verification, results were available for both formalisms except for the lifted HTN planning. We will present lower and upper bounds of the complexity of plan verification in lifted HTN planning and provide novel insights into its grounded counterpart, in which we show that verification is not just NP-complete in the general case, but already for a severely restricted special case. Finally, we show the complexity concerning verifying the optimality of a given plan and discuss its connection to the bounded plan existence problem.

Cited by 2Open access

Complexity of Voting COMSOC 2009 Plan for Today

Ulle Endriss, Ulle Endriss, Ulle Endriss · 2015

Voting is the archetypical form of making a collective decision. As we have seen last week, there are a range of different voting rules, all either satisfying or violating various properties. Today we will concentrate on some of the computational questions that arise in the context of voting. For instance: • For a complex voting rule (think of the Dodgson rule), how do we actually compute the winner (; algorithms)? And what is the computational complexity of doing so? • The Gibbard-Satterthwaite Theorem tells us that manipulation is always possible. But how hard is it, computationally, to actually find a manipulating ballot?

Cited by 0

Irreversibility and Unpredictability (the complexity of the plan)

AUDRAS, Stéphane, LUGAN, Jean-Claude · OpenGrey (Institut de l'Information Scientifique et Technique) · 2009

L'objet de cette recherche est de comprendre les mécanismes organisationnels et projectifs d'un système complexe à l'aide d'une conception renouvelée du temps. Nous recourons aux concepts d'irréversilité et d'imprévisibilité afin de penser ensemble la trajectoire et les processus d'intégration du système dans son environnement. La recherche empirique porte sur le projet de création d'une cinquième université dans le nord-est de la Région Midi-Pyrénées. Au cours, d'une première partie, nous exposons une modélisation complexe pour appréhender notre objet. Les trois parties suivantes retracent chronologiquement l'histoire du projet : son émergence au cours des années 1990, la création d'un Etablissement Public Administratif en 2002 et le fonctionnement de cet établissement jusqu'en 2007.

Cited by 0

Plan Reordering and Parallel Execution — A Parameterized Complexity View

Meysam Aghighi, Christer Bäckström · Proceedings of the AAAI Conference on Artificial Intelligence · 2017

Bäckström has previously studied a number of optimization problems for partial-order plans, like finding a minimum deordering (MCD) or reordering (MCR), and finding the minimum parallel execution length (PPL), which are all NP-complete. We revisit these problems, but applying parameterized complexity analysis rather than standard complexity analysis. We consider various parameters, including both the original and desired size of the plan order, as well as its width and height. Our findings include that MCD and MCR are W[2]-hard and in W[P] when parameterized with the desired order size, and MCD is fixed-parameter tractable (fpt) when parameterized with the original order size. Problem PPL is fpt if parameterized with the size of the non-concurrency relation, but para-NP-hard in most other cases. We also consider this problem when the number (k) of agents, or processors, is restricted, finding that this number is a crucial parameter; this problem is fixed-parameter tractable with the order size, the parallel execution length and k as parameter, but para-NP-hard without k as parameter.

Cited by 6Open access