Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
90
Voted
CP
2006
Springer
102
views
Artificial Intelligence
»
more
CP 2006
»
Compiling Finite Linear CSP into SAT
15 years 6 months ago
Download
bach.istc.kobe-u.ac.jp
Naoyuki Tamura, Akiko Taga, Satoshi Kitagawa, Muts
Real-time Traffic
Artificial Intelligence
|
CP 2006
|
claim paper
Related Content
»
Automatically Exploiting Symmetries in Constraint Programming
more »
Post Info
More Details (n/a)
Added
20 Aug 2010
Updated
20 Aug 2010
Type
Conference
Year
2006
Where
CP
Authors
Naoyuki Tamura, Akiko Taga, Satoshi Kitagawa, Mutsunori Banbara
Comments
(0)
Researcher Info
Artificial Intelligence Study Group
Computer Vision