Sciweavers

98 search results - page 1 / 20
» Combinations of Theories for Decidable Fragments of First-Or...
Sort
View
CORR
2004
Springer
176views Education» more  CORR 2004»
13 years 4 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
DLOG
2009
13 years 2 months ago
On Correspondences between Probabilistic First-Order and Description Logics
Abstract This paper analyzes the probabilistic description logic PSHIQ by looking at it as a fragment of probabilistic first-order logic with semantics based on possible worlds. We...
Pavel Klinov, Bijan Parsia, Ulrike Sattler
LICS
2006
IEEE
13 years 11 months ago
The Boundedness Problem for Monadic Universal First-Order Logic
We consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula ϕ(X, x), positive in X, decide whether there is a unif...
Martin Otto
KR
2004
Springer
13 years 10 months ago
A First-Order Theory of Communicating First-Order Formulas
This paper presents a theory of informative communications among agents that allows a speaker to communicate to a hearer truths about the state of the world; the occurrence of eve...
Ernest Davis