Query-guided maximum satisfiability

DOI10.1145/2837614.2837658MaRDI QIDQ2828249zbMATH OpenOpenAlexFDO

Authors Ravi Mangal, Aditya V. Nori, Mayur Naik, Xin Zhang

Publication date 24 October 2016

Published in Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2837614.2837658

zbMATH Keywords

optimizationinformation retrievalprogram analysismaximum satisfiabilitypartial modelquery-guided approach

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Quantified maximum satisfiability: a core-guided approach
• Quantified maximum satisfiability
• QMaxSAT: A partial Max-SAT solver
• Generalizing Core-Guided Max-SAT
• Unifying reasoning and core-guided search for maximum satisfiability
• QMaxSATpb: a certified MaxSAT solver
• MAX-closed semilinear constraint satisfaction
• On the Approximation of Maximum Satisfiability
• Approximating Succinct MaxSat
• SAT-based MaxSAT algorithms

Cited in

(4)

• Quantified maximum satisfiability
• Quantified maximum satisfiability: a core-guided approach
• Maximum satisfiability in software analysis: applications and techniques
• A SAT approach to query optimization in mediator systems

This page was built for publication: Query-guided maximum satisfiability

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