Sciweavers

508 search results - page 4 / 102
» A logical account of pspace
Sort
View
LPAR
2007
Springer
14 years 1 months ago
The Complexity of Temporal Logic with Until and Since over Ordinals
Abstract. We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic thanks to ...
Stéphane Demri, Alexander Rabinovich
ICDT
2009
ACM
127views Database» more  ICDT 2009»
14 years 2 months ago
A logical account of uncertain databases based on linear logic
A formal semantics of uncertain databases typically takes an algebraic approach by mapping an uncertain database to a set of relational databases, or possible worlds. We present a...
Sungwoo Park, Seung-won Hwang
INFORMATICALT
2008
74views more  INFORMATICALT 2008»
13 years 7 months ago
Termination of Derivations in a Fragment of Transitive Distributed Knowledge Logic
A transitive distributed knowledge logic is considered. The considered logic S4nD is obtained from multi-modal logic S4n by adding transitive distributed knowledge operator. For a ...
Regimantas Pliuskevicius, Aida Pliuskeviciene
MEDINFO
2007
130views Healthcare» more  MEDINFO 2007»
13 years 9 months ago
What's in a code? Towards a Formal Account of the Relation of Ontologies and Coding Systems
Terminologies are increasingly based on “ontologies” developed in description logics and related languages such as the new Web Ontology Language, OWL. The use of description l...
Alan L. Rector
IANDC
2007
132views more  IANDC 2007»
13 years 7 months ago
An automata-theoretic approach to constraint LTL
We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automata-theoretic technique to show pspace decidabi...
Stéphane Demri, Deepak D'Souza