Probabilistic Satisfiability

By W. Spears. 1992

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Measuring and Improving Consistency in Pretrained Language Models (2021, background): “Consistency in knowledge bases (KBs) has been studied in theoretical frameworks in the context of the satisfiability problem and KB construction, and efficient algorithms for detecting inconsistencies in KBs have been proposed (Hansen and Jaumard, 2000; Andersen and Pretolani, 2001).”
Measuring Inconsistency in Probabilistic Knowledge Bases (2009, background): “Furthermore the authors of (Hansen and Jaumard, 1996; Andersen and Pretolani, 2001) are mainly interested in efficient algorithms for determining whether a knowledge base is inconsistent and not to what degree.”
Enriching a Model's Notion of Belief using a Persistent Memory (2021, methodology): “In the area of formal knowledge-bases (KBs), efficient algorithms have been developed for detecting, measuring, and resolving inconsistency (Hansen and Jaumard, 2000; Andersen and Pretolani, 2001; Thimm, 2009; Muiño, 2011; Thimm, 2013).”
Easy Cases of Probabilistic Satisfiability (2001, unknown): “Therefore, for these classes a polynomial algorithm for PSAT i s a vailable 11; this algorithm is, however, mainly of theoretical interest.”