Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,206,861 papers from all fields of science
Search
Sign In
Create Free Account
Satplan
Known as:
Plansat
Satplan (better known as Planning as Satisfiability) is a method for automated planning. It converts the planning problem instance into an instance…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Artificial intelligence
Boolean satisfiability problem
DPLL algorithm
Graphplan
Expand
Broader (1)
Automated planning and scheduling
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Mixed-integer linear programming applied to temporal planning of concurrent actions
Florentin Mehlbeer
2014
Corpus ID: 13337158
Auf Grund ihrer vielfaltigen Anwendungsmoglichkeiten gewinnen autonome Systeme zunehmend an Bedeutung. Entsprechend besteht…
Expand
2012
2012
On Propositional Encodings of Cooperative Path-Finding
Pavel Surynek
IEEE International Conference on Tools with…
2012
Corpus ID: 8654346
The approach to solving cooperative-path finding (CPF) as propositional satisfiability (SAT) is revisited in this paper. An…
Expand
2012
2012
l-SATPLAN : Multi-agent planning as satisfiability
Yannis Dimopoulos
,
Muhammad Adnan Hashmi
,
Pavlos Moraitis
2012
Corpus ID: 7184523
Planning is a fundamental issue in multi-agent systems. In this work we focus on the coordination of multiple agents in two…
Expand
2010
2010
Optimal SAT-based Planning with Macro-actions and Learned Horizons
A. Gerevini
,
A. Saetti
,
M. Vallati
2010
Corpus ID: 1980224
The University Repository is a digital collection of the research output of the University, available on Open Access. Copyright…
Expand
2006
2006
T-satplan: a Sat-based Temporal Planner
A. Mali
,
Y. Liu
Int. J. Artif. Intell. Tools
2006
Corpus ID: 31391474
Recent advances in solving constraint satisfaction problems (CSPs) and heuristic search have made it possible to solve classical…
Expand
2005
2005
Flexible Web Services Discovery and Composition using SATPlan and A * Algorithms
Seog-Chan Oh
,
Dongwon Lee
,
S. Kumara
2005
Corpus ID: 14400476
Agents with web services based interfaces have service description encoded in machine-understandable formats so that they can…
Expand
2004
2004
Model compilation for embedded real-time planning and diagnosis
A. Barrett
2004
Corpus ID: 18299995
This paper describes MEXEC, an implemented micro executive that compiles a device model into an interal structure. Not only does…
Expand
2000
2000
Satisfiability Algorithms and Finite Quantification
M. Ginsberg
,
A. Parkes
International Conference on Principles of…
2000
Corpus ID: 16150491
Subsearch, where a satisfiability algorithm searches through the original theory for ground clauses that satisfy some numeric…
Expand
2000
2000
Open World Planning as SCSP
A. Nareyek
,
Gmd First
2000
Corpus ID: 1971719
Planning for the real world requires the ability to sense and reason about an arbitrary number of entities and relations that are…
Expand
1998
1998
Buena señal: culmina con éxito el Proyecto Integrado PlanSAT para el desarrollo de equipos, sistemas y comunicaciones por satélite
J. Rodríguez
1998
Corpus ID: 127632389
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE