Penalty Logic and its Link with Dempster-Shafer Theory

Penalty logic, introduced by Pinkas [17], associates to each formula of a knowledge base the price to pay if this formula is violated. Penalties may be used as a criterion for selecting preferred consistent subsets in an inconsistent knowledge base, thus inducing a non-monotonic inference relation. A precise formalization and the main properties of penalty logic and of its associated nonmonotonic inference relation are given in the first part. We also show that penalty logic and Dempster-Shafer theory are related, especially in the infinitesimal case.

• Publication year

  1994

• Venue

  Conference on Uncertainty in Artificial Intelligence

• Publication date

  1994-07-29

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/B978-1-55860-332-5.50031-6arXiv 1302.6804
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Decision-Theoretic Abductive Basis for Planning*

  1994cited by this paper
• On the Complexity of Non-Monotonic Entailment in Syntax-Based Approaches

  1994cited by this paper
• Nonmonotonic Inference Based on Expectations

  1994cited by this paper
• Inconsistency Management and Prioritized Syntax-Based Entailment

  1993cited by this paper
• The complexity of logic-based abduction

  1993cited by this paper
• Uncertainty in Constraint Satisfaction Problems: a Probalistic Approach

  1993cited by this paper
• Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems

  1993cited by this paper
• Default Logic and Dempster-Shafer Theory

  1993cited by this paper
• Probability of Deductibility and Belief Functions

  1993cited by this paper
• A New Method for Solving Hard Satisfiability Problems

  1992cited by this paper
• On the complexity of propositional knowledge base revision, updates, and counterfactuals

  1992cited by this paper
• A New Method for Solving Hard Satis ability Problems

  1992cited by this paper
• Un modèle logique général pour le raisonnement révisable

  1992cited by this paper
• Propositional Non-Monotonic Reasoning and Inconsistency in Symmetric Neural Networks

  1991influential reference
• Belief Revision and Default Reasoning: Syntax-Based Approaches

  1991cited by this paper
• The Computational Complexity of Multiple-Context Truth Maintenance Systems

  1990cited by this paper
• Partial Constraint Satisfaction

  1989cited by this paper
• Preferred Subtheories: An Extended Logical Framework for Default Reasoning

  1989cited by this paper
• What does a Conditional Knowledge Base Entail?

  1989cited by this paper
• Hypothetical reasoning

  1989cited by this paper
• Ordinal Conditional Functions: A Dynamic Theory of Epistemic States

  1988cited by this paper
• A Computing Procedure for Quantification Theory

  1960cited by this paper

• Working Memory for Assessment Under Inconsistency

  2021cites this paper
• Logical and Evidential Inconsistencies Meet: First Steps

  2021cites this paper
• A correspondence between belief function combination and knowledge base merging

  2019cites this paper
• Towards a Reconciliation Between Reasoning and Learning - A Position Paper

  2019cites this paper
• On Cautiousness and Expressiveness in Interval-Valued Logic

  2019cites this paper
• New Complexity Results on Aggregating Lexicographic Preference Trees Using Positional Scoring Rules

  2019cites this paper
• Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations

  2019cites this paper
• Penalty Logic-Based Representation of C-Revision

  2019cites this paper
• Human-in-the-Loop Learning of Qualitative Preference Models

  2019cites this paper
• Learning Optimal and Near-Optimal Lexicographic Preference Lists

  2019cites this paper
• Generalized possibilistic logic: Foundations and applications to qualitative reasoning about uncertainty

  2017cites this paper
• Graphical preference representation under a possibilistic framework

  2017cites this paper
• Learning Possibilistic Logic Theories from Default Rules

  2016cites this paper
• Practical Methods for Constructing Possibility Distributions

  2016cites this paper
• Interpretable Encoding of Densities Using Possibilistic Logic

  2016cites this paper
• Preferences in artificial intelligence

  2016cites this paper
• Computing multiple c-revision using OCF knowledge base

  2016cites this paper
• MODELING, LEARNING AND REASONING ABOUT PREFERENCE TREES OVER COMBINATORIAL DOMAINS

  2016cites this paper
• The Emergence of Fuzzy Sets: A Historical Perspective

  2016cites this paper
• Who is watching you eat?: a noir preferences thriller

  2015cites this paper
• Constructing Markov Logic Networks from First-Order Default Rules

  2015cites this paper
• Possibilistic Conditional Preference Networks

  2015cites this paper
• Beyond Theory and Data in Preference Modeling: Bringing Humans into the Loop

  2015cites this paper
• Encoding Markov logic networks in Possibilistic Logic

  2015cites this paper
• Possibilistic Logic - An Overview

  2014cites this paper
• Who is Watching You Eat?

  2014cites this paper
• Visions of a generalized probability theory

  2014cites this paper
• Low : ! Beer > Wine > Liquor ! Liquor : ! Steak + Dessert ! Wine : ! Fish + Salad ! Beer : ! Appetizer + Burger ! Companion ! Location ! Spend ! Food ! Drink !

  2014cites this paper
• DIDIER DUBOIS AND HENRI PRADE

  2014cites this paper
• Weighted logics for artificial intelligence - an introductory discussion

  2014cites this paper
• Quantitative possibility theory: logical- and graphical-based representations†

  2014cites this paper
• Dempster-Shafer Theory with Smoothness

  2013cites this paper
• Weight-based consistent query answering over inconsistent $${\mathcal {SHIQ}}$$ knowledge bases

  2013cites this paper
• Preference Representation Languages

  2011cites this paper
• Solving conflicts in information merging by a flexible interpretation of atomic propositions

  2011influential citation
• Preferences in AI: An overview

  2011cites this paper
• Transformations around quantitative possibilistic logic

  2011cites this paper
• More than the sum of its parts : compact preference representation over combinatorial domains

  2009cites this paper
• Representing Utility Functions via Weighted Goals

  2009cites this paper
• Logical formalisms for representing bipolar preferences

  2008cites this paper
• Scenario Update Applied to Causal Reasoning

  2008cites this paper
• Two routes for bipolar information processing, and a blind spot in between

  2008cites this paper
• A new semantics for ACL based on commitments and penalties

  2008cites this paper
• How to Choose Weightings to Avoid Collisions in a Restricted Penalty Logic

  2008influential citation
• A new semantics for ACL based on commitments and penalties

  2008cites this paper
• Reasoning with various kinds of preferences: logic, non-monotonicity, and algorithms

  2008cites this paper
• Modélisation des interactions entre agents rationnels : les jeux booléens. (Modelisation of interactions between rational agents: Boolean games)

  2007cites this paper
• Mise à jour de scénario appliquée au raisonnement causal ∗ Scenario update applied to causal reasoning

  2007cites this paper
• Approximation of Conditional Preferences Networks fiCP-netsfl in Possibilistic Logic

  2006cites this paper
• Expressive Power of Weighted Propositional Formulas for Cardinal Preference Modeling

  2006cites this paper
• Logical representation of preference: a brief survey

  2006cites this paper
• Bipolar possibility theory in preference modeling: Representation, fusion and optimal solutions

  2006cites this paper
• Propositional distances and compact preference representation

  2005cites this paper
• Soft constraint processing

  2005cites this paper
• Product-based Causal Networks and Quantitative Possibilistic Bases

  2005cites this paper
• Neural networks, penalty logic and optimality theory

  2005cites this paper
• Expressive Power and Succinctness of Propositional Languages for Preference Representation

  2004cites this paper
• Compiling propositional weighted bases

  2004cites this paper
• Quasi-Possibilistic Logic and its Measures of Information and Conflict

  2003cites this paper
• Logical representation and fusion of prioritized information based on guaranteed possibility measures: Application to the distance-based merging of classical bases

  2003cites this paper
• Explaining default intuitions using maximum entropy

  2003cites this paper
• Handling Locally Stratified Inconsistent Knowledge Bases

  2002cites this paper
• Propositional Distances and Preference Representation

  2001cites this paper
• A Priori Revision

  2001cites this paper
• Conference paper assignment

  2001cites this paper
• Réseaux de contraintes

  2000cites this paper
• Validation and Refinement versus Revision

  1999cites this paper
• Infinitesimal Theories of Uncertainty for Plausible Reasoning

  1998cites this paper
• Reasoning Under Inconsistency Based on Implicitly-Specified Partial Qualitative Probability Relations: A Unified Framework

  1998cites this paper
• Reasoning About Unpredicted Change and Explicit Time

  1997cites this paper
• Belief functions and default reasoning

  1995cites this paper
• J´erˆome Lang’s Contributions at the Interface of Economic Theory with Artificial Intelligence

  year unknowncites this paper