1,725 research outputs found
Statistical relational learning with soft quantifiers
Quantification in statistical relational learning (SRL) is either existential or universal, however humans might be more inclined to express knowledge using soft quantifiers, such as ``most'' and ``a few''. In this paper, we define the syntax and semantics of PSL^Q, a new SRL framework that supports reasoning with soft quantifiers, and present its most probable explanation (MPE) inference algorithm. To the best of our knowledge, PSL^Q is the first SRL framework that combines soft quantifiers with first-order logic rules for modelling uncertain relational data. Our experimental results for link prediction in social trust networks demonstrate that the use of soft quantifiers not only allows for a natural and intuitive formulation of domain knowledge, but also improves the accuracy of inferred results
First-order Goedel logics
First-order Goedel logics are a family of infinite-valued logics where the
sets of truth values V are closed subsets of [0, 1] containing both 0 and 1.
Different such sets V in general determine different Goedel logics G_V (sets of
those formulas which evaluate to 1 in every interpretation into V). It is shown
that G_V is axiomatizable iff V is finite, V is uncountable with 0 isolated in
V, or every neighborhood of 0 in V is uncountable. Complete axiomatizations for
each of these cases are given. The r.e. prenex, negation-free, and existential
fragments of all first-order Goedel logics are also characterized.Comment: 37 page
Towards Intelligent Databases
This article is a presentation of the objectives and techniques
of deductive databases. The deductive approach to databases aims at extending
with intensional definitions other database paradigms that describe
applications extensionaUy. We first show how constructive specifications can
be expressed with deduction rules, and how normative conditions can be defined
using integrity constraints. We outline the principles of bottom-up and
top-down query answering procedures and present the techniques used for
integrity checking. We then argue that it is often desirable to manage with
a database system not only database applications, but also specifications of
system components. We present such meta-level specifications and discuss
their advantages over conventional approaches
A Fuzzy Syllogistic Reasoning Schema for Generalized Quantifiers
In this paper, a new approximate syllogistic reasoning schema is described
that expands some of the approaches expounded in the literature into two ways:
(i) a number of different types of quantifiers (logical, absolute,
proportional, comparative and exception) taken from Theory of Generalized
Quantifiers and similarity quantifiers, taken from statistics, are considered
and (ii) any number of premises can be taken into account within the reasoning
process. Furthermore, a systematic reasoning procedure to solve the syllogism
is also proposed, interpreting it as an equivalent mathematical optimization
problem, where the premises constitute the constraints of the searching space
for the quantifier in the conclusion.Comment: 22 pages, 6 figures, journal pape
Introducing fuzzy quantification in OWL 2 ontologies
In this paper, we briefly report our latest achievements in fuzzy granulation of OWL 2 ontologies. More precisely, we extend a previously presented method in order to address a new class of sentences with fuzzy quantifier
- …