scientific article; zbMATH DE number 2080329

zbMATH Open1044.68743MaRDI QIDQ4473049FDOQ4473049

Authors: Renato Bruni, Antonio Sassano 

Publication date: 4 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1894/18940495.htm

Title of this publication is not available (Why is that?)

Recommendations

• On exact selection of minimally unsatisfiable subformulae
• Theory and Applications of Satisfiability Testing
• Approximating minimal unsatisfiable subformulae by means of adaptive core search
• Finding Guaranteed MUSes Fast
• Restoring satisfiability or maintaining unsatisfiability by finding small unsatisfiable subformulae

Mathematics Subject Classification ID

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

Cited In (9)

• Theory and Applications of Satisfiability Testing
• On exact selection of minimally unsatisfiable subformulae
• Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel
• A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
• On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances
• Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
• Restoring satisfiability or maintaining unsatisfiability by finding small unsatisfiable subformulae
• A complete adaptive algorithm for propositional satisfiability
• Approximating minimal unsatisfiable subformulae by means of adaptive core search

This page was built for publication:

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