Sciweavers

903 search results - page 27 / 181
» Completeness Results for Memory Logics
Sort
View
IGPL
2002
91views more  IGPL 2002»
13 years 7 months ago
The Unrestricted Combination of Temporal Logic Systems
This paper generalises and complements the work on combining temporal logics started by Finger and Gabbay [11, 10]. We present proofs of transference of soundness, completeness an...
Marcelo Finger, M. Angela Weiss
BIRTHDAY
2005
Springer
14 years 1 months ago
a-logic
We present an extension of first-order predicate logic with a novel predicate ‘at t’ meaning intuitively “this term is a variable symbol”. We give simple sequent proof-ru...
Murdoch Gabbay, Michael Gabbay
TABLEAUX
2007
Springer
14 years 1 months ago
Tableau Systems for Logics of Subinterval Structures over Dense Orderings
We construct a sound, complete, and terminating tableau system for the interval temporal logic D · interpreted in interval structures over dense linear orderings endowed with stri...
Davide Bresolin, Valentin Goranko, Angelo Montanar...
COGSR
2011
99views more  COGSR 2011»
13 years 2 months ago
A biologically realistic cleanup memory: Autoassociation in spiking neurons
Methods for cleaning up (or recognizing) states of a neural network are crucial for the functioning of many neural cognitive models. For example, Vector Symbolic Architectures pro...
Terrence C. Stewart, Yichuan Tang, Chris Eliasmith
FPL
2005
Springer
98views Hardware» more  FPL 2005»
14 years 1 months ago
A Verilog RTL Synthesis Tool for Heterogeneous FPGAs
Modern heterogeneous FPGAs contain “hard” specificpurpose structures such as blocks of memory and multipliers in addition to the completely flexible “soft” programmable ...
Peter Jamieson, Jonathan Rose