Sciweavers

2022 search results - page 13 / 405
» Complexity of Non-Monotonic Logics
Sort
View
ENTCS
2011
131views more  ENTCS 2011»
14 years 5 months ago
Computational Complexity in Non-Turing Models of Computation: The What, the Why and the How
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...
Ed Blakey
APAL
2006
112views more  APAL 2006»
14 years 10 months ago
On complexity of verification of interacting agents' behavior
This paper studies the complexity of behavior of multi-agent systems. Behavior properties are formulated using classical temporal logic languages and are checked with respect to t...
Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars ...
ESSOS
2011
Springer
14 years 1 months ago
Middleware Support for Complex and Distributed Security Services in Multi-tier Web Applications
Abstract. The security requirements of complex multi-tier web applications have shifted from simple localized needs, such as authentication or authorization, to physically distribu...
Philippe De Ryck, Lieven Desmet, Wouter Joosen
CADE
2005
Springer
15 years 10 months ago
On the Complexity of Equational Horn Clauses
Kumar Neeraj Verma, Helmut Seidl, Thomas Schwentic...
124
Voted
LPAR
2010
Springer
14 years 8 months ago
On the Satisfiability of Two-Variable Logic over Data Words
Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels ...
Claire David, Leonid Libkin, Tony Tan