A Constraint Satisfaction Approach for Programmable Logic Detailed Placement

DOI10.1007/978-3-642-39071-5_16MaRDI QIDQ5326465zbMATH OpenOpenAlexFDO

Authors Andrew Mihal, Steve Teig

Publication date 5 August 2013

Published in Theory and Applications of Satisfiability Testing – SAT 2013 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39071-5_16

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 3920395
• scientific article; zbMATH DE number 1941075
• scientific article; zbMATH DE number 3852448
• A constraint satisfaction approach to a circuit design problem
• scientific article; zbMATH DE number 1941077
• Concurrent placement and routing in the design of integrated circuits
• Algorithms for VLSI placement
• Using constraint programming for the design of network-on-chip architectures

Cited in

(5)

• scientific article; zbMATH DE number 1941088 (Why is no real title available?)
• Determinstic VLSI block placement algorithm using less flexibility first principle
• Using constraint programming for the design of network-on-chip architectures
• Recognition of Nested Gates in CNF Formulas
• A correct-by-decision solution for simultaneous place and route

Describes a project that uses

Uses Software

• Lynx
• Chaff

This page was built for publication: A Constraint Satisfaction Approach for Programmable Logic Detailed Placement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326465)