Sciweavers

2181 search results - page 180 / 437
» The restriction scaffold problem
Sort
View
118
Voted
AAAI
1994
15 years 2 months ago
Forming Beliefs about a Changing World
The situation calculus is a popular technique for reasoning about action and change. However, its restriction to a firstorder syntax and pure deductive reasoning makes it unsuitab...
Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, ...
118
Voted
ECAI
2010
Springer
15 years 2 months ago
Constraint-Based Controller Synthesis in Non-Deterministic and Partially Observable Domains
Controller synthesis consists in automatically building controllers taking as inputs observation data and returning outputs guaranteeing that the controlled system satisfies some d...
Cédric Pralet, Gérard Verfaillie, Mi...
90
Voted
AI
2006
Springer
15 years 1 months ago
The complexity of soft constraint satisfaction
Over the past few years there has been considerable progress in methods to systematically analyse the complexity of constraint satisfaction problems with specified constraint type...
David A. Cohen, Martin C. Cooper, Peter Jeavons, A...
129
Voted
ENDM
2008
142views more  ENDM 2008»
15 years 1 months ago
Augmenting the Connectivity of Planar and Geometric Graphs
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
Ignaz Rutter, Alexander Wolff
103
Voted
COMBINATORICS
2007
72views more  COMBINATORICS 2007»
15 years 1 months ago
Matrix Partitions with Finitely Many Obstructions
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
Tomás Feder, Pavol Hell, Wing Xie