A Max-SAT Inference-Based Pre-processing for Max-Clique

DOI10.1007/978-3-540-79719-7_13zbMath1138.68541OpenAlexW1562762628MaRDI QIDQ3502702

Federico Heras, Javier Larrosa

Publication date: 27 May 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-79719-7_13

zbMATH Keywords

Max-SATInferenceMax-clique

Mathematics Subject Classification ID

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

Related Items (2)

Incomplete inference for graph problems ⋮ Russian doll search for the Steiner triple covering problem

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving weighted CSP by maintaining arc consistency
• An exact algorithm for the maximum clique problem
• Resolution for Max-SAT
• An algorithm for finding a maximum clique in a graph
• A fast algorithm for the maximum clique problem
• A logical approach to efficient Max-SAT solving
• A new trust region technique for the maximum weight clique problem
• Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP
• Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
• Finding a Maximum Clique in an Arbitrary Graph
• New Upper Bounds for Maximum Satisfiability
• Optimal Protein Structure Alignment Using Maximum Cliques
• Theory and Applications of Satisfiability Testing
• Principles and Practice of Constraint Programming – CP 2003
• Principles and Practice of Constraint Programming – CP 2003

This page was built for publication: A Max-SAT Inference-Based Pre-processing for Max-Clique