Sciweavers

193 search results - page 23 / 39
» sat 2007
Sort
View
IJCAI
2001
14 years 10 months ago
Backjumping for Quantified Boolean Logic Satisfiability
The implementation of effective reasoning tools for deciding the satisfiability of Quantified Boolean Formulas (QBFs) is an important research issue in Artificial Intelligence. Ma...
Enrico Giunchiglia, Massimo Narizzano, Armando Tac...
CONSTRAINTS
2007
46views more  CONSTRAINTS 2007»
14 years 9 months ago
Local-search Extraction of MUSes
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
Éric Grégoire, Bertrand Mazure, C&ea...
CSL
2007
Springer
15 years 3 months ago
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
Alexander Hertel, Alasdair Urquhart
AUSAI
2007
Springer
15 years 1 months ago
Branching Rules for Satisfiability Analysed with Factor Analysis
Factor analysis is a statistical technique for reducing the number of factors responsible for a matrix of correlations to a smaller number of factors that may reflect underlying va...
Richard J. Wallace, Stuart Bain
VSMM
2007
Springer
15 years 3 months ago
Prototypes for Automated Architectural 3D-Layout
Prototypes for automated spatial layout in architecture focus on approaches, which define occupiable space as an orthogonal 2D-grid and use algorithms to allocate each rectangle o...
Henriette Bier, Adriaan de Jong, Gijs van der Hoor...