Search
Now showing items 110 of 23

Reasoning in Expressive Description Logics under Infinitely Valued Gödel Semantics
(Springer, 2015)Fuzzy Description Logics (FDLs) combine classical Description Logics with the semantics of Fuzzy Logics in order to represent and reason with vague knowledge. Most FDLs using truth values from the interval [0,1] have been ... 
The Fuzzy Description Logic GFL0 with Greatest FixedPoint Semantics
(SpringerVerlag, 2014)We study the fuzzy extension of the Description Logic FL0 with semantics based on the Gödel tnorm. We show that subsumption w.r.t. a finite set of primitive definitions, using greatest fixedpoint semantics, can be ... 
Using Bayesian Networks as an Inference Engine in KAMET
(IEEEPress, 2003)During the past decades, many methods have been developed for the creation of knowledgebased systems (KBS). For these methods, probabilistic networks have shown to be an important tool to work with probabilitymeasured ... 
The Bayesian Description Logic BEL
(Springer, 2014)We introduce the probabilistic Description Logic BEL. In BEL, axioms are required to hold only in an associated context. The probabilistic component of the logic is given by a Bayesian network that describes the joint ... 
Tight Complexity Bounds for Reasoning in the Description Logic BEL
(Springer, 2014)Recently, Bayesian extensions of Description Logics, and in particular the logic BEL, were introduced as a means of representing certain knowledge that depends on an uncertain context. In this paper we introduce a novel ... 
The complexity of computing the behaviour of lattice automata on infinite trees
(Elsevier, 2014)Several logicbased decision problems have been shown to be reducible to the emptiness problem of automata. In a similar way, nonstandard reasoning problems can be reduced to the computation of the behaviour of weighted ... 
Fuzzy answer sets approximations
(Cambridge University Press (CUP): STM Journals, 2013)Fuzzy answer set programming (FASP) is a recent formalism for knowledge representation that enriches the declarativity of answer set programming by allowing propositions to be graded. To now, no implementations of FASP ... 
The complexity of latticebased fuzzy description logics
(Springer, 2013)We study the complexity of reasoning in fuzzy description logics with semantics based on finite residuated lattices. For the logic SHI, we show that deciding satisfiability and subsumption of concepts, with or without a ... 
Probabilistic Query Answering in the Bayesian Description Logic BEL
(Springer, 2015)BEL is a probabilistic description logic (DL) that extends the lightweight DL EL with a joint probability distribution over the axioms, expressed with the help of a Bayesian network (BN). In recent work it has been shown ... 
Detecting Emergent Phenomena in Cellular Automata Using Temporal Description Logics
(Springer, 2014)Cellular automata are discrete mathematical models that have been proven useful as representations of a wide variety of systems exhibiting emergent behavior. Detection of emergent behavior is typically computationally ...