Sciweavers

2022 search results - page 53 / 405
» Complexity of Non-Monotonic Logics
Sort
View
AML
2007
95views more  AML 2007»
15 years 6 months ago
Complexity of admissible rules
We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionistic logics. We state a broad condition unde...
Emil Jerábek
GI
2005
Springer
15 years 11 months ago
Modelling and Execution of Complex Semantic Transactions using WERIGO Metamodel
: Rapid evolution of modern Information Systems and Process-Aware Information Systems (PAIS) in particular requires transactional execution of business logic. The paper introduces ...
Alexander Tarabrin
LCC
1994
213views Algorithms» more  LCC 1994»
15 years 10 months ago
Linear Constraint Query Languages: Expressive Power and Complexity
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
Stéphane Grumbach, Jianwen Su, Christophe T...
186
Voted
CORR
2010
Springer
186views Education» more  CORR 2010»
15 years 6 months ago
A Homogeneous Reaction Rule Language for Complex Event Processing
Event-driven automation of reactive functionalities for complex event processing is an urgent need in today's distributed service-oriented architectures and Web-based event-d...
Adrian Paschke, Alexander Kozlenkov, Harold Boley
PODS
2010
ACM
181views Database» more  PODS 2010»
15 years 11 months ago
Schema design for XML repositories: complexity and tractability
Abiteboul et al. initiated the systematic study of distributed XML documents consisting of several logical parts, possibly located on different machines. The physical distributio...
Wim Martens, Matthias Niewerth, Thomas Schwentick