Listing 1 - 8 of 8 |
Sort by
|
Choose an application
The development of computing machines found great success in the last decades. But the ongoing miniaturization of integrated circuits will reach its limits in the near future. Shrinking transistor sizes and power dissipation are the major barriers in the development of smaller and more powerful circuits. Reversible logic provides an alternative that may overcome many of these problems in the future. For low-power design, reversible logic offers significant advantages since zero power dissipation will only be possible if computation is reversible. Furthermore, quantum computation profits from enhancements in this area, because every quantum circuit is inherently reversible and thus requires reversible descriptions. However, since reversible logic is subject to certain restrictions (e.g. fanout and feedback are not directly allowed), the design of reversible circuits significantly differs from the design of traditional circuits. Nearly all steps in the design flow (like synthesis, verification, or debugging) must be redeveloped so that they become applicable to reversible circuits as well. But research in reversible logic is still at the beginning. No continuous design flow exists so far. In Towards a Design Flow for Reversible Logic, contributions to a design flow for reversible logic are presented. This includes advanced methods for synthesis, optimization, verification, and debugging. Formal methods like Boolean satisfiability and decision diagrams are thereby exploited. By combining the techniques proposed in the book, it is possible to synthesize reversible circuits representing large functions. Optimization approaches ensure that the resulting circuits are of small cost. Finally, a method for equivalence checking and automatic debugging allows to verify the obtained results and helps to accelerate the search for bugs in case of errors in the design. Combining the respective approaches, a first design flow for reversible circuits of significant size results.
Engineering. --- Circuits and Systems. --- Systems engineering. --- Ingénierie --- Ingénierie des systèmes --- Computer architecture. --- Computer logic. --- Logic programming.
Choose an application
In dit boek worden de bouwstenen van het programmeren in het algemeen en het objectgeoriënteerd programmeren in het bijzonder aangereikt op maat van leerlingen uit de derde graad van het secundair onderwijs. Spelenderwijs verdiepen we ons via de educatieve programmeeromgeving BlueJ in de programmeertaal Java. De controlestructuren, zoals selectie en iteratie, komen pas aan bod wanneer dit nodig is en staan niet los van het objectgeoriënteerd programmeren.In dit handboek vind je naast theoretische achtergrond ook heel veel demo-materiaal. Bovendien volgt na elk bouwsteentje steeds een basisoefening en zijn alle hoofdstukken voorzien van een uitgebreide verzameling herhalingsoefeningen.Leren programmeren is een aanrader voor elke leerling die zich wil voorbereiden op het eerste jaar van een richting informaticawetenschappen in het hoger onderwijs.https://www.acco.be/nl-be/items/9789462927193/Leren-programmeren
Programmeren --- Java (programmeertaal) --- BlueJ --- Logic programming --- Java (Computer program language) --- Handbooks, manuals, etc. --- PXL-IT 2018 --- informatica --- programmeren --- Java --- Secundair onderwijs --- 3e graad secundair onderwijs --- Informatica --- Kind
Choose an application
The ILP conference series has been the premier forum for work on logic-based approaches to machine learning for almost two decades. The 19th International Conference on Inductive Logic Programming, which was organized in Leuven, July2-4,2009,continuedthistraditionbutalsoreachedouttoothercommunities as it was colocated with SRL-2009 - the International Workshop on Statistical RelationalLearning,andMLG-2009-the7thInternationalWorkshoponMining andLearningwithGraphs. While thesethreeseriesofeventseachhavetheirown focus,emphasis andtradition,they essentiallysharethe problemthatis studied: learning about structured data in the form of graphs, relational descriptions or logic. The colocation of the events was intended to increase the interaction between the three communities. There was a single program with joint invited and tutorial speakers, a panel, regular talks and poster sessions. The invited speakers and tutorial speakers were James Cussens, Jason Eisner, Jure Leskovec, Raymond Mooney, Scott Sanner, and Philip Yu. The panel featured Karsten Borgwardt, Luc De Raedt, Pedro Domingos, Paolo Frasconi, Thomas Gart ¨ ner, Kristian Kersting, Stephen Muggleton, and C. David Page. Video-recordings of these talks can be found atwww. videolectures. net. The overall program featured 30 talks presented in two parallel tracks and 53 posters. The talks and posters were selected on the basis of an extended abstract. These abstracts can be found at http:// dtai. cs. kuleuven. be/ilp-mlg-srl/. Inaddition,asinpreviousyears,a- lectionofthepapersofILP2009havebeenpublishedinavolumeintheLectures Notes in Arti?cial Intelligence seriesandinaspecialissueoftheMachine Lea- ing Journal.
Artificial intelligence. Robotics. Simulation. Graphics --- Induction (Logic) --- Logic programming --- 681.3*F1 <063> --- 681.3*F41 <063> --- 681.3*H28 <063> --- 681.3*H3 <063> --- 681.3*I23 <063> --- 681.3*J2 <063> --- Inductive logic --- Logic, Inductive --- Logic --- Reasoning --- 681.3*I23 <063> Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence)--Congressen --- Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence)--Congressen --- 681.3*J2 <063> Physical sciences and engineering (Computer applications)--Congressen --- Physical sciences and engineering (Computer applications)--Congressen --- Computation by abstract devices--Congressen --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23}--Congressen --- Database applications (Data mining- Image databases - Scientific databases - Spatial databases and GIS - Statistical databases) --- --Information storage and retrieval--Congressen --- Conferences - Meetings
Choose an application
This book introduces the notions and methods of formal logic from a computer science standpoint, covering propositional logic, predicate logic, and foundations of logic programming. It presents applications and themes of computer science research such as resolution, automated deduction, and logic programming in a rigorous but readable way. The style and scope of the work, rounded out by the inclusion of exercises, make this an excellent textbook for an advanced undergraduate course in logic for computer scientists. This is a short introductory book on the topic of propositional and first-order logic, with a bias towards computer scientists…. Schöning decides to concentrate on computational issues, and gives us a short book (less than 170 pages) with a tight storyline…. I found this a nicely written book with many examples and exercises (126 of them). The presentation is natural and easy to follow…. This book seems suitable for a short course, a seminar series, or part of a larger course on Prolog and logic programming, probably at the advanced undergraduate level. — SIGACT News Contains examples and 126 interesting exercises which put the student in an active reading mode.... Would provide a good university short course introducing computer science students to theorem proving and logic programming. — Mathematical Reviews This book concentrates on those aspects of mathematical logic which have strong connections with different topics in computer science, especially automated deduction, logic programming, program verification and semantics of programming languages.... The numerous exercises and illustrative examples contribute a great extent to a better understanding of different concepts and results. The book can be successfully used as a handbook for an introductory course in artificial intelligence. — Zentralblatt MATH.
Programming --- Computer science --- Mathematical logic --- Logic, Symbolic and mathematical. --- Logic programming. --- Computer science. --- Mathematical Logic and Formal Languages. --- Mathematical Logic and Foundations. --- Algebra of logic --- Logic, Universal --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Informatics --- Science --- Mathematical logic. --- Logique mathématique --- Programmation logique --- Logique des prédicats
Choose an application
This book constitutes the refereed proceedings of the 23rd International Conference on Algorithmic Learning Theory, ALT 2012, held in Lyon, France, in October 2012. The conference was co-located and held in parallel with the 15th International Conference on Discovery Science, DS 2012. The 23 full papers and 5 invited talks presented were carefully reviewed and selected from 47 submissions. The papers are organized in topical sections on inductive inference, teaching and PAC learning, statistical learning theory and classification, relations between models and data, bandit problems, online prediction of individual sequences, and other models of online learning.
Computer algorithms --- Machine learning --- 681.3*F1 --- 681.3*F2 --- 681.3*F41 --- 681.3*I23 --- 681.3*I26 --- 681.3*I2 --- 681.3*I23 Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence) --- Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence) --- 681.3*F1 Computation by abstract devices --- Computation by abstract devices --- 681.3*I2 Artificial intelligence. AI --- Artificial intelligence. AI --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*I26 Learning: analogies; concept learning; induction; knowledge acquisition; language acquisition; parameter learning (Artificial intelligence)--See also {681.3*K32} --- Learning: analogies; concept learning; induction; knowledge acquisition; language acquisition; parameter learning (Artificial intelligence)--See also {681.3*K32} --- Conferences - Meetings
Choose an application
This volume contains the research papers presented at the 17th International Conference on Logic for Programming, Arti?cial Intelligence, and Reasoning (LPAR-17), held in Yogyakarta, Indonesia, October 10-15, 2010, accompanied by the 8th International Workshop on the Implementation of Logic (IWIL-8, organized by Eugenia Ternovska, Stephan Schulz, and Geo? Sutcli?e) and the 5th International Workshop on Analytic Proof Systems (APS-5, organized by Matthias Baaz and Christian Fermuller ¨ ). The call for papers attracted 133 abstract submissions of which 105 ma- rialized into full submissions, each of which was assigned for reviewing to at least three Program Committee members; 41 papers were accepted after - tense discussions. Once more the EasyChair system provided an ideal platform for submission, reviewing, discussions, and collecting ?nal versions of accepted papers. The program included three invited talks by Krishnendu Chatterjee, Joseph Halpern, and Michael Maher, as well as an invited tutorial by Norbert Preining. They are documented by the corresponding papers and abstract, respectively, in these proceedings, which this year appear for the ?rst time in the ARCoSS subline of the Lecture Notes in Computer Science.
Computer Science. --- Artificial Intelligence (incl. Robotics). --- Software Engineering. --- Logics and Meanings of Programs. --- Mathematical Logic and Formal Languages. --- Programming Techniques. --- Programming Languages, Compilers, Interpreters. --- Computer science. --- Software engineering. --- Logic design. --- Artificial intelligence. --- Informatique --- Génie logiciel --- Structure logique --- Intelligence artificielle --- Artificial intelligence --- Automatic theorem proving --- Logic programming --- 681.3*D24 --- 681.3*F3 --- 681.3*F41 --- 681.3*I23 --- Computer programming --- Automated theorem proving --- Theorem proving, Automated --- Theorem proving, Automatic --- Proof theory --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Program verification: assertion checkers; correctness proofs; reliability; validation (Software engineering)--See also {681.3*F31} --- Logics and meanings of programs (Theory of computation) --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence) --- 681.3*I23 Deduction and theorem proving: answer/reason extraction; reasoning; resolution; metatheory; mathematical induction; logic programming (Artificial intelligence) --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F3 Logics and meanings of programs (Theory of computation) --- 681.3*D24 Program verification: assertion checkers; correctness proofs; reliability; validation (Software engineering)--See also {681.3*F31}
Choose an application
This volume contains the proceedings of the 9th International Symposium on Functional and Logic Programming (FLOPS 2008), held in Ise, Japan, April 14-16, 2008 at the Ise City Plaza. FLOPS is a forum for research on all issues concerning functional progr- ming and logic programming. In particular it aims to stimulate the cro- fertilization as well as integration of the two paradigms. The previous FLOPS meetings took place in Fuji-Susono (1995), Shonan (1996), Kyoto (1998), Tsukuba(1999),Tokyo(2001),Aizu (2002),Nara(2004),and againFuji-Susono (2006). Since its 1999 edition, FLOPS proceedings have been published by Springer in itsLecture Notes in Computer Science series,as volumes 1722,2024, 2441, 2998 and 3945, respectively. In response to the call for papers, 59 papers were submitted. Each paper was reviewedbyatleastthreeProgramCommittee members,withthe helpofexpert external reviewers. The Program Committee meeting was conducted electro- cally, for a period of two weeks in December 2007. After careful and thorough discussion,the ProgramCommittee selected20 papers(33%)for presentationat theconference.Inadditiontothe20contributedpapers,thesymposiumincluded talks by three invited speakers: Peter Dybjer (Chalmers University of Techn- ogy), Naoki Kobayashi (Tohoku University) and Torsten Schaub (University of Potsdam).
Mathematical logic --- Computer science --- Programming --- Artificial intelligence. Robotics. Simulation. Graphics --- programmeren (informatica) --- programmeertalen --- wiskunde --- KI (kunstmatige intelligentie) --- logica --- robots --- Programming languages (Electronic computers). --- Computer programming. --- Computer logic. --- Mathematical logic. --- Artificial intelligence. --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Algebra of logic --- Logic, Universal --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Computer science logic --- Logic, Symbolic and mathematical --- Computers --- Electronic computer programming --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory --- Computer languages --- Computer program languages --- Computer programming languages --- Machine language --- Languages, Artificial --- Logic programming
Choose an application
This textbook covers logical and relational learning in depth, and hence provides an introduction to inductive logic programming (ILP), multirelational data mining (MRDM) and (statistical) relational learning (SRL). These subfields of data mining and machine learning are concerned with the analysis of complex and structured data sets that arise in numerous applications, such as bio- and chemoinformatics, network analysis, Web mining, natural language processing, within the rich representations offered by relational databases and computational logic. The author introduces the machine learning and representational foundations of the field and explains some important techniques in detail by using some of the classic case studies centered around well-known logical and relational systems. The book is suitable for use in graduate courses and should be of interest to graduate students and researchers in computer science, databases and artificial intelligence, as well as practitioners of data mining and machine learning. It contains numerous figures and exercises, and slides are available for many chapters.
Computer science. --- Software engineering. --- Database management. --- Data mining. --- Information storage and retrieval. --- Artificial intelligence. --- Computer Science. --- Software Engineering/Programming and Operating Systems. --- Artificial Intelligence (incl. Robotics). --- Data Mining and Knowledge Discovery. --- Database Management. --- Information Storage and Retrieval. --- Information Systems Applications (incl. Internet). --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Algorithmic knowledge discovery --- Factual data analysis --- KDD (Information retrieval) --- Knowledge discovery in data --- Knowledge discovery in databases --- Mining, Data --- Database searching --- Data base management --- Data services (Database management) --- Database management services --- DBMS (Computer science) --- Generalized data management systems --- Services, Database management --- Systems, Database management --- Systems, Generalized database management --- Computer software engineering --- Engineering --- Informatics --- Science --- Logic programming. --- Uncertainty (Information theory) --- Machine learning --- Statistical methods. --- Learning, Machine --- Artificial intelligence --- Measure of uncertainty (Information theory) --- Shannon's measure of uncertainty --- System uncertainty --- Information measurement --- Probabilities --- Questions and answers --- Computer programming --- Information Technology --- Artificial Intelligence --- Data mining --- Logic programming --- Relational databases --- Apprentissage automatique --- Exploration de données (Informatique) --- Programmation logique --- Bases de données relationnelles --- Information storage and retrieva. --- Artificial Intelligence. --- Information storage and retrieval systems. --- Automatic data storage --- Automatic information retrieval --- Automation in documentation --- Computer-based information systems --- Data processing systems --- Data storage and retrieval systems --- Discovery systems, Information --- Information discovery systems --- Information processing systems --- Information retrieval systems --- Machine data storage and retrieval --- Mechanized information storage and retrieval systems --- Computer systems --- Electronic information resources --- Data libraries --- Digital libraries --- Information organization --- Information retrieval --- Application software. --- Application computer programs --- Application computer software --- Applications software --- Apps (Computer software) --- Computer software --- Artificial intelligence. Robotics. Simulation. Graphics
Listing 1 - 8 of 8 |
Sort by
|