On-line algorithms for satisfiability problems with uncertainty

DOI10.1007/3-540-59071-4_62zbMath1528.68412MaRDI QIDQ6184384

Roberto Giaccio

Publication date: 5 January 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Hypergraphs (05C65) Classical propositional logic (03B05) Online algorithms; streaming algorithms (68W27) Computational aspects of satisfiability (68R07)

Cites Work

• 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
• Minimal Representation of Directed Hypergraphs
• Nonmonotonic Logic II
• On-line algorithms for polynomially solvable satisfiability problems
• Fuzzy sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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