@article{Beggs-Tucker/07,
AUTHOR = {Beggs, Edwin J. and Tucker, John V.},
TITLE = {Can Newtonian systems, bounded in space, time, mass and energy compute all functions?},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {1-2},
PAGES = {4-19},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {newtonian machines, computability, hypercomputation, experimental computation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M5F330-3/2/653b5d1cd344fd3fc9e634e7634862c8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bernardini-Gheorghe-Krasnogor/07,
AUTHOR = {Bernardini, Francesco and Gheorghe, Marian and Krasnogor, Natalio},
TITLE = {Quorum sensing $P$ systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {1-2},
PAGES = {20-33},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {p systems, turing machines, quorum sensing, vibrio fischeri},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M6937D-1/2/369cad4d950d33551af24011a91ebe43},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{dAvila_Garcez-Lamb-Gabbay/07,
AUTHOR = {d'Avila Garcez, Artur S. and Lamb, Lu{\'{i}}s C. and Gabbay, Dov M.},
TITLE = {Connectionist modal logic: Representing modalities in neural networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {1-2},
PAGES = {34-53},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {models of computation, neural-symbolic learning systems, knowledge representation, modal logics, artificial neural networks},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M91NYF-1/2/07126749a6916d499ce4a5fb24d6201f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gutierrez-Naranjo-Perez-Jimenez-Romero-Campero/07,
AUTHOR = {Guti{\'e}rrez-Naranjo, Miguel A. and P{\'e}rez-Jim{\'e}nez, Mario J. and Romero-Campero, Francisco J.},
TITLE = {A uniform solution to SAT using membrane creation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {1-2},
PAGES = {54-61},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {natural computing, membrane computing, cellular complexity classes, sat problem},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M6RXKN-1/2/b612fe05c1dcf09c50ff293b62f0933d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Michalak-Kwasnicka/07,
AUTHOR = {Michalak, Krzysztof and Kwa{\'s}nicka, Halina},
TITLE = {Influence of data dimensionality on the quality of forecasts given by a multilayer perceptron},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {1-2},
PAGES = {62-71},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {correlation dimension, data dimensionality, neural networks, multilayer perceptron, time series prediction},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M6XMHG-1/2/debabde42db287dd45da4fa03049895e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Manea-Martin-Vide-Mitrana/07,
AUTHOR = {Manea, Florin and Mart{\'{i}}n-Vide, Carlos and Mitrana, Victor},
TITLE = {Accepting networks of splicing processors: Complexity results},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {1-2},
PAGES = {72-82},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {splicing processor, communication, complexity class, problem solving},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M7YK1V-1/2/c4ab7156510236c822bf520aad33fc70},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
NOTE = {see Erratum in Theor.~Comput.~Sci.\ 378, 2007, No. 1, 131},
}
@article{Krishna/07,
AUTHOR = {Krishna, Shankara Narayanan},
TITLE = {Universality results for $P$ systems based on brane calculi operations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {1-2},
PAGES = {83-105},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {brane calculi, membrane computing, universality, matrix grammars},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M6XMHG-4/2/e8efcd44db6abc062cc986d7455e502c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Trautteur-Tamburrini/07,
AUTHOR = {Trautteur, Giuseppe and Tamburrini, Guglielmo},
TITLE = {A note on discreteness and virtuality in analog computing},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {1-2},
PAGES = {106-114},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {analog computing, virtual machine, cognitive modelling},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M6XMHG-3/2/decc44cbbe6bcfbb23adae35d53c33ad},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tucker-Zucker/07,
AUTHOR = {Tucker, John V. and Zucker, Jeffery I.},
TITLE = {Computability of analog networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {1-2},
PAGES = {115-146},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {analog computation, analog computing, analog networks, continuous time, continuous streams},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4M6XMHG-2/2/da270d6392bc77994311870006924a48},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Koltun-Papadimitriou/07,
AUTHOR = {Koltun, Vladlen and Papadimitriou, Christos H.},
TITLE = {Approximately dominating representatives},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {3},
PAGES = {148-154},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MC81PN-2/2/59707994a98a9347bc57dee812da0a5a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Atserias/07,
AUTHOR = {Atserias, Albert},
TITLE = {Conjunctive query evaluation by search-tree revisited},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {3},
PAGES = {155-168},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {conjunctive query, constraint-satisfaction problem, treewidth},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MDGPB5-4/2/c81ed35d48fe7974af0321bdfc017d85},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Calvanese-De_Giacomo-Lenzerini-Vardi/07,
AUTHOR = {Calvanese, Diego and De Giacomo, Giuseppe and Lenzerini, Maurizio and Vardi, Moshe Y.},
TITLE = {View-based query processing: On the relationship between rewriting, answering and losslessness},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {3},
PAGES = {169-182},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {query containment, query rewriting, query answering, losslessness, conjunctive queries, regular path queries, semistructured data},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MDGPB5-3/2/3a696dabaf4fb96b852671969260dfd9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Van_den_Bussche-Van_Gucht-Vansummeren/07,
AUTHOR = {Van den Bussche, Jan and Van Gucht, Dirk and Vansummeren, Stijn},
TITLE = {Well-definedness and semantic type-checking for the nested relational calculus},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {3},
PAGES = {183-199},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {complex objects, query equivalence, semantic type-checking, well-definedness},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MDGPB5-1/2/28dd9a6bd742181d927ad6ca26085d4d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Deutsch-Ludascher-Nash/07,
AUTHOR = {Deutsch, Alin and Lud{\"a}scher, Bertram and Nash, Alan},
TITLE = {Rewriting queries using views with access patterns under integrity constraints},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {3},
PAGES = {200-226},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {views, access patterns, integrity constraints, query rewriting},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MDGPB5-2/2/ee0e6bd07f01789024ca827d27b31310},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Matias-Urieli/07,
AUTHOR = {Matias, Yossi and Urieli, Daniel},
TITLE = {Optimal workload-based weighted wavelet synopses},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {3},
PAGES = {227-246},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximation theory, massive data sets, workload-based, wavelet synopses, weighted wavelets, weighted inner product},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MG065P-1/2/afffe19e6d2537d71545aaaa48c36a7a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Balcazar-Garriga/07,
AUTHOR = {Balc{\'a}zar, Jos{\'e} L. and Garriga, Gemma C.},
TITLE = {Horn axiomatizations for sequential data},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {371},
NUMBER = {3},
PAGES = {247-264},
YEAR = {2007},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sequential patterns, association rules, closure operators, propositional horn theories},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4MDGPB5-5/2/4661a1256a2eca99ce83902d47c47f22},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}