Sciweavers

119 search results - page 21 / 24
» Classical Linear Logic of Implications
Sort
View
SAT
2004
Springer
97views Hardware» more  SAT 2004»
14 years 27 days ago
Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization
Linear Pseudo-Boolean constraints offer a much more compact formalism to express significant boolean problems in several areas, ranging from Artificial Intelligence to Electroni...
Vasco M. Manquinho, João P. Marques Silva
DAM
2007
100views more  DAM 2007»
13 years 7 months ago
Partially ordered knapsack and applications to scheduling
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
Stavros G. Kolliopoulos, George Steiner
AAAI
2006
13 years 9 months ago
Planning with First-Order Temporally Extended Goals using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. The problem of planning with TEGs is of renewed interest becau...
Jorge A. Baier, Sheila A. McIlraith
AIPS
2006
13 years 9 months ago
Planning with Temporally Extended Goals Using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. Current planners for TEGs prune the search space during planni...
Jorge A. Baier, Sheila A. McIlraith
KR
2004
Springer
14 years 27 days ago
Planning Graphs and Knowledge Compilation
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
Hector Geffner