Sciweavers

797 search results - page 98 / 160
» Logics with an existential modality
Sort
View
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 10 months ago
The complexity of reasoning about pattern-based XML schemas
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
Gjergji Kasneci, Thomas Schwentick
VLC
2011
83views more  VLC 2011»
13 years 4 months ago
A decision procedure for a decidable fragment of generalized constraint diagrams
Constraint diagrams were introduced by Kent, in 1997, as an alternative to the OCL for placing formal constraints on software models. Since their introduction, constraint diagrams...
Jim Burton, Gem Stapleton, Ali Hamie
IJCAI
2001
13 years 11 months ago
Backjumping for Quantified Boolean Logic Satisfiability
The implementation of effective reasoning tools for deciding the satisfiability of Quantified Boolean Formulas (QBFs) is an important research issue in Artificial Intelligence. Ma...
Enrico Giunchiglia, Massimo Narizzano, Armando Tac...
CORR
2008
Springer
91views Education» more  CORR 2008»
13 years 10 months ago
Taming Modal Impredicativity: Superlazy Reduction
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...
Ugo Dal Lago, Luca Roversi, Luca Vercelli
LICS
2007
IEEE
14 years 4 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