Sciweavers

108 search results - page 3 / 22
» Finite Model Reasoning in DL-Lite
Sort
View
UAI
1989
13 years 10 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
ICMAS
2000
13 years 11 months ago
Reasoning About Others: Representing and Processing Infinite Belief Hierarchies
In this paper we focus on the problem of how infinite belief hierarchies can be represented and reasoned with in a computationally tractable way. When modeling nested beliefs one ...
Sviatoslav Brainov, Tuomas Sandholm
LICS
2010
IEEE
13 years 7 months ago
On the Strictness of the First-Order Quantifier Structure Hierarchy over Finite Structures
One of the major interests of finite model theory is to separate the expressive power of different logics or fragments of logics. In this paper, we define a variant of EhrenfeuchtF...
Yuguo He
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
CSL
2004
Springer
13 years 9 months ago
Arc minimization in finite-state decoding graphs with cross-word acoustic context
Recent approaches to large vocabulary decoding with finite state graphs have focused on the use of state minimization algorithms to produce relatively compact graphs. This paper e...
François Yvon, Geoffrey Zweig, George Saon