On the public citation graph
Constraints and AI Planning
0 signed · 89 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/10720246_9openalex-snapshot
Numeric State Variables in Constraint-Based Planning
inferredcites →https://doi.org/10.1007/3-540-45746-1openalex-snapshot
Constraint-based agents: an architecture for constraint-based modeling and local-search-based reasoning for planning and scheduling in open and dynamic worlds
inferredcites →https://doi.org/10.1007/3-540-45746-1_2openalex-snapshot
Using Global Constraints for Local Search
inferredcites →https://doi.org/10.1007/3-540-49059-0_14openalex-snapshot
Symbolic Model Checking without BDDs
inferredcites →https://doi.org/10.1007/3-540-58495-1_22openalex-snapshot
parcPlan: a planning architecture with parallel actions, resources and constraints
inferredcites →https://doi.org/10.1007/978-3-540-48085-3_27openalex-snapshot
Tight Cooperation and Its Application in Piecewise Linear Optimization
inferredcites →https://doi.org/10.1007/978-3-642-59546-2openalex-snapshot
Distributed Constraint Satisfaction
inferredcites →https://doi.org/10.1007/bfb0121223openalex-snapshot
On the development of a general algebraic modeling system in a strategic planning environment
inferredcites →https://doi.org/10.1016/0004-3702(71)90010-5openalex-snapshot
Strips: A new approach to the application of theorem proving to problem solving
inferredcites →https://doi.org/10.1016/0004-3702(81)90007-2openalex-snapshot
Planning with constraints (MOLGEN: Part 1)
inferredcites →https://doi.org/10.1016/0004-3702(88)90081-1openalex-snapshot
Comments on Mohr and Henderson's path consistency algorithm
inferredcites →https://doi.org/10.1016/0004-3702(91)90006-6openalex-snapshot
Temporal constraint networks
inferredcites →https://doi.org/10.1016/0004-3702(91)90024-eopenalex-snapshot
O-Plan: The open planning architecture
inferredcites →https://doi.org/10.1016/0004-3702(92)90004-hopenalex-snapshot
Partial constraint satisfaction
inferredcites →https://doi.org/10.1016/0004-3702(92)90007-kopenalex-snapshot
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
inferredcites →https://doi.org/10.1016/0004-3702(92)90031-ropenalex-snapshot
The emperor's real mind: Review of Roger Penrose's the emperor's new mind: Concerning computers, minds and the laws of physics
inferredcites →https://doi.org/10.1016/0004-3702(95)00098-4openalex-snapshot
Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem
inferredcites →https://doi.org/10.1016/0377-2217(93)90320-mopenalex-snapshot
Algebraic languages for mathematical programming
inferredcites →https://doi.org/10.1016/s0004-3702(00)00033-3openalex-snapshot
Stochastic dynamic programming with factored representations
inferredcites →https://doi.org/10.1016/s0004-3702(01)00128-xopenalex-snapshot
Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
inferredcites →https://doi.org/10.1016/s0004-3702(01)00151-5openalex-snapshot
Local search characteristics of incomplete SAT procedures
inferredcites →https://doi.org/10.1016/s0004-3702(02)00362-4openalex-snapshot
Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
inferredcites →https://doi.org/10.1016/s0004-3702(96)00027-6openalex-snapshot
A theoretical evaluation of selected backtracking algorithms
inferredcites →https://doi.org/10.1016/s0004-3702(96)00047-1openalex-snapshot
Fast planning through planning graph analysis
inferredcites →https://doi.org/10.1016/s0743-1066(96)00121-5openalex-snapshot
GOLOG: A logic programming language for dynamic domains
inferredcites →https://doi.org/10.1017/s0269888900001065openalex-snapshot
Applying integer programming to AI planning
inferredcites →https://doi.org/10.1017/s0269888900001077openalex-snapshot
A scheme for unifying optimization and constraint satisfaction methods
inferredcites →https://doi.org/10.1023/a:1025842019552openalex-snapshot
Constraint-Based Attribute and Interval Planning
inferredcites →https://doi.org/10.1023/a:1026441215081openalex-snapshot
Semiring-Based CSPs and Valued CSPs: Frameworks, Properties, and Comparison
inferredcites →https://doi.org/10.1090/dimacs/057/02openalex-snapshot
Using global constraints for local search
inferredcites →https://doi.org/10.1109/fuzzy.1994.343640openalex-snapshot
Fuzzy constraint satisfaction
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/357456.357457openalex-snapshot
Modeling languages versus matrix generators for linear programming
inferredcites →https://doi.org/10.21236/ada360973openalex-snapshot
Symbolic Model Checking without BDDs
inferredcites →https://doi.org/10.2307/254202openalex-snapshot
The OPL Optimization Programming Language
inferredcites →https://doi.org/10.48550/arxiv.0903.1152openalex-snapshot
Stochastic Constraint Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-44953-1_34openalex-snapshot
A Constraint Programming Approach to Multi-Robot Task Allocation and Scheduling in Retirement Homes
inferred← citeshttps://doi.org/10.1007/978-3-319-94541-5_26openalex-snapshot
Method of Operational Activities and Processes Optimization Design in Architecture
inferred← citeshttps://doi.org/10.1007/978-3-540-88871-0_6openalex-snapshot
Dynamic Web Services Provisioning with Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-11198-3_12openalex-snapshot
A PDDL-Based Planning Architecture to Support Arcade Game Playing
inferred← citeshttps://doi.org/10.1007/978-3-642-29828-8_21openalex-snapshot
Combining Static and Dynamic Models for Boosting Forward Planning
inferred← citeshttps://doi.org/10.1007/s10489-012-0367-7openalex-snapshot
A resource enhanced HTN planning approach for emergency decision-making
inferred← citeshttps://doi.org/10.1007/s10845-008-0162-9openalex-snapshot
A CSP model for simple non-reversible and parallel repair plans
inferred← citeshttps://doi.org/10.1007/s10845-008-0176-3openalex-snapshot
Constraint-based modeling of discrete event dynamic systems
inferred← citeshttps://doi.org/10.1016/j.artint.2015.02.002openalex-snapshot
HTN planning: Overview, comparison, and beyond
inferred← citeshttps://doi.org/10.1016/j.engappai.2024.108254openalex-snapshot
Digital workflow for printability checking and prefabrication in robotic construction 3D printing based on Artificial Intelligence planning
inferred← citeshttps://doi.org/10.1017/s0269888910000172openalex-snapshot
How to model planning and scheduling problems using constraint networks on timelines
inferred← citeshttps://doi.org/10.1017/s0269888910000202openalex-snapshot
New trends in constraint satisfaction, planning, and scheduling: a survey
inferred← citeshttps://doi.org/10.1109/3468.895887openalex-snapshot
Task planning under uncertainty using a spreading activation network
inferred← citeshttps://doi.org/10.1109/4235.942527openalex-snapshot
Parallel hybrid method for SAT that couples genetic algorithms and local search
inferred← citeshttps://doi.org/10.1109/anthology.2013.6785016openalex-snapshot
A temporal HTN planning paradigm and its' application in flood controlling
inferred← citeshttps://doi.org/10.1109/cecnet.2012.6202228openalex-snapshot
Towards multi-core expert system
inferred← citeshttps://doi.org/10.1109/cit.2007.71openalex-snapshot
Automatic Web Services Composition Using Combining HTN and CSP
inferred← citeshttps://doi.org/10.1109/csse.2008.1352openalex-snapshot
USAT: An Integrated Platform for Satisfiability Solving and Model Checking
inferred← citeshttps://doi.org/10.1109/icsmc.2010.5641811openalex-snapshot
Design of user interface for Automatic Service Composition
inferred← citeshttps://doi.org/10.1109/ictai.2008.83openalex-snapshot
Automatic Design of Robot Behaviors through Constraint Network Acquisition
inferred← citeshttps://doi.org/10.1109/ictai.2012.73openalex-snapshot
Planning with Inaccurate Temporal Rules
inferred← citeshttps://doi.org/10.1109/ictai.2013.12openalex-snapshot
An Automatic Algorithm Selection Approach for Planning
inferred← citeshttps://doi.org/10.1109/ictai.2013.56openalex-snapshot
Fully-Automated Instance Decomposition and Subplan Synthesis for Parallel Execution
inferred← citeshttps://doi.org/10.1109/icws.2006.6openalex-snapshot
A Framework for Intelligent Web Services: Combined HTN and CSP Approach
inferred← citeshttps://doi.org/10.1109/intellisys.2017.8324230openalex-snapshot
Developing video games with elementary adaptive artificial intelligence in unity: An intelligent systems approach
inferred← citeshttps://doi.org/10.1109/iros.2006.281675openalex-snapshot
Planning and Acting in Uncertain Environments using Probabilistic Inference
inferred← citeshttps://doi.org/10.1109/iros.2014.6942972openalex-snapshot
Synthesizing manipulation sequences for under-specified tasks using unrolled Markov Random Fields
inferred← citeshttps://doi.org/10.1109/ismvl.2003.1201427openalex-snapshot
Functions of multiple-valued logic and the complexity of constraint satisfaction: a short survey
inferred← citeshttps://doi.org/10.1109/isqed.2009.4810323openalex-snapshot
Efficient SAT-based techniques for Design of Experiments by using static variable ordering
inferred← citeshttps://doi.org/10.1109/mis.2015.39openalex-snapshot
Intelligent Shelter Allotment for Emergency Evacuation Planning: A Case Study of Makkah
inferred← citeshttps://doi.org/10.1109/mmar.2014.6957452openalex-snapshot
On transformation of conditional action planning to linear programming
inferred← citeshttps://doi.org/10.1109/mmar.2015.7283901openalex-snapshot
On translation of conformant action planning to linear programming
inferred← citeshttps://doi.org/10.1109/tai.1998.744842openalex-snapshot
Combining cellular genetic algorithms and local search for solving satisfiability problems
inferred← citeshttps://doi.org/10.1109/tcad.2010.2061631openalex-snapshot
A Novel SAT-Based Approach to the Task Graph Cost-Optimal Scheduling Problem
inferred← citeshttps://doi.org/10.1109/tsmca.2010.2052039openalex-snapshot
A Benchmark Diagnostic Model Generation System
inferred← citeshttps://doi.org/10.1109/wi-iat.2013.32openalex-snapshot
Scalable Planning in the Semantic Web -- A Smart Factory Assembly Line Balancing Example
inferred← citeshttps://doi.org/10.1109/wodes.2008.4605926openalex-snapshot
Supervisory control using satisfiability solvers
inferred← citeshttps://doi.org/10.1145/2351676.2351693openalex-snapshot
A qualitative study on user guidance capabilities in product configuration tools
inferred← citeshttps://doi.org/10.1201/b11963-30openalex-snapshot
Human-Centered Design of Decision-Support Systems
inferred← citeshttps://doi.org/10.1201/b11963-ch-26openalex-snapshot
Human-Centered Design of Decision-Support Systems
inferred← citeshttps://doi.org/10.24425/acs.2021.137423openalex-snapshot
On transformation of conditional, conformant and parallel planning to linear programming
inferred← citeshttps://doi.org/10.2478/v10170-010-0042-3openalex-snapshot
On transformation of STRIPS planning to linear programming
inferred← citeshttps://doi.org/10.3233/aic-2012-0539openalex-snapshot
Anytime heuristic search in temporal HTN planning for developing incident action plans
inferred← citeshttps://doi.org/10.48550/arxiv.1403.7426openalex-snapshot
An Overview of Hierarchical Task Network Planning
inferred← citeshttps://doi.org/10.5282/edoc.13213openalex-snapshot
Supporting IT Service Fault Recovery with an Automated Planning Method
inferred← citeshttps://doi.org/10.5772/8947openalex-snapshot
User Interface for Automatic Service Composition
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.