Approximate reasoning with credible subsets

DOI10.1080/095281397147022zbMath0885.68122OpenAlexW2091896120MaRDI QIDQ4371295

Eliezer L. Lozinskii

Publication date: 1 April 1998

Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/095281397147022

zbMATH Keywords

logical inferenceknowledge systems

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) General topics in artificial intelligence (68T01)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Average time analyses of simplified Davis-Putnam procedures
• Probabilistic logic
• A logic for default reasoning
• Counting propositional models
• The MOSIX distributed operating system. Load balancing for UNIX
• Information Theory and Statistical Mechanics
• The Pure Literal Rule and Polynomial Average Time
• An algorithm for region filling using two-dimensional grammars
• Generality in artificial intelligence
• Algorithms for testing the satisfiability of propositional formulae
• CNF-Satisfiability Test by Counting and Polynomial Average Time
• A simple test improves checking satisfiability
• Information and evidence in logic systems
• Is there an alternative to parsimonious semantics?
• Upper and Lower Probabilities Induced by a Multivalued Mapping
• A Computing Procedure for Quantification Theory