The language of search

MaRDI QIDQ3624075zbMATH OpenFDO

Authors Jinbo Huang, Adnan Darwiche

Publication date 28 April 2009

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

zbMATH Keywords

propositional knowledge bases

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Decomposable negation normal form
• Resolution versus search: Two strategies for SAT
• Resolution versus search: Two strategies for SAT
• scientific article; zbMATH DE number 1946853
• A Computational Study of Satisfiability Algorithms for Propositional Logic

Cited in

(11)

• On the relative succinctness of sentential decision diagrams
• DPLL+ROBDD derivation applied to inversion of some cryptographic functions
• On quantifying literals in Boolean logic and its applications to explainable AI
• From Rules to Constraint Programs with the Rules2CP Modelling Language
• Discrete-event systems fault diagnosis
• Implementing efficient All solutions SAT solvers
• On the (complete) reasons behind decisions
• On the role of logical separability in knowledge compilation
• An Abstract CNF-to-d-DNNF Compiler Based on Chronological CDCL
• On enumerating short projected models
• CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement

This page was built for publication: The language of search

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