scientific article

zbMATH Open1182.68267arXiv1109.6348MaRDI QIDQ3624006FDOQ3624006

Authors:

Publication date: 28 April 2009

Full work available at URL: https://arxiv.org/abs/1109.6348

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

Recommendations

• Scalable error detection using Boolean satisfiability
• scientific article; zbMATH DE number 2019877
• On the structure of Boolean satisfiability
• scientific article; zbMATH DE number 1670770
• Boolean satisfiability with transitivity constraints
• scientific article; zbMATH DE number 176261
• Boolean satisfiability and EDA applications
• scientific article; zbMATH DE number 1982200
• Probabilistic verification of Boolean functions
• A Fault-Tolerant Default Logic

zbMATH Keywords

Boolean formulasdelta-model

Mathematics Subject Classification ID

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

Cited In (3)

• The Fault Tolerance of NP-Hard Problems
• Reformulation based MaxSat robustness
• Friedman's question: Detectability of bridging faults in irredundant computational logic networks

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 Q3624006)