Plausibility measures and default reasoning

DOI10.1145/502090.502092zbMath1127.68438arXivcs/9808007OpenAlexW2081202140WikidataQ57233887 ScholiaQ57233887MaRDI QIDQ5441354

Nir Friedman, Joseph Y. Halpern

Publication date: 11 February 2008

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/9808007

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (35)

Two concepts of plausibility in default reasoning ⋮ Smoothing and Filtering with a Class of Outer Measures ⋮ A computationally grounded, weighted doxastic logic ⋮ A logic with approximate conditional probabilities that can model default reasoning ⋮ A Minimal Model Semantics for Nonmonotonic Reasoning ⋮ On a rule-based interpretation of default conditionals ⋮ Enabling local computation for partially ordered preferences ⋮ Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementation ⋮ Adaptively applying modus ponens in conditional logics of normality ⋮ Taxonomy of powerful voters and manipulation in the framework of social choice functions ⋮ On manipulation in merging epistemic states ⋮ Semantic characterization of rational closure: from propositional logic to description logics ⋮ The implicative conditional ⋮ Conditional ranking revision. Iterated revision with sets of conditionals ⋮ Comparative possibility in set contraction ⋮ Measure Logic ⋮ Preferential accessibility and preferred worlds ⋮ From KLM-style conditionals to defeasible modalities, and back ⋮ System JLZ -- rational default reasoning by minimal ranking constructions. ⋮ Conditional \(p\)-adic probability logic ⋮ Linguistic quantifiers modeled by Sugeno integrals ⋮ Weak nonmonotonic probabilistic logics ⋮ A modal logic for subjective default reasoning ⋮ Intricate axioms as interaction axioms ⋮ Probabilistic Approach to Nonmonotonic Consequence Relations ⋮ Preserving confidentiality while reacting on iterated queries and belief revisions ⋮ Independence and convergence in non-additive settings ⋮ Automated non-monotonic reasoning in System \textbf{P} ⋮ COMPLETENESS FOR COUNTER-DOXA CONDITIONALS – USING RANKING SEMANTICS ⋮ Local Computation Schemes with Partially Ordered Preferences ⋮ Theorem proving for conditional logics: CondLean and GOALDUCK ⋮ Default reasoning from conditional knowledge bases: Complexity and tractable cases ⋮ Editorial: Fuzzy set and possibility theory-based methods in artificial intelligence ⋮ Fuzzy \(rr\)DFCSP and planning ⋮ Revision by comparison

This page was built for publication: Plausibility measures and default reasoning