Sciweavers

251 search results - page 15 / 51
» Finite Model Reasoning in Description Logics
Sort
View
FTP
1998
Springer
14 years 1 months ago
Issues of Decidability for Description Logics in the Framework of Resolution
Abstract. We describe two methods on the basis of which efficient resolution decision procedures can be developed for a range of description logics. The first method uses an orderi...
Ullrich Hustadt, Renate A. Schmidt
DLOG
2000
13 years 11 months ago
Adapting Optimization Techniques to Description Logics with Concrete Domains
In this paper, we demonstrate that the main standard optimization techniques dependency directed backtracking and model merging can be adapted to description logics with concrete ...
Anni-Yasmin Turhan, Volker Haarslev
UAI
1989
13 years 11 months ago
Can Uncertainty Management be Realized in a Finite Totally Ordered Probability Algebra?
In this paper, the feasibility of using finite totally ordered probability models under Aleliunas’s Theory of Probabilistic Logic [Aleliunas, 1988] is investigated. The general...
Yang Xiang, Michael P. Beddoes, David Poole
SEMWEB
2009
Springer
14 years 2 months ago
Reasoning With Provenance, Trust and all that other Meta Knowlege in OWL
Abstract—For many tasks, such as the integration of knowledge bases in the semantic web, one must not only handle the knowledge itself, but also characterizations of this knowled...
Simon Schenk, Renata Queiroz Dividino, Steffen Sta...
SIGSOFT
2005
ACM
14 years 10 months ago
Relational analysis of algebraic datatypes
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
Viktor Kuncak, Daniel Jackson