Sebanyak 379 item atau buku ditemukan

Structures in Logic and Computer Science

A Selection of Essays in Honor of A. Ehrenfeucht

The book summarises contemporary knowledge about the theory of atomic and molecular clusters. New results are discussed on a high theoretical level. Access to this field of research is given by an explanation of the various subjects in introductory chapters.

They also gave an O(n log n) time algorithm to find all maximal quasiperiodic
substrings within a given string. Apostolico, Farach and Iliopoulos [4] gave an O(n
) time algorithm that finds the quasiperiod of a given string, namely the shortest
string that covers the string in question. This algorithm was subsequently
simplified and improved by Breslauer [9] who gave an O(n) time on-line algorithm
, and parallelized by Breslauer [10] and Iliopoulos and Park [19], the latter giving
an ...

Field-Programmable Logic: Architectures, Synthesis and Applications

4th International Workshop on Field-Programmable Logic and Applications, FPL'94, Prague, Czech Republic, September 7 - 9, 1994. Proceedings

This volume contains the proceedings of the 4th International Workshop on Field-Programmable Logic and Applications (FPL '94), held in Prague, Czech Republic in September 1994. The growing importance of field-programmable devices is substantiated by the remarkably high number of 116 submissions for FPL '94; from them, the revised versions of 40 full papers and 24 high-quality poster presentations were accepted for inclusion in this volume. Among the topics treated are: testing, layout, synthesis tools, compilation research and CAD, trade-offs and experience, innovations and smart applications, FPGA-based computer architectures, high-level design, prototyping and ASIC emulators, commercial devices, new tools, CCMs and HW/SW co-design, modelers, educational experience, and novel architectures.

A special purpose processor originally designed for Monte-Carlo simulation
using Metropolis type algorithms has been reconfigured to allow the use of a new
improved class of Monte-Carlo algorithm without compromising the processor's
performance. 1 Introduction In Monte-Carlo simulations and digital signal
processing applications it has often proved advantageous to use specially
constructed processors in place of general purpose computers. SRAM-bascd
Field Programmable ...

Field-Programmable Logic and Applications

13th International Conference, FPL 2003, Lisbon, Portugal, September 1-3, 2003, Proceedings

This book constitutes the refereed proceedings of the 13th International Conference on Field-Programmable Logic and Applications, FPL 2003, held in Lisbon, Portugal in September 2003. The 90 revised full papers and 56 revised poster papers presented were carefully reviewed and selected from 216 submissions. The papers are organized in topical sections on technologies and trends, communications applications, high level design tools, reconfigurable architecture, cryptographic applications, multi-context FPGAs, low-power issues, run-time reconfiguration, compilation tools, asynchronous techniques, bio-related applications, codesign, reconfigurable fabrics, image processing applications, SAT techniques, application-specific architectures, DSP applications, dynamic reconfiguration, SoC architectures, emulation, cache design, arithmetic, bio-inspired design, SoC design, cellular applications, fault analysis, and network applications.

13th International Conference, FPL 2003, Lisbon, Portugal, September 1-3, 2003,
Proceedings Peter Y.K. Cheung, Georg A. Constantinides Jose T. de Sousa. An
Algorithm Designer's Workbench for Platform FPGAs⋆ Sumit Mohanty and Viktor
K. Prasanna Electrical Engineering Systems, University of Southern California,
CA, USA, {smohanty ...

Foundations of Inductive Logic Programming

The state of the art of the bioengineering aspects of the morphology of microorganisms and their relationship to process performance are described in this volume. Materials and methods of the digital image analysis and mathematical modeling of hyphal elongation, branching and pellet formation as well as their application to various fungi and actinomycetes during the production of antibiotics and enzymes are presented.

Thus, clearly, finding out which formulas <j> are logical consequences of some
set of formulas E is crucial to many areas of artificial intelligence, including
inductive logic programming. Accordingly, we would like to have a procedure, an
algorithm, which could find out whether or not E (= 4> is the case. What is an
algorithm? We will only give an informal explanantion here, referring to [HU79,
CLR90] for the more formal details. Intuitively, an algorithm is a procedure, a
specific sequence ...

Field Programmable Logic and Application

14th International Conference , FPL 2004, Leuven, Belgium, August 30-September 1, 2004, Proceedings

This book constitutes the refereed proceedings of the 14th International Conference on Field-Programmable Logic, FPL 2003, held in Leuven, Belgium in August/September 2004. presented together with 3 keynote contributions and 3 tutorial summaries were carefully reviewed and selected from 285 papers submitted. computing, security and cryptography, platform-based design, algorithms and architectures, acceleration application, architecture, physical design, arithmetic, multitasking, circuit technology, network processing, testing, applications, signal processing, computational models and compiler, dynamic reconfiguration, networks and optimisation algorithms, system-on-chip, high-speed design, image processing, network-on-chip, power-aware design, IP-based design, co-processing architectures, system level design, physical interconnect, computational models, cryptography and compression, network applications and architecture, and debugging and teSt.

14th International Conference , FPL 2004, Leuven, Belgium, August 30-
September 1, 2004, Proceedings Jürgen Becker, Marco Platzner Serge Vernalde
. Execution Speed of the Pattern Recognition Algorithm for ATLAS – High Energy
Physics Experiment Christian Hinkelbein, Andrei Khomich, Andreas Kugel,
Reinhard Männer, and Matthias Müller Institute of Computer Science V,
University of Mannheim, B6, 23-29, 68131, Mannheim, Germany {hinkelbein,
khomich, kugel, maenner, ...

Aspects of Modern Logic

It is common to consider an area of science as a system of real or sup posed truths which not only continuously extends itself, but also needs periodical revision and therefore tests the inventive capacity of each generation of scholars anew. It sounds highly implausible that a science at one time would be completed, that at that point within its scope there would be no problems left to solve. Indeed, the solution of a scientific problem inevitably raises new questions, so that our eagerness for knowledge will never find lasting satisfaction. Nevertheless there is one science which seems to form an exception to this rule, formal logic, the theory of rigorous argumentation. It seems to have reached the ideal endpoint of every scientific aspiration already very shortly after its inception; using the work of some predecessors, Aristotle, or so it is at least assumed by many, has brought this branch of science once and for all to a conclusion. Of course this doesn't sound that implausible. We apparently know what rigorous argumentation is; otherwise various sciences, in particular pure mathematics, would be completely impossible. And if we know what rigorous argumentation is, then it cannot be difficult to trace once and for all the rules which govern it. The unique subject of formal logic would therefore entail that this science, in variance with the rule which holds for all other sciences, has been able to reach completion at a certain point in history.

Our algorithm A3 evidently determines the set N3 or N1–N2 of all the sequences
of signs which belong to N1 but not to N2. EXAMPLE 4. Let the algorithm A4 be
characterized by: 1. the alphabet {a, b}; 2. the axiom ab; 3. the production u=>aub
. This algorithm determines the set N4 of those sequences of signs which consist
of a certain number of a's followed by an equal number of b's. EXAMPLE 5. Let
the algorithm. As be characterized by: 1. the alphabet {a, b}; 2. the axioms aa and
bb ...

Logic at Botik '89

Symposium on Logical Foundations of Computer Science, Pereslavl-Zalessky, USSR, July 3-8, 1989, Proceedings

The present volume contains the proceedings of Logic at Botik '89, a symposium on logical foundations of computer science organized by the Program Systems Institute of the USSR Academy of Sciences and held at Pereslavl-Zalessky, USSR, July 3-8, 1989. The scope of the symposium was very broad; the topics of interest were: complexity of formal systems, constructive mathematics in computer science, denotational and operational semantics of programs, descriptive complexity, dynamic and algorithmic logics and schematology, formal tools to describe concurrent computations, lambda calculus and related topics, foundations of logic programming, logical foundations of database theory, logics for knowledge representation, modal and temporal logics, type theory in programming, and verification of programs. Thus, the papers in this volume represent many interesting trends in logical foundations of Computer Science, ranging from purely theoretical research to practical applications of theory.

Symposium on Logical Foundations of Computer Science, Pereslavl-Zalessky,
USSR, July 3-8, 1989, Proceedings Albert R. Meyer, Michael A. Taitslin. A
mathematical modeling of pure, recursive algorithms Yiannis. N. Moschovakis*
Department of Mathematics, UCLA ...

Inductive Logic Programming

18th International Conference, ILP 2008 Prague, Czech Republic, September 10-12, 2008, Proceedings

This book constitutes the refereed proceedings of the 18th International Conference on Inductive Logic Programming, ILP 2008, held in Prague, Czech Republic, in September 2008. The 20 revised full papers presented together with the abstracts of 5 invited lectures were carefully reviewed and selected during two rounds of reviewing and improvement from 46 initial submissions. All current topics in inductive logic programming are covered, ranging from theoretical and methodological issues to advanced applications. The papers present original results in the first-order logic representation framework, explore novel logic induction frameworks, and address also new areas such as statistical relational learning, graph mining, or the semantic Web.

This can lead to subop- timal results given prediction tasks. On the other hand
better results in prediction problems have been achieved by discriminative
learning of MLNs weights given a certain structure. In this paper we propose an
algorithm for learning the structure of MLNs discriminatively by max- imimizing
the conditional likelihood of the query predicates instead of the joint likelihood of
all predicates. The algorithm chooses the structures by maximizing conditional
likelihood and ...

Logic Programming '87

Proceedings of the 6th Conference Tokyo, Japan, June 22-24, 1987

This volume contains most of the papers presented at the 6th Logic Programming Conference held in Tokyo, June 22-24, 1987. It is the successor of Lecture Notes in Computer Science volumes 221 and 264. The contents cover foundations, programming, architecture and applications. Topics of particular interest are constraint logic programming and parallelism. The effort to apply logic programming to large-scale realistic problems is another important subject of these proceedings.

CHASSIS, FUJITSU LIMITED 140, Miyamoto, Numazu, Shizuoka 410-03, Japan
ABSTRACT This paper is concerned with an algorithm for identifying an unknown
regular language from examples of its members and non-members. The
algorithm is based on the model inference algorithm given by Shapiro. In our
setting, however, a given first order language for describing a target logic
program has countably many unary predicate symbols: qo, qi, q%, . . .. On the
other hand, the oracle ...

Progress in Artificial Intelligence. Knowledge Extraction, Multi-agent Systems, Logic Programming, and Constraint Solving

10th Portuguese Conference on Artificial Intelligence, EPIA 2001, Porto, Portugal, December 17-20, 2001. Proceedings

This book constitutes the refereed proceedings of the 10th Portuguese Conference on Artificial Intelligence, EPTA 2001, held in Porto, Portugal, in December 2001. The 21 revised long papers and 18 revised short papers were carefully reviewed and selected from a total of 88 submissions. The papers are organized in topical sections on extraction of knowledge from databases, AI techniques for financial time series analysis, multi-agent systems, AI logics and logic programming, constraint satisfaction, and AI planning.

This paper proposes a stochastic, and complete, backtrack search algorithm for
Propositional Satisfiability (SAT). In recent years, randomization has become
pervasive in SAT algorithms. Incomplete algorithms for SAT, for example the
ones based on local search, often re- sort to randomization. Complete algorithms
also resort to randomization. These include, state-of-the-art backtrack search SAT
algorithms that often randomize variable selection heuristics. Moreover, it is plain
that the ...