Another perspective on default reasoning
From MaRDI portal
Publication:1924825
DOI10.1007/BF01535841zbMATH Open0857.68096OpenAlexW1973899684MaRDI QIDQ1924825FDOQ1924825
Publication date: 20 October 1996
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01535841
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nonmonotonic reasoning, preferential models and cumulative logics
- What does a conditional knowledge base entail?
- A logic for default reasoning
- A logical framework for default reasoning
- Some representational issues in default reasoning
- Counterfactuals
Cited In (73)
- A preferential interpretation of multilayer perceptrons in a conditional logic with typicality
- Approximations of system W between c-inference, system Z, and lexicographic inference
- Reasoning about Exceptions in Ontologies: from the Lexicographic Closure to the Skeptical Closure
- Characterizing multipreference closure with system W
- Compact representation of preferences
- Defeasible RDFS via rational closure
- Dynamic Reasoning Systems
- Complexity and scalability of defeasible reasoning with typicality in many-valued weighted knowledge bases
- Rational closure extension in SPO-representable inductive inference operators
- Splitting techniques for conditional belief bases in the context of c-representations
- Weighted conditional \(\mathscr{EL}^\bot\) knowledge bases with integer weights: an ASP approach
- Preferential reasoning for modal logics
- Robust reasoning with rules that have exceptions: From second-order probability to argumentation via upper envelopes of probability and possibility plus directed graphs
- Approximate coherence-based reasoning
- Probabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in SystemP
- Properties of system W and its relationships to other inductive inference operators
- Parallel belief revision: revising by sets of formulas
- Typicalities and probabilities of exceptions in nonmotonic description logics
- On rational entailment for propositional typicality logic
- A THEORETICAL FRAMEWORK FOR POSSIBILISTIC INDEPENDENCE IN A WEAKLY ORDERED SETTING
- A general family of preferential belief removal operators
- Modeling and reasoning with qualitative comparative clinical knowledge
- A framework for reasoning under uncertainty based on non-deterministic distance semantics
- Simplified forms of computerized reasoning with distance semantics
- A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure
- An ASP Approach for Reasoning on Neural Networks under a Finitely Many-Valued Semantics for Weighted Conditional Knowledge Bases
- Complexity and Cautiousness Results for Reasoning from Partially Preordered Belief Bases
- An ASP approach for reasoning in a concept-aware multipreferential lightweight DL
- The Non-archimedean Polynomials and Merging of Stratified Knowledge Bases
- The dynamics of default reasoning
- Reasoning with prioritized information by iterative aggregation of distance functions
- Introduction: Progress in formal commonsense reasoning
- Explaining default intuitions using maximum entropy.
- Adaptively applying modus ponens in conditional logics of normality
- Preferential accessibility and preferred worlds
- A new default theories compilation for MSP-entailment
- Preference fusion for default reasoning beyond system Z
- Alternative approaches to default logic
- Qualitative choice logic
- Situated conditional reasoning
- Weakening conflicting information for iterated revision and knowledge integration
- System JLZ -- rational default reasoning by minimal ranking constructions.
- Dependencies Between Players in Boolean Games
- Default extensions: Dealing with computer information
- Belief functions and default reasoning
- ASP for minimal entailment in a rational extension of SROEL
- On the KLM properties of a fuzzy DL with typicality
- On the logical properties of the nonmonotonic description logic \(\mathcal{DL}^{\operatorname{N}}\)
- Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementation
- Automated non-monotonic reasoning in System \textbf{P}
- A reconstruction of multipreference closure
- Uncertain inheritance and recognition as probabilistic default reasoning
- Dependencies between players in Boolean games
- Default reasoning from conditional knowledge bases: Complexity and tractable cases
- Universal Logic as a Science of Patterns
- Contextual rational closure for defeasible \(\mathcal{ALC} \)
- Weighted defeasible knowledge bases and a multipreference semantics for a deep neural network model
- New tractable classes for default reasoning from conditional knowledge bases
- The lexicographic closure as a revision process
- The W systems: between maximum entropy and minimal ranking…
- Handling uncertainty and defeasibility in a possibilistic logic setting
- Probabilistic description logic programs under inheritance with overriding for the semantic Web
- Expressive probabilistic description logics
- Twenty-Five Years of Preferred Subtheories
- Nonmonotonic reasoning, conditional objects and possibility theory
- Weak nonmonotonic probabilistic logics
- Managing software requirements changes based on negotiation-style revision
- Probabilistic logic under coherence, conditional interpretations, and default reasoning
- Nonmonotonic probabilistic reasoning under variable-strength inheritance with overriding
- System J — Revision entailment
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a rule-based interpretation of default conditionals
This page was built for publication: Another perspective on default reasoning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1924825)
