Search
Now showing items 1120 of 63

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 ... 
An Automata View to GoalDirected Methods
(Springer, 2017)Consequencebased and automatabased algorithms encompass two families of approaches that have been thoroughly studied as reasoning methods for many logical formalisms. While automata are useful for finding tight complexity ... 
Inconsistencytolerant instance checking in tractable description logics
(Springer, 2017)Research on inconsistencytolerant query answering usually assumes that the terminological knowledge is correct, and only the facts (ABox) need to be repaired. In this paper we study the problem of answering instance queries ... 
Roledepth bounded Least Common Subsumer in ProbEL with Nominals
(CEUR, 2013)Completionbased algorithms can be employed for computing the least common subsumer of two concepts up to a given roledepth, in extensions of the lightweight DL EL. This approach has been applied also to the probabilistic ... 
Blocking Automata for PSPACE DLs
(CEUR, 2007)In Description Logics (DLs), both tableaubased and automatabased algorithms are frequently used to show decidability and complexity results for basic inference problems such as concept satisfiability. Whereas tableaubased ... 
Towards Instance Query Answering for Concepts Relaxed by Similarity Measures
(IIIACSIC, 2013)In Description Logics (DL) knowledge bases (KBs) information is typically captured by crisp concept descriptions. However, for many practical applications querying the KB by crisp concepts is too restrictive. A controlled ... 
Reasoning With Weighted Ontologies
(CEUR, 2009)We study the problem of reasoning over weighted ontologies. We assume that every axiom is labeled with an element of a distributive lattice (called its weight) and try to compute its socalled boundary, with respect to a ... 
Roledepth Bounded Least Common Subsumers by Completion for EL and ProbELTBoxes
(CEUR, 2010)The least common subsumer (lcs) w.r.t general ELTBoxes does not need to exists in general due to cyclic axioms. In this paper we present an algorithm for computing roledepth bounded ELlcs based on the completion algorithm ... 
Coherence, Similarity, and Concept Generalisation
(CEURWS.org, 2017)We address the problem of analysing the joint coherence of a number of concepts with respect to a background ontology. To address this problem, we explore the applicability of Paul Thagard's computational theory of coherence, ... 
Debugging EL+ Ontologies through Horn MUS Enumeration
(CEURWS.org, 2017)In description logics (DLs), axiom pinpointing refers to the problem of enumerating the minimal subsets of axioms from an ontology that entail a given consequence. Recent developments on axiom pinpointing for the lightweight ...