Sciweavers

12459 search results - page 269 / 2492
» cans 2006
Sort
View
JALC
2006
95views more  JALC 2006»
15 years 6 months ago
On the Decidability of Model-Checking for P Systems
Membrane computing is a branch of molecular computing that aims to develop models and paradigms that are biologically motivated. It identifies an unconventional computing model, n...
Zhe Dang, Oscar H. Ibarra, Cheng Li, Gaoyan Xie
JANCL
2006
123views more  JANCL 2006»
15 years 6 months ago
Approximate databases: a support tool for approximate reasoning
This paper describes an experimental platform for approximate knowledge databases called the Approximate Knowledge Database (AKDB), based on a semantics inspired by rough sets. The...
Patrick Doherty, Martin Magnusson, Andrzej Szalas
JAPLL
2006
114views more  JAPLL 2006»
15 years 6 months ago
The monadic second-order logic of graphs XV: On a conjecture by D. Seese
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
Bruno Courcelle
JAR
2006
107views more  JAR 2006»
15 years 6 months ago
Attacking Group Protocols by Refuting Incorrect Inductive Conjectures
Automated tools for finding attacks on flawed security protocols often fail to quately with group protocols. This is because the abstractions made to improve performance on fixed ...
Graham Steel, Alan Bundy
JAR
2006
95views more  JAR 2006»
15 years 6 months ago
Mechanizing and Improving Dependency Pairs
The dependency pair technique [1, 11, 12] is a powerful method for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates ...
Jürgen Giesl, René Thiemann, Peter Sch...