Sensitivity analysis for Horn formulae

DOI10.1016/0377-2217(92)90267-DzbMath0760.90095OpenAlexW2087960765MaRDI QIDQ1200328

Cristina Marcucci, Fabio Schoen

Publication date: 16 January 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90267-d

zbMATH Keywords

flows in hypergraphsHorn satisfiability

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Database theory (68P15) Linear programming (90C05) Deterministic network models in operations research (90B10) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Classical propositional logic (03B05)

Cites Work

• Unnamed Item
• Some results and experiments in programming techniques for propositional logic
• Gainfree Leontief substitution flow problems
• Directed hypergraphs and applications
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Amortized Computational Complexity
• On-line algorithms for polynomially solvable satisfiability problems
• Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base

This page was built for publication: Sensitivity analysis for Horn formulae