On-line algorithms for satisfiability problems with uncertainty

DOI10.1016/S0304-3975(96)00123-5MaRDI QIDQ673379zbMATH OpenFDO

Authors Roberto Giaccio, Giorgio Ausiello

Publication date 28 February 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(96)00123-5

zbMATH Keywords

algorithmsuncertaintyhypergraphsHorn formulaon-line satisfiabilityreasoning in knowledge bases

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Logic in artificial intelligence (68T27)

Recommendations

• On-line algorithms for polynomially solvable satisfiability problems
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• On the complexity of the maximum satisfiability problem for Horn formulas
• Algorithms for testing the satisfiability of propositional formulae
• scientific article; zbMATH DE number 1305521

Cites work

• scientific article; zbMATH DE number 4064538 (Why is no real title available?)
• scientific article; zbMATH DE number 43947 (Why is no real title available?)
• scientific article; zbMATH DE number 3560492 (Why is no real title available?)
• A logic for default reasoning
• A new algorithm for the propositional satisfiability problem
• Circumscription - a form of non-monotonic reasoning
• Directed hypergraphs and applications
• Dynamic maintenance of directed hypergraphs
• Fuzzy sets
• Fuzzy sets and systems. Theory and applications
• Fuzzy sets as a basis for a theory of possibility
• Minimal Representation of Directed Hypergraphs
• Non-monotonic logic. I
• Nonmonotonic Logic II
• On-line algorithms for polynomially solvable satisfiability problems
• On-line algorithms for satisfiability problems with uncertainty

Cited in

(8)

• Partially dynamic maintenance of minimum weight hyperpaths
• Approximate reasoning by similarity-based SLD resolution.
• On-line algorithms for polynomially solvable satisfiability problems
• Directed hypergraphs: introduction and fundamental algorithms -- a survey
• On-line algorithms for satisfiability problems with uncertainty
• On-line algorithms for satisfiability problems with uncertainty
• MedleySolver: online SMT algorithm selection
• Linear connectivity problems in directed hypergraphs

This page was built for publication: On-line algorithms for satisfiability problems with uncertainty

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