Search
Now showing items 1-10 of 37
-
Repairing Socially Aggregated Ontologies Using Axiom Weakening
(Springer, 2017)Ontologies represent principled, formalised descriptions of agents’ conceptualisations of a domain. For a community of agents, these descriptions may significantly differ. We propose an aggregative view of the integration ... -
Query Answering in Ontologies under Preference Rankings
(International Joint Conferences on Artificial Intelligence, 2017)We present an ontological framework, based on preference rankings, that allows users to express their preferences between the knowledge explicitly available in the ontology. Using this formalism, the answers for a given ... -
The Orchestration Stack: The Impossible Task of Designing Software for Unknown Future Post-CMOS Hardware
([s.n.], 2016)Future systems based on post-CMOS technologies will be wildly heterogeneous, with properties largely unknown today. This paper presents our design of a new hardware/software stack to address the challenge of preparing ... -
Conceptual blending in EL++
(CEUR, 2016)The cognitive theory of conceptual blending models human creativity as a mental process that combines two mental spaces into a new mental space, called a blend. According to this theory, a blend is constructed by taking ... -
Lean Kernels in Description Logics
(Springer, 2017)Lean kernels (LKs) are an effective optimization for deriving the causes of unsatisfiability of a propositional formula. Interestingly, no analogous notion exists for explaining consequences of description logic (DL) ... -
The complexity of fuzzy EL under the Łukasiewicz T-norm
(2017)Fuzzy Description Logics (DLs) are a family of knowledge representation formalisms designed to represent and reason about vague and imprecise knowledge that is inherent to many application domains. Previous work has shown ... -
Decidability and Complexity of Fuzzy Description Logics
(2017)Fuzzy description logics (FDLs) have been introduced to represent concepts for which membership cannot be determined in a precise way, i.e., where instead of providing a strict border between being a member and not being ... -
Lukasiewicz fuzzy EL is undecidable
(CEUR-WS.org, 2017)Fuzzy Description Logics have been proposed as formalisms for representing and reasoning about imprecise knowledge by introducing intermediate truth degrees. Unfortunately, it has been shown that reasoning in these logics ... -
Fuzzy Description Logics - A Survey
(Springer, 2017)Mathematical Fuzzy Logics [51, 60] have a long tradition with roots going back to the many-valued logics of Łukasiewicz, Gödel, and Kleene [57, 68, 73] and the Fuzzy Set Theory of Zadeh [111]. Their purpose is to model ... -
Minimal undefinedness for fuzzy answer sets
(AAAI Press, 2017)Fuzzy Answer Set Programming (FASP) combines the nonmonotonic reasoning typical of Answer Set Programming with the capability of Fuzzy Logic to deal with imprecise information and paraconsistent reasoning. In the context ...
