Sciweavers

3053 search results - page 136 / 611
» A Logic of Abstract Argumentation
Sort
View
LPAR
2010
Springer
15 years 4 months ago
Graded Alternating-Time Temporal Logic
Abstract. Recently, graded modalities have been added to the semantics of two of the logics most commonly used by the computer science community:
Marco Faella, Margherita Napoli, Mimmo Parente
ICCBR
2009
Springer
16 years 1 months ago
Case-Based Reasoning for Situation-Aware Ambient Intelligence: A Hospital Ward Evaluation Study
Abstract. Ambient intelligent systems are defined as being able to perceive their environment, being aware of the presence of people and other agents, and respond intelligently to...
Anders Kofod-Petersen, Agnar Aamodt
CSR
2007
Springer
16 years 21 days ago
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth
Abstract It has recently been proved (Je˙z, DLT 2007) that conjunctive grammars (that is, context-free grammars augmented by conjunction) generate some nonregular languages over a...
Artur Jez, Alexander Okhotin
ASM
2003
ASM
15 years 11 months ago
Remarks on Turbo ASMs for Functional Equations and Recursion Schemes
The question raised in [15] is answered how to naturally dely used forms of recursion by abstract machines. We show that turbo ASMs as defined in [7] allow one to faithfully refl...
Egon Börger, Tommaso Bolognesi
CRYPTO
1993
Springer
118views Cryptology» more  CRYPTO 1993»
15 years 10 months ago
A Subexponential Algorithm for Discrete Logarithms over All Finite Fields
Abstract. There are numerous subexponential algorithms for computing discrete logarithms over certain classes of finite fields. However, there appears to be no published subexponen...
Leonard M. Adleman, Jonathan DeMarrais