Sebanyak 173 item atau buku ditemukan

Logic Versus Approximation

Essays Dedicated to Michael M. Richter on the Occasion of His 65th Birthday

Nowadays knowledge-based systems research and development essentially employs two paradigms of reasoning. There are on the one hand the logic-based approaches where logic is to be understood in a rather broad sense; usually these approaches are used in symbolic domains where numerical calculations are not the core challenge. On the other hand we find approximation oriented reasoning; methods of these kinds are mainly applied in numerical domains where approximation is part of the scientific methodology itself. However, from an abstract level all these approaches do focus on similar topics and arise on various levels such as problem modeling, inference and problem solving techniques, algorithms and mathematical methods, mathematical relations between discrete and continuous properties, and are integrated in tools and applications. In accordance with the unifying vision and research interest of Michael M. Richter and in correspondence to his scientific work, this book presents 13 revised full papers advocating the integration of logic-based and approximation-oriented approaches in knowledge processing.

Problem-specific algorithms vs. heuristics, exact optimization vs. approximation
vs. heuristic solutions, guaranteed run time vs. expected run time vs.
experimental run time analysis. Here, a framework for a theory of randomized
search heuristics is presented. After a brief history of discrete optimization,
scenarios are discussed where randomized search heuristics are appropriate.
Different randomized se- arch heuristics are presented and it is argued why the
expected optimization time ...

Five Papers on Logic and Foundations

99, 1972 A METHOD OF PRESENTING THE THEORY OF ALGORITHMS AND
ENUMERABLE SETS* G. S. CEfllN §1. The purpose of this article is to describe a
mathematical formalism which for certain applications of the theory of algorithms
may be more convenient than normal algorithms, Turing machines, etc. For
example, in constructive analysis one often needs to prove the existence of
algorithms which operate in a prescribed manner. In many cases, the very
description of the ...

Foundations of Fuzzy Logic and Soft Computing

12th International Fuzzy Systems Association World Congress, IFSA 2007, Cancun, Mexico, Junw 18-21, 2007, Proceedings

Annotation This book comprises a selection of papers from IFSA 2007 on new methods and theories that contribute to the foundations of fuzzy logic and soft computing. These papers were selected from over 400 submissions and constitute an important contribution to the theory and applications of fuzzy logic and soft computing methodologies. Soft Computing consists of several computing paradigms, including fuzzy logic, neural networks, genetic algorithms, and other techniques, which can be used to produce powerful intelligent systems for solving real-world problems. This book is intended to be a major reference for scientists and engineers interested in applying new computational and mathematical tools to achieve intelligent solution to complex problems. We consider that this book can also be used to get novel ideas for new lines of research, or to continue the lines of research proposed by the authors of the papers contained in the book. The 80 papers presented were carefully reviewed and selected form more than 400 submissions. The papers are organized in topical sections on relation between interval and fuzzy techniques, intuitionistic fuzzy sets and their applications, the application of fuzzy logic and soft computing in flexible querying, philosophical and human-scientific aspects of soft computing, search engine and information processing and retrieval, perception based data mining and decision making, joint model-based and data-based learning: the fuzzy logic approach, fuzzy possibilistic optimization, fuzzy trees, fuzzy logic theory, type-2 fuzzy logic, fuzzy logic applications, neural networks and control, as well as intelligent agents and knowledge ant colony.

12th International Fuzzy Systems Association World Congress, IFSA 2007,
Cancun, Mexico, Junw 18-21, 2007, Proceedings Patricia Melin. A Cultural
Algorithm with Operator Parameters Control for Solving Timetabling Problems⋆
Carlos Soza1, Ricardo Landa2, Mar ́ıa Cristina Riff1, and Carlos Coello2 1
Universidad Federico Santa Mar ́ıa, Departamento de Informática Av. Espa ̃na No
. 1680, Valpara ́ıso, Chile {csoza ...

The Logic of Logistics

Theory, Algorithms, and Applications for Logistics Management

Fierce competition in today's global market provides a powerful motivation for developing ever more sophisticated logistics systems. This book, written for the logistics manager and researcher, presents a survey of the modern theory and application of logistics. The goal of the book is to present the state-of-the-art in the science of logistics management. As a result, the authors have written a timely and authoritative survey of this field that many practitioners and researchers will find makes an invaluable companion to their work.

2 2.1 Examples of convex sets and nonconvex sets . . . . . . . . . . . . 16 2.2
Illustration of the definition of convex function . . . . . . . . . . . 17 2.3 Illustration of the
definition of subgradient . . . . . . . . . . . . . 22 4.1 An example for the minimum
spanning tree-based algorithm with n =18 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75
4.2 An example for the nearest-insertion algorithm with n =8 . . . . 78 4.3 The
matching and the optimal traveling salesman tour . . . . . . 79 4.4 An example for
Christofides' algorithm ...

Artificial Intelligence in Logic Design

There are three outstanding points of this book. First: for the first time, a collective point of view on the role of artificial intelligence paradigm in logic design is introduced. Second, the book reveals new horizons of logic design tools on the technologies of the near future. Finally, the contributors of the book are twenty recognizable leaders in the field from the seven research centres. The chapters of the book have been carefully reviewed by equally qualified experts. All contributors are experienced in practical electronic design and in teaching engineering courses. Thus, the book's style is accessible to graduate students, practical engineers and researchers.

from Mishchenko's and our algorithms confirmed the above observation. The
decision diagram based exact algorithms are also inefficient for larger difficult
problem instances (e.g. for benchmarks “Flag” and “Mashroom” having 28 and 22
inputs, correspondingly (Mishchenko et al. 2000)). 5.2. QuickScan Inefficiency of
exact algorithms for larger instances of MISP motivates the development of faster
heuristic algorithms. Although the heuristic algorithms cannot guarantee the
optimal ...

Computation, Logic, Games, and Quantum Foundations - The Many Facets of Samson Abramsky

Essays Dedicted to Samson Abramsky on the Occasion of His 60th Birthday

This Festschrift volume, published in honor of Samson Abramsky, contains contributions written by some of his colleagues, former students, and friends. In celebration of the 60th birthday of Samson Abramsky, a conference was held in Oxford, UK, during May 28-30, 2010. The papers in this volume represent his manifold contributions to semantics, logic, games, and quantum mechanics.

This paper studies one of the best-known quantum algorithms — Shor's
factorisation algorithm — via categorical distributivity. A key aim of the paper is to
provide a minimal set of categorical requirements for key parts of the algorithm, in
order to establish the most general setting in which the required operations may
be performed efficiently. We demonstrate that Laplaza's theory of coherence for
distributivity [13,14] provides a purely categorical proof of the operational
equivalence of ...

Inductive Logic Programming

10th International Conference, ILP 2000, London, UK, July 24-27, 2000 Proceedings

Shan-HweiNienhuys-Cheng(UniversityofRotterdam,Netherlands) WilliamCohen(WhizbangsLabs,USA) LucDeRaedt(UniversityofFreiburg,Germany) Sa?soD?zeroski(Jo?zefStefanInstitute,Ljubljana) PeterFlach(UniversityofBristol,UK) AlanFrisch(UniversityofYork,UK) KoichiFurukawa(UniversityofKeio,Japan) RoniKhardon(UniversityofEdinburgh,UK) J¨org-UweKietz(SwissLife,Switzerland) NadaLavra?c(Jo?zefStefanInstitute,Slovenia) JohnLloyd(AustralianNationalUniversity,Australia) StanMatwin(UniversityofOttawa,Canada) RaymondMooney(UniversityofTexas,USA) StephenMuggleton(UniversityofYork,UK) DavidPage(UniversityofWisconsin,USA) BernhardPfahringer(UniversityofWaikato,NewZealand) C´elineRouveirol(Universit´edeParis-Sud,France) ClaudeSammut(UniversityofNewSouthWales,Australia) ´ Mich`eleSebag(EcolePolytechnique,France) AshwinSrinivasan(UniversityofOxford,UK) PrasadTadepalli(OregonStateUniversity,USA) StefanWrobel(UniversityofMagdeburg,Germany) AkihiroYamamoto(UniversityofHokkaido,Japan) Additional Referees ´ ErickAlphonse(Universit´edeParis-Sud,France) LiviuBadea(NationalInstituteforResearchandDevelopmentinInformatics, Romania) DamjanDemsar(Jo?zefStefanInstitute,Slovenia) ElisabethGoncalves(Universit´edeParis-Sud,France) MarkoGrobelnik(Jo?zefStefanInstitute,Slovenia) ClaireKennedy(UniversityofBristol,UK) DanielKudenko(UniversityofYork,UK) JohanneMorin(UniversityofOttawa,Canada) TomonobuOzaki(KeioUniversity,Japan) EdwardRoss(UniversityofBristol,UK) LjupcoTodorovski(Jo?zefStefanInstitute,Slovenia) V´eroniqueVentos(Universit´edeParis-Sud,France) VIII ProgramCommitteeandReferees Sponsors of ILP2000 ILPNet2,TheEuropeanNetworkofExcellenceinInductiveLogicProgramming MLNet,TheEuropeanNetworkofExcellenceinMachineLearning CompulogNet,TheEuropeanNetworkofExcellenceinComputationalLogic Table of Contents IInvitedPaper ILP:JustDoIt. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 DavidPage II Contributed Papers ANewAlgorithmforLearningRangeRestrictedHornExpressions. . . . . . . 21 MartaArias,RoniKhardon ARe?nementOperatorforDescriptionLogics. . . . . . . . . . . . . . . . . . . . . . . . . 40 LiviuBadea,Shan-HweiNienhuys-Cheng ExecutingQueryPacksinILP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60 HendrikBlockeel,LucDehaspe,BartDemoen,GerdaJanssens, JanRamon,HenkVandecasteele ALogicalDatabaseMiningQueryLanguage . . . . . . . . . . . . . . . . . . . . . . . . . . 78 LucDeRaedt Induction of Recursive Theories in the Normal ILP Setting: Issues and Solutions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93 FlorianaEsposito,DonatoMalerba,FrancescaA. Lisi ExtendingK-MeansClusteringtoFirst-OrderRepresentations. . . . . . . . . . . 112 MathiasKirsten,StefanWrobel TheoryCompletionUsingInverseEntailment . . . . . . . . . . . . . . . . . . . . . . . . . . 130 StephenH. Muggleton,ChristopherH. Bryant SolvingSelectionProblemsUsingPreferenceRelationBasedonBayesian Learning. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 147 TomofumiNakano,NobuhiroInuzuka ConcurrentExecutionofOptimalHypothesisSearchforInverse Entailment. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 165 HayatoOhwada,HiroyukiNishiyama,FumioMizoguchi UsingILPtoImprovePlanninginHierarchicalReinforcementLearning. . . 174 MarkReid,MalcolmRyan X TableofContents TowardsLearninginCARIN-ALN. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 191 C´elineRouveirol,V´eroniqueVentos InverseEntailmentinNonmonotonicLogicPrograms. . . . . . . . . . . . . . . . . . . 209 ChiakiSakama ANoteonTwoSimpleTransformationsforImprovingtheE?ciencyofan ILPSystem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 225 V´?torSantosCosta,AshwinSrinivasan,RuiCamacho SearchingtheSubsumptionLattic

10th International Conference, ILP 2000, London, UK, July 24-27, 2000
Proceedings James Cussens, Alan Frisch. A New Algorithm for Learning Range
Restricted Horn Expressions⋆ (Extended Abstract) Marta Arias and Roni
Khardon Division of Informatics, University of Edinburgh The King's Buildings,
Edinburgh EH9 3JZ, Scotland {marta ...

Southeast Asian Conference on Logic

The visit of Gerald Sacks to the National University of Singapore in 1981 provided an opportunity to organize a short conference in Mathematical Logic. We were fortunate to receive encouragement and material support for this venture from several sources. Specific acknowledgements are made below. Sponsorship of the conference by the Association for Symbolic Logic was received and gave added inspiration. A final word in this connexion concerns the debt we owe to invited speakers who were able to provide for travel expenses from their own resources. Their presence at the conference would not have been possible otherwise. The publication of these Proceedings came about through an initiative of North Holland. The progress in producing the volume has been somewhat fitful, and we appreciate their forbearance and understanding. The items herein, with some exceptions, are written versions of invited talks given at the conference. Abstracts of contributed papers have appeared in the Journal of Symbolic Logic. The two workshops: in Recursion Theory by Mark Tamthai and Model Theory by Chris Ash, which were held in conjunction with the conference, are not recorded. We were fortunate to receive editorial assistance from John Bell during his visit to NUS. A great debt is owed to Mimi Bell and Madam Lam for producing the splendid typescript for the volume.

Introduction Throughout the history of Mathematics, there has been an interest in
finding algorithms to solve problems or perform computations. Simple examples
of algorithms are long division and the sieve of Eratosthenes for determining
whether or not a number is a prime. A famous example of the search for an
algorithm is Hilbert's Tenth Problem which was to find an algorithm which would
indicate whether or not a diophantine equation with integral coefficients has a
solution in the ...

Evaluation of a Fuzzy Logic Ramp Metering Algorithm

A Comparative Study Among Three Ramp Metering Algorithms Used in the Greater Seattle Area