Managing Uncertainty and Vagueness in Description Logics, Logic Programs and Description Logic Programs

Straccia, Umberto

doi:10.1007/978-3-540-85658-0_2

Cited by 51 publications

(46 citation statements)

References 197 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, as with its predecessors, this system also depends on mature and established domain knowledge, and uses fuzzy rule-based reasoning [13], which follows an exact matching approach.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

DC Proposal: Decision Support Methods in Community-Driven Knowledge Curation Platforms

Paul

2011

The Semantic Web – ISWC 2011

View full text Add to dashboard Cite

Abstract. Skeletal dysplasias comprise a group of genetic diseases characterized by highly complex, heterogeneous and sparse data. Performing efficient and automated knowledge discovery in this domain poses serious challenges, one of the main issues being the lack of a proper formalization. Semantic Web technologies can, however, provide the appropriate means for encoding the knowledge and hence enabling complex forms of reasoning. We aim to develop decision support methods in the skeletal dysplasia domain by applying uncertainty reasoning over Semantic Web data. More specifically, we devise techniques for semi-automated diagnosis and key disease feature inferencing from an existing pool of patient cases -that are shared and discussed in the SKELETOME community-driven knowledge curation platform. The outcome of our research will enable clinicians and researchers to acquire a critical mass of structured knowledge that will sustain a better understanding of these genetic diseases and foster advances in the field.

show abstract

“…However, as with its predecessors, this system also depends on mature and established domain knowledge, and uses fuzzy rule-based reasoning [13], which follows an exact matching approach.…”

Section: Related Workmentioning

confidence: 99%

“…Similarly, in [16], the authors present a medical expert system for heart failure. These expert systems use general purpose rule base reasoning (deductive reasoning) [13] because the underlying domain has well-defined rules and a mature background knowledge.…”

Section: Related Workmentioning

confidence: 99%

DC Proposal: Decision Support Methods in Community-Driven Knowledge Curation Platforms

Paul

2011

The Semantic Web – ISWC 2011

View full text Add to dashboard Cite

show abstract

“…For example, reasoning based on a possibilistic knowledge base uses only the part of knowledge one is most sure of [24]. "Possibilistic logic may especially be used for encoding user preferences, since possibility measures can actually be viewed as rankings (on worlds or also objects) along an ordinal scale" [93]. One preliminary investigation of the potentials of possibilistic logic in the representation and combination of preferences in decision analysis can be found in [4].…”

Section: Models Based On Non-standard Logicsmentioning

confidence: 99%

“…Manyvalued logics have been extended and applied in many fields, e.g., Kleene's three-valued logic is used in [74] for representing and reasoning with temporal information, and a new symbolic approach to representation of imprecise (or fuzzy) information has been proposed in [10] based on a symbolic many-valued logic. A more complete list of categorized references for the management of imperfect information can be found in [62,93].…”

Section: Models Based On Non-standard Logicsmentioning

confidence: 99%

On the combination of logical and probabilistic models for information analysis

et al. 2011

View full text Add to dashboard Cite

Formal logical tools are able to provide some amount of reasoning support for information analysis, but are unable to represent uncertainty. Bayesian network tools represent probabilistic and causal information, but in the worst case scale as poorly as some formal logical systems and require specialized expertise to use effectively. We describe a framework for systems that incorporate the advantages of both Bayesian and logical systems. We define a formalism for the conversion of automatically generated natural deduction proof trees into Bayesian networks. We then demonstrate that the merging of such networks with domain-specific causal models forms a consistent Bayesian network with correct values for the formulas derived in the proof. In particular, we show that hard evidential updates in which the premises of a proof are found to be true force the conclusions of the proof to be true with probability one, regardless of any dependencies and prior probability values assumed for the causal model. We provide several examples that demonstrate the generality of the natural deduction system by using inference schemes not supportable directly in Horn clause logic. We compare our approach to other ones, including some that use non-standard logics.

show abstract

“…We next consider the usual notion of interpretation and generalize the notion of satisfiability (see, e.g., [46]) to our setting. An interpretation is a mapping I from ground atoms to members of L. For a ground atom A, I(A) indicates the degree of truth to which A is true under I.…”

Section: Min(a(x Y) B(y Z)) · Max(¬r(z) 07) + G(x) Is a Formulamentioning

confidence: 99%

On Fixed-Points of Multivalued Functions on Complete Lattices and Their Application to Generalized Logic Programs

Straccia¹,

Ojeda‐Aciego²,

Damásio³

2009

SIAM J. Comput.

Self Cite

View full text Add to dashboard Cite

Abstract. Unlike monotone single-valued functions, multivalued mappings may have zero, one, or (possibly infinitely) many minimal fixed-points. The contribution of this work is twofold. First, we overview and investigate the existence and computation of minimal fixed-points of multivalued mappings, whose domain is a complete lattice and whose range is its power set. Second, we show how these results are applied to a general form of logic programs, where the truth space is a complete lattice. We show that a multivalued operator can be defined whose fixed-points are in one-to-one correspondence with the models of the logic program. The topic of this work is the overview and investigation of the fixed-points of multivalued functions f : L → 2 L (multivalued functions are also called correspondences, or set-valued functions, in the literature). Such functions naturally arise, e.g., in the specification of the semantics of nondeterministic programming languages [7,8,11,18,31,36,37,44], in game theory [6,33,45,53], and in disjunctive logic programming [22,27,32,42,52]; those of the latter case motivated our work. Informally, (i) in the first case, the meaning of a nondeterministic 1 program P may be seen as a function p : S → 2 S , where S is the set of states a program may assume. The image of p is a finite nonempty set, as at a given step of a program execution, due to a nondeterministic statement, more than one successive state is possible. The semantics of a program is then related to the fixed-points of such functions (s ∈ p(s)); (ii) in the second case, a game is represented as a function g : S → 2 S , where S is the strategy space of the involved players, and fixed-points (s ∈ g(s)) are related to the so-called Nash equilibria of the game. The image of g is a nonempty (usually finite) set, as at each step of the game, more than one incomparable strategic choice is possible; and

show abstract

Managing Uncertainty and Vagueness in Description Logics, Logic Programs and Description Logic Programs

Abstract: Abstract. Managing uncertainty and/or vagueness is starting to play an important role in Semantic Web representation languages. Our aim is to overview basic concepts on representing uncertain and vague knowledge in current Semantic Web ontology and rule languages (and their combination).

Cited by 51 publications

References 197 publications

DC Proposal: Decision Support Methods in Community-Driven Knowledge Curation Platforms

DC Proposal: Decision Support Methods in Community-Driven Knowledge Curation Platforms

On the combination of logical and probabilistic models for information analysis

On Fixed-Points of Multivalued Functions on Complete Lattices and Their Application to Generalized Logic Programs

Contact Info

Product

Resources

About