Approximate reasoning with credible subsets

DOI10.1080/095281397147022MaRDI QIDQ4371295zbMATH OpenOpenAlexFDO

Authors 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

knowledge systemslogical inference

Mathematics Subject Classification ID

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

Recommendations

• On the hardness of approximate reasoning
• scientific article; zbMATH DE number 1149406
• Tractable reasoning in artificial intelligence
• The Complexity of Circumscriptive Inference in Post’s Lattice
• The complexity of circumscriptive inference in Post's lattice

Cites work

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

Cited in

(2)

• Speeding up inferences using relevance reasoning: a formalism and algorithms
• scientific article; zbMATH DE number 1728396 (Why is no real title available?)

This page was built for publication: Approximate reasoning with credible subsets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371295)