On-line algorithms for satisfiability problems with uncertainty
From MaRDI portal
Publication:673379
DOI10.1016/S0304-3975(96)00123-5zbMATH Open0874.68277MaRDI QIDQ673379FDOQ673379
Authors: Roberto Giaccio, Giorgio Ausiello
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
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
Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Logic in artificial intelligence (68T27)
Cites Work
- Fuzzy sets and systems. Theory and applications
- Fuzzy sets as a basis for a theory of possibility
- Fuzzy sets
- Title not available (Why is that?)
- Directed hypergraphs and applications
- A logic for default reasoning
- Non-monotonic logic. I
- Minimal Representation of Directed Hypergraphs
- Circumscription - a form of non-monotonic reasoning
- Title not available (Why is that?)
- On-line algorithms for polynomially solvable satisfiability problems
- On-line algorithms for satisfiability problems with uncertainty
- A new algorithm for the propositional satisfiability problem
- Dynamic maintenance of directed hypergraphs
- Nonmonotonic Logic II
- Title not available (Why is that?)
Cited In (6)
- Partially dynamic maintenance of minimum weight hyperpaths
- Approximate reasoning by similarity-based SLD resolution.
- Directed hypergraphs: introduction and fundamental algorithms -- a survey
- 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)