Sciweavers

134 search results - page 17 / 27
» Natural Deduction Calculus for Computation Tree Logic
Sort
View
DOCENG
2006
ACM
14 years 1 months ago
Comparing XML path expressions
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
Pierre Genevès, Nabil Layaïda
LOGCOM
2010
96views more  LOGCOM 2010»
13 years 6 months ago
The Complexity of the Warranted Formula Problem in Propositional Argumentation
The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive...
Robin Hirsch, Nikos Gorogiannis
ICDT
2007
ACM
97views Database» more  ICDT 2007»
14 years 1 months ago
Combining Temporal Logics for Querying XML Documents
Close relationships between XML navigation and temporal logics have been discovered recently, in particular between logics LTL and CTL⋆ and XPath navigation, and between the µ-c...
Marcelo Arenas, Pablo Barceló, Leonid Libki...
LPAR
2004
Springer
14 years 1 months ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
Dietmar Berwanger, Erich Grädel
ACSW
2004
13 years 9 months ago
Belief-Based Risk Analysis
This paper describes a method for risk analysis based on the approach used in CRAMM, but instead of using discrete measures for threats and vulnerabilities and lookup tables to de...
Audun Jøsang, Daniel Bradley, Svein J. Knap...