Sciweavers

52 search results - page 3 / 11
» Algorithmic correspondence and completeness in modal logic
Sort
View
FUIN
2007
92views more  FUIN 2007»
13 years 8 months ago
Foundations of Modal Deductive Databases
We give formulations for modal deductive databases and present a modal query language called MDatalog. We define modal relational algebras and give the seminaive evaluation algor...
Linh Anh Nguyen
PLANX
2007
13 years 9 months ago
XPath Typing Using a Modal Logic with Converse for Finite Trees
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
Pierre Genevès, Nabil Layaïda, Alan Sc...
PODC
2012
ACM
11 years 10 months ago
Weak models of distributed computing, with connections to modal logic
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
Lauri Hella, Matti Järvisalo, Antti Kuusisto,...
JANCL
2007
106views more  JANCL 2007»
13 years 7 months ago
Dynamic logic for belief revision
ABSTRACT. We show how belief revision can be treated systematically in the format of dynamicepistemic logic, when operators of conditional belief are added. The core engine consist...
Johan van Benthem
AAI
2010
94views more  AAI 2010»
13 years 3 months ago
Sequence-Indexed Linear-Time Temporal Logic: Proof System and Application
In this paper, we propose a proof system for reasoning on certain specifications of secure authentication systems. For this purpose, a new logic, sequence-indexed linear-time temp...
Ken Kaneiwa, Norihiro Kamide