scientific article; zbMATH DE number 4174344
From MaRDI portal
Publication:3198878
Recommendations
Cited in
(96)- Characterizing the principle of minimum cross-entropy within a conditional-logical framework
- Impediments to universal preference-based default theories
- The effect of knowledge on belief: Conditioning, specificity and the lottery paradox in default reasoning
- Inheritance comes of age: applying nonmonotonic techniques to problems in industry
- Lexicographic priorities in default logic
- The open logic and its relation to circumscription
- Computing improved optimal solutions to max-min flexible constraint satisfaction problems
- Nonmonotonic inference based on expectations
- Unifying default reasoning and belief revision in a modal framework
- Conditional logics of normality: A modal approach
- An argumentation framework in default logic
- Operational characterization of extensions in some logics for default reasoning
- Refinements of the maximum approach to decision-making in a fuzzy environment
- An abstract, argumentation-theoretic approach to default reasoning
- Explaining default intuitions using maximum entropy.
- Belief functions and default reasoning
- Default reasoning and belief revision: A syntax-independent approach
- Fundamental properties of attack relations in structured argumentation with priorities
- Classical logic, argument and dialectic
- A synthetic view of belief revision with uncertain inputs in the framework of possibility theory
- Abduction as belief revision
- Reasoning, nonmonotonicity and learning in connectionist networks that capture propositional knowledge
- About the incremental validation of first-order stratified knowledge-based decision-support systems
- Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints
- Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic
- Stratified belief bases revision with argumentative inference
- Connections between default reasoning and partial constraint satisfaction
- Judgment aggregation in nonmonotonic logic
- A generalized proof-theoretic approach to logical argumentation based on hypersequents
- A reconstruction of multipreference closure
- Simple contrapositive assumption-based argumentation. II: Reasoning with preferences
- A simple and non-trivial Ramsey test
- Qualitative probabilities for default reasoning, belief revision, and causal modeling
- PALO: a probabilistic hill-climbing algorithm
- Revealed preference in argumentation: algorithms and applications
- Lexicographically-ordered constraint satisfaction problems
- A review of the relations between logical argumentation and reasoning with maximal consistency
- Strong inconsistency
- On the graded acceptability of arguments in abstract and instantiated argumentation
- Approaches to measuring inconsistency for stratified knowledge bases
- Rich preference-based argumentation frameworks
- A consistency-based framework for merging knowledge bases
- Multi-modal nonmonotonic logics of minimal knowledge
- Revising possibilistic knowledge bases via compatibility degrees
- Modeling and reasoning with qualitative comparative clinical knowledge
- Preferences in artificial intelligence
- Data repair of inconsistent nonmonotonic description logic programs
- Adaptive logic characterizations of input/output logic
- scientific article; zbMATH DE number 4166919 (Why is no real title available?)
- scientific article; zbMATH DE number 4166920 (Why is no real title available?)
- Relaxing Ceteris Paribus Preferences with Partially Ordered Priorities
- Local Computation Schemes with Partially Ordered Preferences
- Knowledge Base Stratification and Merging Based on Degree of Support
- scientific article; zbMATH DE number 408782 (Why is no real title available?)
- Prioritized repairing and consistent query answering in relational databases
- Argumentation for practical reasoning: an axiomatic approach
- Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases
- An ASP approach for reasoning in a concept-aware multipreferential lightweight DL
- A glimpse on Gerhard Brewka's contributions to artificial intelligence
- Twenty-Five Years of Preferred Subtheories
- A fuzzy set approach to expressing preferences in spatial reasoning
- Explaining preferences and preferring explanations
- A structuralist theory of belief revision
- Possibilistic logic: a retrospective and prospective view
- Reasoning with partially ordered information in a possibilistic logic framework
- Merging operators on stratified belief bases equipped with argumentative inference
- Enabling local computation for partially ordered preferences
- Selecting accepted assertions in partially ordered inconsistent DL-Lite knowledge bases
- Sequential model-based diagnosis by systematic search
- Integrated preference argumentation and applications in consumer behaviour analyses
- On the measure of conflicts: Shapley inconsistency values
- Solving conflicts in information merging by a flexible interpretation of atomic propositions
- Tractable closure-based possibilistic repair for partially ordered DL-Lite ontologies
- Complexity and scalability of defeasible reasoning with typicality in many-valued weighted knowledge bases
- Compact representation of preferences
- On prediction in Theorist
- Closure-based tractable possibilistic inference from partially ordered DL-Lite ontologies
- How to tractably compute a productive repair for possibilistic partially ordered DL-Lite\(_{\mathcal{R}}\) ontologies?
- A general family of preferential belief removal operators
- A dialectical formalisation of preferred subtheories reasoning under resource bounds
- Complexity and scalability of defeasible reasoning in many-valued weighted knowledge bases with typicality
- Simple contrapositive assumption-based argumentation frameworks with preferences: partial orders and collective attacks
- Abstract argumentation frameworks with strong and weak constraints
- Representing states in iterated belief revision
- Conjoint axiomatization of Min, DiscriMin and LexiMin
- A new approach for preference-based argumentation frameworks
- Weakening conflicting information for iterated revision and knowledge integration
- \(\text{DA}^2\) merging operators
- A nonmonotonic observation logic
- Possibilistic uncertainty handling for answer set programming
- An axiomatic analysis of structured argumentation with priorities
- Carnapian structuralism
- Reasoning with prioritized information by iterative aggregation of distance functions
- Preference fusion for default reasoning beyond system Z
- Reasoning under inconsistency: a forgetting-based approach
- Disjunctive merging: quota and Gmin merging operators
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3198878)
