On-line algorithms for satisfiability problems with uncertainty

DOI10.1016/S0304-3975(96)00123-5zbMath0874.68277MaRDI QIDQ673379

Roberto Giaccio, Giorgio Ausiello

Publication date: 28 February 1997

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

zbMATH Keywords

algorithmsuncertaintyhypergraphsHorn formulaon-line satisfiabilityreasoning in knowledge bases

Mathematics Subject Classification ID

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

Related Items (5)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On-line algorithms for satisfiability problems with uncertainty
• Dynamic maintenance of directed hypergraphs
• A logic for default reasoning
• Circumscription - a form of non-monotonic reasoning
• Non-monotonic logic. I
• Fuzzy sets and systems. Theory and applications
• Fuzzy sets as a basis for a theory of possibility
• Directed hypergraphs and applications
• A new algorithm for the propositional satisfiability problem
• Minimal Representation of Directed Hypergraphs
• Nonmonotonic Logic II
• On-line algorithms for polynomially solvable satisfiability problems
• Fuzzy sets

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