Sciweavers

47 search results - page 8 / 10
» Proof nets for display logic
Sort
View
CONCUR
2000
Springer
15 years 1 months ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko
LOGCOM
2010
152views more  LOGCOM 2010»
14 years 4 months ago
Constructive Logic with Strong Negation as a Substructural Logic
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...
Manuela Busaniche, Roberto Cignoli
ICIW
2009
IEEE
15 years 4 months ago
Towards a Disciplined Engineering of Adaptive Service-Oriented Business Processes
Today’s cross-organizations are increasingly coordinating their capabilities in the quest of dynamically adaptable and thus highly competitive realistic services. Unfortunately,...
Nasreddine Aoumeur, Kamel Barkaoui
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
15 years 1 months ago
The baldwin effect in developing neural networks
The Baldwin Effect is a very plausible, but unproven, biological theory concerning the power of learning to accelerate evolution. Simple computational models in the 1980’s gave...
Keith L. Downing
BIRTHDAY
2005
Springer
15 years 3 months ago
Expander2
Expander2 is a flexible multi-purpose workbench for interactive rewriting, verification, constraint solving, flow graph analysis and other procedures that build up proofs or co...
Peter Padawitz