Logical inference and polyhedral projection

This publication has 26 references indexed in Scilit:

• Edmonds polytopes and a hierarchy of combinatorial problems
  Published by Elsevier ,2002
• Extended Horn sets in propositional logic
  Journal of the ACM, 1991
• Algorithms for testing the satisfiability of propositional formulae
  The Journal of Logic Programming, 1989
• Logical testing for rule-base management
  Annals of Operations Research, 1988
• Polynomially solvable satisfiability problems
  Information Processing Letters, 1988
• An O(n2) algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all horn sentences
  Information Processing Letters, 1987
• Some results and experiments in programming techniques for propositional logic
  Computers & Operations Research, 1986
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
  The Journal of Logic Programming, 1984
• The complexity of theorem-proving procedures
  Published by Association for Computing Machinery (ACM) ,1971
• A Computing Procedure for Quantification Theory
  Journal of the ACM, 1960