Dealing with satisfiability and \(n\)-ary CSPs in a logical framework

DOI10.1007/s10817-010-9204-zzbMath1243.68264OpenAlexW1985449294MaRDI QIDQ438582

Pierre Siegel, Belaïd Benhamou, Lionel Paris

Publication date: 31 July 2012

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-010-9204-z

zbMATH Keywords

proof systemresolution methodSAT/CSP encoding

Mathematics Subject Classification ID

Uses Software

• MiniSat
• CSPLib
• Chaff

Cites Work

• Networks of constraints: Fundamental properties and applications to picture processing
• On forward checking for non-binary constraint satisfaction.
• On the parallel complexity of discrete relaxation in constraint satisfaction networks
• BerkMin: A fast and robust SAT-solver
• A Generalized Framework for Conflict Analysis
• Generalized Arc Consistency for Positive Table Constraints
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• A Machine-Oriented Logic Based on the Resolution Principle
• A Computing Procedure for Quantification Theory
• Random constraint satisfaction: Flaws and structure
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Dealing with satisfiability and \(n\)-ary CSPs in a logical framework