STRIPS: A new approach to the application of theorem proving to problem solving
From MaRDI portal
Publication:2551696
DOI10.1016/0004-3702(71)90010-5zbMath0234.68036OpenAlexW2337392266WikidataQ29400046 ScholiaQ29400046MaRDI QIDQ2551696
Nils J. Nilsson, Richard Fikes
Publication date: 1971
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(71)90010-5
Related Items
Reactive computing as model generation, Goal distance estimation for automated planning using neural networks and support vector machines, Partial-order planning: Evaluating possible efficiency gains, Automatically generating abstractions for planning, The computational complexity of propositional STRIPS planning, Learning from planner performance, A heuristic search approach to planning with temporally extended preferences, Practical solution techniques for first-order MDPs, An overview of transaction logic, Extracting mutual exclusion invariants from lifted temporal planning domains, Autonomous agents modelling other agents: a comprehensive survey and open problems, Default reasoning by deductive planning, Mechanical verification on strategies, Planning for conjunctive goals, The statistics of state-spaces, Reasoning about action. I: A possible worlds approach, Reasoning about action. II: The qualification problem, Network languages for intelligent control, A preferential semantics for causal reasoning about action, Network languages for concurrent multiagent systems, A logical framework for evolving software systems, A geometric approach to error detection recovery for robot motion planning with uncertainty, Formally verified algorithms for upper-bounding state space diameters, Applicability conditions for plans with loops: computability results and algorithms, Complexity results for HTN planning, Planning parallel actions, State-variable planning under structural restrictions: algorithms and complexity, The situation calculus: a case for modal logic, A statistical approach to adaptive problem solving, Causality as a key to the frame problem, Extended inference modes in reasoning by computer systems, Non-monotonic logic. I, A history based approximate epistemic action theory for efficient postdictive reasoning, The computational complexity of avoiding spurious states in state space abstraction, Taking account of the actions of others in value-based reasoning, Abstraction and approximate decision-theoretic planning., Automatically selecting and using primary effects in planning: Theory and experiments., Ramification and causality, Synthesising recursive functions with side effects, An action-based approach to the formal specification and automatic analysis of business processes under authorization constraints, Dynamic reasoning with qualified syllogisms, How to progress a database, Fast planning through planning graph analysis, Interactionist-expectative view on agency and learning, HTN-like solutions for classical planning problems: an application to BDI agent systems, Monitoring and recovery for web service applications, Knowledge-based proof planning, The reference ontology of collective behavior of autonomous agents and its extensions, Behavior control as a function of consciousness. II: Synthesis of a behavior plan, Implementation of conjunctive and disjunctive fuzzy logic rules with neural networks, Robust planning with incomplete domain models, Gazing: An approach to the problem of definition and lemma use, Conceptual dependency and its descendants, Constructing situations and time, John McCarthy's legacy, A unifying action calculus, From systems to logic in the early development of nonmonotonic reasoning, Model verification and improvement using DISPROVER, Artificial intelligence and automatic programming in CAI, Constraint solving for proof planning, A logical theory of robot problem solving, The roles of associational and causal reasoning in problem solving., Hierarchical task planning for multiarm robot with multiconstraint, Linear temporal logic as an executable semantics for planning languages, Reasoning about partially ordered events, Inductive learning of search control rules for planning, What robots can do: robot programs and effective achievability, Multiple perspective dynamic decision making, Exploiting multiple goals and intentions in decision support for the management of multiple trauma: a review of the TraumAID project, Reaching agreements through argumentation: a logical model and implementation, Reasoning about actions: steady versus stabilizing state constraints, Remote Agent: to boldly go where no AI system has gone before, Let's plan it deductively!, Learning action models from plan examples using weighted MAX-SAT, The logical foundations of goal-regression planning in autonomous agents, \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver, Reasoning about actions with imprecise and incomplete state descriptions, Reasoning from last conflict(s) in constraint programming, Stochastic dynamic programming with factored representations, Planning in a hierarchy of abstraction spaces, Plan coordination by revision in collective agent based systems., Towards a general theory of action and time, Complexity, decidability and undecidability results for domain-independent planning, Network languages for complex systems, A linguistic approach to geometric reasoning, Answer set programming and plan generation, The qualification problem: A solution to the problem of anomalous models, Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan, On the computational complexity of temporal projection, planning, and plan validation, Multiobjective heuristic state-space planning, On the undecidability of probabilistic planning and related stochastic optimization problems, Contingent planning under uncertainty via stochastic satisfiability, Reconstructing force-dynamic models from video sequences, A unifying semantics for time and events, Nonmonotonic causal theories, Representing the Zoo World and the Traffic World in the language of the Causal Calculator, The representation of planning strategies, Heuristic planning: A declarative approach based on strategies for action selection, Translations of network languages, Toward a perception-based theory of probabilistic reasoning with imprecise probabilities, Fast and accurate data-driven goal recognition using process mining techniques, Diagnosis of intermittent faults in multi-agent systems: an SFL approach, Planning with regression analysis in transaction logic, Parallel planning via the distribution of operators, Event scheduling using allen's algebra, Mobile Robot Planning Using Action Language $${\mathcal {BC}}$$ with an Abstraction Hierarchy, Doctoral Consortium Extended Abstract: Planning with Concurrent Transaction Logic, To Vladimir Lifschitz on His 65th Birthday, Extending Action Language $\mathcal{C}+$ by Formalizing Composite Actions, Dynamic backward reasoning systems, Extended causal theories, Intention is choice with commitment, A formal characterisation of Hamblin's action-state semantics, Merge-and-Shrink Abstraction, Unnamed Item, State-set branching: leveraging BDDs for heuristic search, Maintenance goals of agents in a dynamic environment: formulation and policy construction, A formalism to specify unambiguous instructions inspired by Mīmāṁsā in computational settings, Integrating planning and learning: the PRODIGY architecture, Abduction to plausible causes: an event-based model of belief update, Representations for robot knowledge in the \textsc{KnowRob} framework, Geometric backtracking for combined task and motion planning in robotic systems, From model checking to equilibrium checking: reactive modules for rational verification, Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes, Spatial planning for musical output, Dynamic epistemic logics: promises, problems, shortcomings, and perspectives, A probabilistic analysis of propositional STRIPS planning, MULTI-AGENT COOPERATION VIA REASONING ABOUT THE BEHAVIOR OF OTHERS, A logic of time, chance, and action for representing plans, A constraint programming model for the scheduling and workspace layout design of a dual-arm multi-tool assembly robot, Programming in logic without logic programming, Domain-Independent Cost-Optimal Planning in ASP, Extending movilog for supporting web services, DEL-based epistemic planning: decidability and complexity, Unnamed Item, A Fluent Calculus Semantics for ADL with Plan Constraints, On the complexity of planning for agent teams and its implications for single agent planning, Unnamed Item, Qualitative Numeric Planning: Reductions and Complexity, Action-model acquisition for planning via transfer learning, Learning hierarchical task network domains from partially observed plan traces, LINGUISTIC GEOMETRY: METHODOLOGY AND TECHNIQUES, Unnamed Item, Cathoristic Logic, Event calculus and temporal action logics compared, On the logic of cooperation and propositional control, Understanding planning with incomplete information and sensing, A Verified Compositional Algorithm for AI Planning, On the complexity of case-based planning, Deliberative acting, planning and learning with hierarchical operational models, Principles for interactive acquisition and validation of workflows, Complexity of qualitative timeline-based planning, Recursive definitions of tabular transformations, Planning with Effectively Propositional Logic, The Relative Power of Semantics and Unification, Counterfactuals, Simulation of Action Theories and an Application to General Game-Playing Robots, An epistemic approach to nondeterminism: believing in the simplest course of events, Modelling and solving English peg solitaire, Planning as heuristic search, Temporal representation and reasoning in artificial intelligence: A review, Manipulating games by sharing information, A constraint programming formulation for planning: From plan scheduling to plan generation, Set-structured and cost-sharing heuristics for classical planning, A case study in programming a quantum annealer for hard operational planning problems, Planning and control in artificial intelligence: A unifying perspective, Information gathering and searching approaches on the Web, An application of learning to robotic planning, The complexity of agent design problems: Determinism and history dependence, Using Temporal Logic to Integrate Goals and Qualitative Preferences into Agent Programming, A planning language for embedded systems, Representing planning autonomy in agent organizational models, Landmark-based approaches for goal recognition as planning, CP methods for scheduling and routing with~time-dependent task costs, Formal composition of hybrid systems, DYNAMIC SIMILARITY METRIC USING FUZZY PREDICATES FOR CASE-BASED PLANNING, Towards Real-World HTN Planning Agents, Directing the Search in the Fast Forward Planning, EXPLICITLY SIMPLIFYING EVOLVED GENETIC PROGRAMS DURING EVOLUTION, A Semantical Account of Progression in the Presence of Defaults, On-the-Fly Macros, An action language for multi-agent domains, DEL Planning and Some Tractable Cases, On timeline-based games and their complexity, Unnamed Item, A PLAN FORMATION SYSTEM FOR ASSEMBLY ROBOTS, Planning under uncertainty as G<scp>OLOG</scp>programs, Performability of actions, Formalizing Goal Serializability for Evaluation of Planning Features, Learning action models with minimal observability, A Declarative Agent Programming Language Based on Action Theories, A paraconsistent approach to actions in informationally complex environments, ACTION FAILURE RECOVERY VIA MODEL-BASED DIAGNOSIS AND CONFORMANT PLANNING, Unnamed Item, Position systems in dynamic domains, Determining Action Reversibility in STRIPS Using Answer Set and Epistemic Logic Programming, MRPPS?An interactive refutation proof procedure system for question-answering, Creative Problem Solving in Artificially Intelligent Agents: A Survey and Framework, The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions, Automated planning as an early verification tool for distributed control, Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning
Cites Work
