On-line algorithms for polynomially solvable satisfiability problems
From MaRDI portal
Publication:3970696
DOI10.1016/0743-1066(91)90006-BzbMath0774.68053WikidataQ61609672 ScholiaQ61609672MaRDI QIDQ3970696
Giuseppe F. Italiano, Giorgio Ausiello
Publication date: 25 June 1992
Published in: The Journal of Logic Programming (Search for Journal in Brave)
complexitysatisfiability problemdirected hypergraphon-line decision algorithmspropositional Horn formula
Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Data structures (68P05)
Related Items (12)
Fully dynamic biconnectivity in graphs ⋮ Hierarchies of polynomially solvable satisfiability problems ⋮ Linear time analysis of properties of conflict-free and general Petri nets ⋮ Fuzzy logic programs as hypergraphs. Termination results ⋮ Non-oblivious local search for graph and hypergraph coloring problems ⋮ Dynamic maintenance of directed hypergraphs ⋮ On-line algorithms for satisfiability problems with uncertainty ⋮ On-line algorithms for satisfiability problems with uncertainty ⋮ Directed hypergraphs: introduction and fundamental algorithms -- a survey ⋮ On the complexity of strongly connected components in directed hypergraphs ⋮ Sensitivity analysis for Horn formulae ⋮ Partially dynamic maintenance of minimum weight hyperpaths
This page was built for publication: On-line algorithms for polynomially solvable satisfiability problems
