Sciweavers

1549 search results - page 215 / 310
» On the rules of intermediate logics
Sort
View
LOGCOM
2010
82views more  LOGCOM 2010»
13 years 6 months ago
Deduction Systems for Coalgebras Over Measurable Spaces
A theory of infinitary deduction systems is developed for the modal logic of coalgebras for measurable polynomial functors on the category of measurable spaces. These functors ha...
Robert Goldblatt
GECCO
2011
Springer
274views Optimization» more  GECCO 2011»
12 years 11 months ago
Fuzzy dynamical genetic programming in XCSF
—A number of representation schemes have been presented for use within Learning Classifier Systems, ranging from binary encodings to Neural Networks, and more recently Dynamical ...
Richard Preen, Larry Bull
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
14 years 9 months ago
Network-Aware Operator Placement for Stream-Processing Systems
To use their pool of resources efficiently, distributed stream-processing systems push query operators to nodes within the network. Currently, these operators, ranging from simple...
Peter R. Pietzuch, Jonathan Ledlie, Jeffrey Shneid...
DAC
2007
ACM
14 years 8 months ago
On Resolution Proofs for Combinational Equivalence
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...
PODS
2005
ACM
99views Database» more  PODS 2005»
14 years 8 months ago
XML type checking with macro tree transducers
MSO logic on unranked trees has been identified as a convenient theoretical framework for reasoning about expressiveness and implementations of practical XML query languages. As a...
Sebastian Maneth, Alexandru Berlea, Thomas Perst, ...