Sciweavers

134 search results - page 11 / 27
» Natural Deduction Calculus for Computation Tree Logic
Sort
View
ADC
2008
Springer
146views Database» more  ADC 2008»
14 years 2 months ago
A Typed Higher-Order Calculus for Querying XML Databases
As the eXtensible Markup Language (XML) is about to emerge as a new standard for databases, the problem of providing solid logical grounds for XML query languages arises. For the ...
Qing Wang, Klaus-Dieter Schewe
LICS
2005
IEEE
14 years 1 months ago
Temporal Logics over Unranked Trees
We consider unranked trees, that have become an active subject of study recently due to XML applications, and characterize commonly used fragments of firstorder (FO) and monadic ...
Pablo Barceló, Leonid Libkin
RTA
2001
Springer
14 years 2 days ago
Matching Power
In this paper we give a simple and uniform presentation of the rewriting calculus, also called Rho Calculus. In addition to its simplicity, this formulation explicitly allows us to...
Horatiu Cirstea, Claude Kirchner, Luigi Liquori
LICS
2007
IEEE
14 years 1 months ago
Alternation-free modal mu-calculus for data trees
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
Marcin Jurdzinski, Ranko Lazic
IWFM
2003
123views Formal Methods» more  IWFM 2003»
13 years 9 months ago
Logic for Computational Effects: Work in Progress
We outline a possible logic that will allow us to give a unified approach to reasoning about computational effects. The logic is given by extending Moggi’s computational λ-cal...
Gordon D. Plotkin, John Power