Algorithms for testing the satisfiability of propositional formulae

DOI10.1016/0743-1066(89)90009-5zbMath0672.68044OpenAlexW2084642537MaRDI QIDQ3826123

Giorgio Gallo, Giampaolo Urbani

Publication date: 1989

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-1066(89)90009-5

zbMATH Keywords

efficiencysatisfiability for Horn clauses algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Resolving contradictions: A plausible semantics for inconsistent systems, Recognition of \(q\)-Horn formulae in linear time, A new algorithm for the propositional satisfiability problem, Embedding complex decision procedures inside an interactive theorem prover., Branching rules for satisfiability, Variable and term removal from Boolean formulae, Partitioning methods for satisfiability testing on large formulas, Logic applied to integer programming and integer programming applied to logic, Propositional calculus problems in CHIP, Some pitfalls for experimenters with random SAT, Fuzzy logic programs as hypergraphs. Termination results, An artificial neural network satisfiability tester, Exploiting data dependencies in many-valued logics, Maximum renamable Horn sub-CNFs, Approximate reasoning with credible subsets, Directed hypergraphs: introduction and fundamental algorithms -- a survey, About some UP-based polynomial fragments of SAT, An efficient algorithm for the 3-satisfiability problem, Directed hypergraphs and applications, Towards the Use of Hypergraphs in Multi-adjoint Logic Programming, On consistency in probabilistic logic for logical formulas represented by \(B\)-hypertrees, Partitioning methods for satisfiability testing on large formulas, New methods for computing inferences in first order logic, Backtracking tactics in the backtrack method for SAT, Explaining by evidence