Sciweavers

156 search results - page 4 / 32
» Decidability and Undecidability in Probability Logic
Sort
View
IANDC
2007
127views more  IANDC 2007»
13 years 5 months ago
Temporal logics with incommensurable distances are undecidable
Temporal logic based on the two modalities “Since” and “Until” (TL) is the most popular logic for the specification of reactive systems. It is often called the linear tim...
Alexander Rabinovich
LICS
2010
IEEE
13 years 4 months ago
The Undecidability of Boolean BI through Phase Semantics
We solve the open problem of the decidability of Boolean BI logic (BBI), which can be considered as the core of separation and spatial logics. For this, we define a complete phas...
Dominique Larchey-Wendling, Didier Galmiche
AAAI
2008
13 years 8 months ago
On the Decidability of Role Mappings between Modular Ontologies
Many semantic web applications require support for mappings between roles (or properties) defined in multiple independently developed ontology modules. Distributed Description Log...
Jie Bao, George Voutsadakis, Giora Slutzki, Vasant...
LOGCOM
2006
64views more  LOGCOM 2006»
13 years 5 months ago
A Logic of Probability with Decidable Model Checking
Danièle Beauquier, Alexander Moshe Rabinovi...
ICDT
2003
ACM
121views Database» more  ICDT 2003»
13 years 11 months ago
Deciding Termination of Query Evaluation in Transitive-Closure Logics for Constraint Databases
We study extensions of first-order logic over the reals with different types of transitive-closure operators as query languages for constraint databases that can be described by...
Floris Geerts, Bart Kuijpers