Hasil Pencarian  ::  Simpan CSV :: Kembali

Abstrak :
Mathematical logic for computer science is a mathematics textbook with theorems and proofs. The method of semantic tableaux provides an elegant way to teach logic that is both theoretically sound and easy to understand. The uniform use of tableaux-based techniques facilitates learning advanced logical systems based on what the student has learned from elementary systems. The logical systems presented are propositional logic, first-order logic, resolution and its application to logic programming, Hoare logic for the verification of sequential programs, and linear temporal logic for the verification of concurrent programs.

Abstrak :
This book constitutes the refereed proceedings of the 13th European Conference on Logics in Artificial Intelligence, held in Toulouse, France, in September 2012. The book includes 3 invited talks, 36 regular papers, and 5 system descriptions, selected from 107 submissions. The papers cover various aspects of theory and methods of logic for artificial intelligence.

Abstrak :
This book constitutes the refereed proceedings of the 19th Workshop on Logic, Language, Information and Communication, WoLLIC 2012, held in Buenos Aires, Argentina, in September 2012. The papers accompanying 8 invited lectures are presented together with 16 contributed papers; the latter were carefully reviewed and selected from 46 submissions. The papers report advances in inter-disciplinary research involving formal logic, theory of computation, foundations of mathematics, and computational linguistics.

Abstrak :
Questo libro su H. Soubies-Camy, l´algèbre logique appliquée aux techniques binaires, I parte, lezioni. H. Soubies-Camy, L´algèbre logique appliquée aux techniques binaires, II parte, disegni. J. Piesch, switching algebra. J.P. Roth: Una teoria per la progettazione logica dei Meccanismi Automatici.

Abstrak :
This book constitutes the refereed proceedings of the 6th International Workshop on Reachability Problems, RP 2012, held in Bordeaux, France, in September, 2012. The 8 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 15 submissions. The papers present current research and original contributions related to reachability problems in different computational models and systems such as algebraic structures, computational models, hybrid systems, logic and verification. Reachability is a fundamental problem that appears in several different contexts: finite and infinite-state concurrent systems, computational models like cellular automata and Petri nets, decision procedures for classical, modal and temporal logic, program analysis, discrete and continuous systems, time critical systems, and open systems modeled as games.

Abstrak :
This easy-to-follow textbook introduces the mathematical language, knowledge and problem-solving skills that undergraduates need to study computing. The language is in part qualitative, with concepts such as set, relation, function and recursion/induction, but it is also partly quantitative, with principles of counting and finite probability. Entwined with both are the fundamental notions of logic and their use for representation and proof. Features : teaches finite math as a language for thinking, as much as knowledge and skills to be acquired, uses an intuitive approach with a focus on examples for all general concepts, brings out the interplay between the qualitative and the quantitative in all areas covered, particularly in the treatment of recursion and induction, balances carefully the abstract and concrete, principles and proofs, specific facts and general perspectives, includes highlight boxes that raise common queries and clear confusions, and provides numerous exercises, with selected solutions.

Abstrak :
The European Summer School in Logic, Language and Information (ESSLLI) is organized every year by the Association for Logic, Language and Information (FoLLI) in different sites around Europe. The main focus of ESSLLI is on the interface between linguistics, logic and computation. ESSLLI offers foundational, introductory and advanced courses, as well as workshops, covering a wide variety of topics within the three areas of interest: Language and Computation, Language and Logic, and Logic and Computation. During two weeks, around 50 courses and 10 workshops are offered to the attendants, each of 1.5 hours per day during a five days week, with up to seven parallel sessions. ESSLLI also includes a student session (papers and posters by students only, 1.5 hour per day during the two weeks) and four evening lectures by senior scientists in the covered areas. The 15 revised full papers presented were carefully reviewed and selected. The papers are organized in topical sections on The papers are organized in topical sections on language and computation, logic and computation, and logic and language.