Scalable Uncertainty Management
5th International Conference, SUM 2011, Dayton, OH, USA, October 10-13, 2011, Proceedings
Published on 7. October 2011
XII, 562 pages
978-3-642-23963-2 (ISBN)
Description
This book constitutes the refereed proceedings of the 5th International Conference on Scalable Uncertainty Management, SUM 2011, held in Dayton, OH, USA, in October 2011. The 32 revised full papers and 3 revised short papers presented together with the abstracts of 2 invited talks and 6 "discussant" contributions were carefully reviewed and selected from 58 submissions. The papers are organized in topical sections on argumentation systems, probabilistic inference, dynamic of beliefs, information retrieval and databases, ontologies, possibility theory and classification, logic programming, and applications.
More details
Other editions
Additional editions
Salem Benferhat | John Grant
Scalable Uncertainty Management
5th International Conference, SUM 2011, Dayton, OH, USA, October 10-13, 2011, Proceedings
Book
09/2011
1st Edition
Springer
€53.49
Shipment within 7-9 days
Content
- Title page
- Preface
- Organization
- Table of Contents
- Invited Talks
- Causality, Responsibility, and Blame: A Structural-Model Approach
- Fuzzy Logic, Annotation Domains and Semantic Web Languages
- Introduction
- Semantic Web Languages: Overview
- Mathematical Fuzzy Logic Basics
- Fuzzy Logic and Semantic Web Languages
- Fuzzy RDFS
- Fuzzy OWL
- Fuzzy RIF
- Conclusions
- References
- Discussant Contributions
- Logic Programming and Uncertainty
- Introduction
- Logical Uncertainty in Logic Programming
- Answer Sets and Use of Classical Negation
- Other Logic Programming Languages and Systems for Expressing Logical Uncertainty
- Multi-valued and Quantitative Uncertainty in Logic Programming
- Logic Programming with Probabilities
- Logic Programming with Probabilities, Causality and Generalized Updates: P-log
- Conclusion and Future Directions
- References
- Evaluating Probabilistic Inference Techniques: A Question of "When," not "Which"
- Introduction
- Background Knowledge
- Bayesian Networks
- Variable Elimination
- Arc Reversal
- Join Tree Propagation
- ``When'' versus ``Which''
- Using Multiple Algorithms for Message Construction
- Using Multiple Heuristics for Determining AR Orderings
- Knowing ``When:'' Semantics of Intermediate Factors
- Conclusion and Future Work
- References
- Probabilistic Logic Networks in a Nutshell
- Introduction: What is PLN?
- Relationship of PLN to Other Uncertain Inference Engines
- Knowledge Representation within PLN
- Core FOPLN Relationships
- Auxiliary FOPLN Relationships
- PLN Truth Values
- PLN Rules and Formulas
- Higher-Order PLN
- Reducing HOPLN to FOPLN
- PLNandAI
- SRAM
- PLN's Relationship to OpenCog
- Conclusion and Future Research Directions
- References
- Dynamics of Beliefs
- Introduction
- Preliminaries
- Revision
- Update
- Merging
- On the Links between Revision, Update and Merging
- Revision vs Update
- Revision vs Merging
- Other Belief Change Operators
- Confluence Operators
- Extrapolation and Approaches Based on Sequences of Observations
- Belief Negotiation
- PrioritizedMerging Operators
- Belief Change in Other Representational Frameworks
- Dynamics of Horn Bases
- Merging of First Order Bases
- Merging of Qualitative Constraint Networks
- Dynamics of Argumentation Frameworks
- Conclusion
- References
- Fuzzy Classifiers - Opportunities and Challenges
- Introduction
- Issues to Address When Constructing a Classifier
- Selection of the Decision Rule (Class Boundary)
- Attribute Selection
- Aggregation across Several Attributes
- Evaluation of Classifiers
- Fuzzy Classifiers
- Opportunities and Challenges for Fuzzy Classifiers
- Error Models for Fuzzy Classifiers
- Conclusions
- References
- A Brief Overview of Research in Argumentation Systems
- Introduction and General Intuitions
- Abstract Argumentation Frameworks
- Arguments with Structure
- Logical Argumentation
- Defeasible Logic Programming (DeLP)
- Other Approaches
- Research Challenges
- Research Context
- References
- Argumentation Systems
- Maximal Ideal Recursive Semantics for Defeasible Argumentation
- Introduction and Motivation
- Preliminaries on RP-DeLP
- Maximal Ideal Output of an RP-DeLP Program
- On the Computation of the Maximal Ideal Output
- SAT Encodings for Finding Warranted Literals
- Looking for Almost Valid Arguments
- Looking for Collective Conflicts
- Conclusions and Future Work
- References
- Argumentation Frameworks as Constraint Satisfaction Problems
- Introduction
- Constraint Satisfaction Problems (CSPs)
- Abstract Frameworks
- Dung's Framework
- Computing Dung's Semantics by CSPs
- Constrained Frameworks
- Basic Definitions
- Mappings into CSPs
- Preference-Based Frameworks
- Related Work
- Conclusion
- References
- On the Equivalence of Logic-Based Argumentation Systems
- Introduction
- Logic-Based Argumentation Systems
- Basic Equivalence of Argumentation Systems
- Strong Equivalence of Argumentation Systems
- Dynamics of Argument Status
- Extending an AS by New Argument(s)
- Removing Argument(s) from an AS
- Conclusion
- References
- Bipolarity in Argumentation Graphs: Towards a Better Understanding
- Introduction
- Background on Abstract Argumentation Frameworks
- Dung Argumentation Framework
- Bipolar Argumentation Framework
- Modelling Various Kinds of Support
- A Need for Specialization of Support
- A Framework for a Comparative Study of Various Supports
- Conclusions and Future Works
- References
- Handling Enthymemes in Time-Limited Persuasion Dialogs
- Introduction
- Arguments and Enthymemes
- A Protocol for Persuasion Dialogs
- A Protocol for Time-Limited Persuasion Dialogs
- Concluding Remarks
- References
- Argumentation Frameworks with Necessities
- Motivation
- Preliminaries
- Answer Sets and -Answer Sets for LPs
- Dung's Argumentation Frameworks
- Bipolar AFs with Necessities
- Adaptation of Acceptability Semantics to AFNs
- AFN as a Classical AF
- AFN and Logic Programs
- Generalized Argumentation Frameworks with Necessities
- Discussion and Related Work
- References
- A Heuristics-Based Pruning Technique for Argumentation Trees
- Introduction and Motivation
- Theoretical Basis
- An Approach to Argument Strength
- Building Dialectical Bonsai
- Empirical Results
- Discussion
- Related Work
- References
- On Warranted Inference in Argument Trees Based Framework
- Introduction
- A Brief Background on Logical Argumentation
- A Refresher on Coherence-Based Approaches from Flat Belief Bases
- Warranted Inference Properties
- A New Class of Counter-Arguments
- Rational Warranted Inference Properties
- Weighted R-warranted Inference
- Discussion and Perspectives
- References
- Probabilistic Inference
- Uncertainty Handling in Quantitative BDD-Based Fault-Tree Analysis by Interval Computation
- Introduction
- Dependability Studies and Fault-Tree Analysis
- The Probability of a Boolean Formula
- Interval Arithmetic and Interval Analysis
- Naive Interval Computations and Logical Dependency
- Interval Analysis Applied to BDDs
- Beyond Two Variables
- Algorithm for Interval Analysis Applied to BDDs
- Application to Fault-Tree Analysis
- Case Study
- Conclusion
- References
- A Branching Time Logic with Two Types of Probability Operators
- Introduction
- Syntax and Semantics
- Axiomatization
- Completeness
- Related Work
- Conclusion and Future Work
- References
- A Partition-Based First-Order Probabilistic Logic to Represent Interactive Beliefs
- Introduction
- Related Work
- Probabilistic First-Order Logic to Represent Interactive Beliefs
- Level 0 Beliefs
- Level 1 Beliefs
- Level n Beliefs
- Conclusion and Future Work
- References
- Patterns Discovery for Efficient Structured Probabilistic Inference
- Introduction
- Description of PRMs
- Structured Inference
- PRM's Patterns Discovery
- Problem and Complexity
- An Approximate Algorithm
- Pruning Rules
- Experimental Results
- Conclusion
- References
- Indirect Elicitation of NIN-AND Trees in Causal Model Acquisition
- Introduction
- NIN-AND Tree Causal Models
- Acquisition of NIN-AND Tree Models
- Generate NIN-AND Tree by Structure Elimination
- Generate NIN-AND Tree by Pairwise Causal Interaction
- Experimental Setup
- Experimental Results
- Simulation Study
- Conclusion
- References
- Dynamic of Beliefs
- Change in Argumentation Systems: Exploring the Interest of Removing an Argument
- Introduction
- Illustrative Example
- Presentation of the Game
- Arguments of the Prosecutor
- Arguments of the Defense
- The Oral Hearing in Front of the Court
- Formal Framework
- First Steps towards a Decision of Removal
- Some Properties Concerning ``Monotony''
- Some Properties of the Expansive Change
- Some Properties of the Narrowing Change
- Discussion and Conclusion
- References
- Incorporating Domain Knowledge and User Expertise in Probabilistic Tuple Merging
- Introduction
- Basics
- Probabilistic Tuples
- Duplicate Elimination
- Domain Knowledge and User Expertise
- Methods for Incorporating External Knowledge
- Aggregation Functions
- Knowledge Rules
- Instance Weights
- Extended Approach for Probabilistic Tuple Merging
- Scalability
- Characteristics of Merging Approaches
- Related Work
- Conclusion
- References
- Qualitative Reasoning about Incomplete Categorization Rules Based on Interpolation and Extrapolation in Conceptual Spaces
- Introduction
- A Functional View on Propositional Knowledge
- Mappings between Attribute Spaces
- Mappings between Conceptual Spaces
- Basic Interpolative Reasoning
- Betweenness
- Semantic Characterization
- Syntactic Characterization
- Refinements and Extrapolative Reasoning
- Related Work
- Conclusions
- References
- A Change Model for Credibility Partial Order
- Introduction and Motivation
- Representation of Informant Credibility Relations
- Change Operators for Credibility Partial Order
- Expansion Operator for Credibility
- Contraction Operator for Credibility
- Revision Operator for Credibility
- Conclusions and Future Work
- References
- Conflict-Aware Historical Data Fusion
- Introduction
- Background and Related Work
- Problems in Historical Data Fusion
- Conflict-Aware Fusion of Historical Data
- Measuring Conflict Degree
- Conflict-Aware Data Fusion
- Conflict-Aware Data Warehousing
- Conclusion
- References
- Information Retrieval and Databases
- Extended Galois Derivation Operators for Information Retrieval Based on Fuzzy Formal Concept Lattice
- Introduction
- Formal Concept Analysis: A Survey
- Classical Settings
- Possibility-Theoretic View of Formal Concept Analysis
- Extending Possibilistic Derivation Operators to the Fuzzy Setting
- Flexible Querying Based of Fuzzy Formal Concepts
- Conjunctive Queries
- Disjunctive Queries
- Negation in Queries
- Illustrative Example
- Conclusion
- References
- Processing Fuzzy Queries in a Peer Data Management System Using Distributed Fuzzy Summaries
- Introduction
- Fuzzy Queries
- Summarizing a Relation
- The Labelling Step
- Fusion Step and Computation of Fuzzy Cardinalities
- Constructing the Summary of a Data Source
- Estimating the Relevance of a Data Source
- Principle of the Approach
- Single Predicate Case
- Case of a Conjunctive Fuzzy Query
- Application Scenario
- The X-Peer Architecture
- Processing Strategy
- Experimentation
- Related Work
- Fuzzy Queries
- Top-k and Skyline Queries
- Conclusion
- References
- Embedding Forecast Operators in Databases
- Introduction
- Motivating Examples
- Basic Notation
- Forecast Operator
- Deterministic Forecast Operator
- Probabilistic Forecast Operator
- Possible Worlds Forecast Operator
- Query Answering with Forecasting Operators
- Related Work and Conclusions
- References
- Ontologies
- Investigating Ontological Similarity Theoretically with Fuzzy Set Theory, Information Content, and Tversky Similarity and Empirically with the Gene Ontology
- Introduction
- Similarity Measurement
- Synthesizing Ontological Similarity
- Information Content in Ontologies
- A Synthesis of Fuzzy Set Compatibility Measures, Information Content, and Tverksy's Similarity Models
- Recent Ontological Similarity Based on Intuitive Uses of Tversky's Models
- Empirical Investigations Using the Gene Ontology
- Conclusions and Future Work
- References
- Answering Threshold Queries in Probabilistic Datalog+/- Ontologies
- Introduction
- Preliminaries
- Guarded Datalog±
- Markov Logic Networks
- Syntax and Semantics of Probabilistic Guarded Datalog
- Syntax
- Semantics
- Algorithms for Answering Threshold Queries
- A Basic Algorithm
- An Annotated Chase Graph-Based Algorithm
- Related Work
- Summary and Outlook
- References
- Coherent Top-k Ontology Alignment for OWL EL
- Introduction
- Description Logics
- Coherent Ontology Alignment
- Greedy Coherent Top-k Alignment
- Optimal Coherent Top-k Alignment
- Experimental Evaluation
- Experimental Set-Up
- Results of the Evaluation
- Conclusion and Future Work
- References
- Possibility Theory and Classification
- Generalized Possibilistic Logic
- Introduction
- Semantics of Possibilistic Logic Constraints
- Inference in Generalized Possibilistic Logic
- Concluding Remarks
- References
- Transformations around Quantitative Possibilistic Logic
- Introduction
- Logical Frameworks for Uncertain Knowledge
- Quantitative Possibilistic Logic
- Penalty Logic
- Graphical Frameworks for Uncertain Knowledge
- Product-Based Possibilistic Networks
- UCP-Networks
- Logical Encoding of Product-Based Possibilistic Networks
- Transformations around Quantitative Possibility Theory
- Encoding Quantitative Possibilistic Base to Penalties
- From UCP Networks to Possibilistic Product-Based Graph
- From Possibilistic Product-Based Graph to UCP Networks
- Relating UCP-Networks and Penalty Logic
- Conclusion
- References
- Imprecise Regression Based on Possibilistic Likelihood
- Introduction
- Background on Possibility Theory
- Possibility Distribution
- Possibility Distribution as a Family of Probability Distributions
- Probability to Possibility Transformation
- Possibilistic Likelihood
- Definition of a Likelihood Function
- Triangular Distribution
- Imprecise Regression Framework
- Definition
- Algorithm
- Properties of Triangular Possibility Distributions
- Related Works
- Experimentations
- Discussion and Conclusion
- References
- Possibilistic Network-Based Classifiers: On the Reject Option and Concept Drift Issues
- Introduction
- Possibility Theory and Possibilistic Network Classifiers
- Possibility Theory: A Brief Refresher
- Possibilistic Networks
- Possibilistic Network Classifiers
- Classification with Reject Option
- Classifiers' Confidence and Reject Option
- Distance Reject
- Ambiguity Reject
- Inputs' Incompleteness Reject
- Concept Drift as a Belief Revision Process
- Jeffrey's Revision Rule
- Concept Drift and Revising a Naive Possibilistic Classifier
- Summary and Conclusions
- References
- Logic Programming
- Weak and Strong Disjunction in Possibilistic ASP
- Introduction
- Preliminaries
- Answer Set Programming
- Possibilistic Logic
- Possibilistic Normal ASP
- Strong Possibilistic Semantics
- Weak Possibilistic Semantics
- Related Work
- Conclusion
- References
- t-DeLP: A Temporal Extension of the Defeasible Logic Programming Argumentative Framework
- Introduction
- Knowledge Representation
- t-DeLP: Defeasible Logic with (discrete) Time
- Nature Does Not Wait: Eager Arguments
- Conclusions and Future Work
- References
- Learning to Act Optimally in Partially Observable Markov Decision Processes Using Hybrid Probabilistic Logic Programs
- Introduction
- Syntax and Semantics of NHPLP
- The Language of $NHPLP_PO$
- Probabilistic Answer Set Semantics of $NHPLP_PO$
- Partially Observable Markov Decision Processes
- APO an Action Language for POMDP
- Syntax of APO
- Semantics of APO
- Reinforcement Learning in NHPLPPO
- Correctness
- Reinforcement Learning Using Answer Set Programming
- Conclusions and Related Work
- References
- Applications
- ChaseT: A Tool for Checking Chase Termination
- Introduction
- System Description
- Application Scenario
- Conclusion
- References
- Swapping-Based Partitioned Sampling for Better Complex Density Estimation: Application to Articulated Object Tracking
- Introduction
- Exploiting Conditional Independences for Tracking
- Proposed Approach
- Partitioned Sampling (PS)
- Swapping-Based Partition Sampling (SBPS)
- Experimental Results
- Conclusion
- References
- A Fuzzy-Based Approach to the Value of Information in Complex Military Environments
- Introduction
- Understanding the Domain Challenge
- Related VOI Challenges
- Approach
- Conclusion
- References
- Handling Sequential Observations in Intelligent Surveillance
- Introduction
- Preliminaries
- The Revised Situation Calculus Framework
- Belief Revision
- Example
- Conclusion
- References
- Author Index
