Results 1 - 10 of 356

A Description Logics Tableau Reasoner in Prolog

by Riccardo Zese, Elena Bellodi, Evelina Lamma, Fabrizio Riguzzi
"... Abstract. Description Logics (DLs) are gaining a widespread adoption as the popularity of the Semantic Web increases. Traditionally, reasoning algorithms for DLs have been implemented in procedural languages such as Java or C++. In this paper, we present the system TRILL for “Tableau Reasoner for de ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
Abstract. Description Logics (DLs) are gaining a widespread adoption as the popularity of the Semantic Web increases. Traditionally, reasoning algorithms for DLs have been implemented in procedural languages such as Java or C++. In this paper, we present the system TRILL for “Tableau Reasoner

Algebraic tableau reasoning for the description logic SHOQ

by Jocelyne Faddoul, Volker Haarslev - Logic Journal of the IGPL, Special Issue on Hybrid Logics
"... Semantic web applications based on the web ontology language (OWL) often require the use of numbers in class descriptions for expressing cardinality restrictions on properties or even classes. Some of these cardinalities are specified explicitly but quite a few are entailed and need to be discovered ..."
Abstract - Cited by 10 (6 self) - Add to MetaCart
cases. This lack of information about arithmetic problems dramatically degrades the performance of DL reasoners in many cases, especially with ontologies relying on the use of nominals (O) and qualified cardinality restrictions (Q). In this article we present a new algebraic tableau reasoning procedure

Optimizing Tableau Reasoning in ALC Extended with Uncertainty

by Volker Haarslev, Hsueh-ieng Pai, Nematollaah Shiri
"... Abstract. There has been an increased interest in recent years to incorporate uncertainty in Description Logics (DLs), and a number of proposals have been put forward for modeling uncertainty in DL frameworks. While much progress has been made on syntax, semantics, and query processing issues, optim ..."
Abstract - Cited by 8 (2 self) - Add to MetaCart
, optimizing queries in this context has received little attention. In this paper, we study query processing for a tableau-based DL framework with uncertainty and focus on optimization of resolution of certainty inequality constraints, obtained from a translation in query processing phase. We develop a running

Tableau Reasoning and Programming with Dynamic First Order Logic

by Jan van Eijck, Juan Heguiabehere, Breanndan O Nuallain , 2001
"... Dynamic First Order Logic (DFOL) results from interpreting quantification over a variable v as change of valuation over the v position, conjunction as sequential composition, disjunction as nondeterministic choice, and negation as (negated) test for continuation. We present a tableau style calculus ..."
Abstract - Cited by 5 (4 self) - Add to MetaCart
Dynamic First Order Logic (DFOL) results from interpreting quantification over a variable v as change of valuation over the v position, conjunction as sequential composition, disjunction as nondeterministic choice, and negation as (negated) test for continuation. We present a tableau style calculus

Tableau Reasoners for Probabilistic Ontologies Exploiting Logic Programming Techniques

by Riccardo Zese , Elena Bellodi , Fabrizio Riguzzi , Evelina Lamma
"... Abstract. The adoption of Description Logics for modeling real world domains within the Semantic Web is exponentially increased in the last years, also due to the availability of a large number of reasoning algorithms. Most of them exploit the tableau algorithm which has to manage non-determinism, ..."
Abstract - Add to MetaCart
Abstract. The adoption of Description Logics for modeling real world domains within the Semantic Web is exponentially increased in the last years, also due to the availability of a large number of reasoning algorithms. Most of them exploit the tableau algorithm which has to manage non

Optimizing Algebraic Tableau Reasoning for SHOQ: First Experimental Results

by Jocelyne Faddoul, Volker Haarslev
"... Abstract. In this paper we outline an algebraic tableau algorithm for the DL SHOQ, which supports more informed reasoning due to the use of semantic partitioning and integer programming. We introduce novel and adapt known optimization techniques and show their effectiveness on the basis of a prototy ..."
Abstract - Cited by 3 (3 self) - Add to MetaCart
Abstract. In this paper we outline an algebraic tableau algorithm for the DL SHOQ, which supports more informed reasoning due to the use of semantic partitioning and integer programming. We introduce novel and adapt known optimization techniques and show their effectiveness on the basis of a

Optimizing Algebraic Tableau Reasoning forSHOQ: First Experimental Results

by Jocelyne Faddoul, Volker Haarslev
"... Abstract. In this paper we outline an algebraic tableau algorithm for the DL SHOQ, which supports more informed reasoning due to the use of semantic partitioning and integer programming. We introduce novel and adapt known optimization techniques and show their effectiveness on the basis of a prototy ..."
Abstract - Add to MetaCart
Abstract. In this paper we outline an algebraic tableau algorithm for the DL SHOQ, which supports more informed reasoning due to the use of semantic partitioning and integer programming. We introduce novel and adapt known optimization techniques and show their effectiveness on the basis of a

Tableau Algorithms for Description Logics

by Franz Baader, Ulrike Sattler - STUDIA LOGICA , 2000
"... Description logics are a family of knowledge representation formalisms that are descended from semantic networks and frames via the system Kl-one. During the last decade, it has been shown that the important reasoning problems (like subsumption and satisfiability) in a great variety of descriptio ..."
Abstract - Cited by 260 (26 self) - Add to MetaCart
Description logics are a family of knowledge representation formalisms that are descended from semantic networks and frames via the system Kl-one. During the last decade, it has been shown that the important reasoning problems (like subsumption and satisfiability) in a great variety

Tableau-based Reasoning

by Ralf Möller, Volker Haarslev
"... As part of the infrastructure for working with ontologies, reasoning systems are required. Reasoning is used at ontology development or maintenance time as well as at the time ontologies are used for solving application problems. In this section we will review so-called tableau-based decision proced ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
As part of the infrastructure for working with ontologies, reasoning systems are required. Reasoning is used at ontology development or maintenance time as well as at the time ontologies are used for solving application problems. In this section we will review so-called tableau-based decision

Tableau Proofs for Skeptical Reasoning

by Robert Saxon Milnikel , 1999
"... . We present a monotone inductive characterization of the set of skeptical consequences of a nonmonotonic rule system. Nonmonotonic rule systems are an abstraction of the nonmonotonic properties of many systems designed to formalize everyday reasoning, including default logic, autoepistemic logi ..."
Abstract - Add to MetaCart
. We present a monotone inductive characterization of the set of skeptical consequences of a nonmonotonic rule system. Nonmonotonic rule systems are an abstraction of the nonmonotonic properties of many systems designed to formalize everyday reasoning, including default logic, autoepistemic
Results 1 - 10 of 356