You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This volume presents the proceedings of the 6th Portuguese Conference on Artificial Intelligence, EPIA '93, organized by the Portuguese Artificial Intelligence Association. Like the last two conferences in this series, it was run as an international event with strict requirements as to the quality of accepted submissions. Fifty-one submissions were receivedfrom 9 countries, the largest numbers coming from Portugal (18), Germany (10), and France (8). The volume contains 25 selected papers, together with 7 poster abstracts and one invited lecture: "Organizations as complex, dynamic design problems" by L. Gasser, I. Hulthage, B. Leverich, J. Lieb, and A. Majchrzak, all from the University of Southern California. The papersare grouped into parts on: distributed artificial intelligence, natural language processing, knowledge representation, logic programming, non-standard logics, automated reasoning, constraints, planning, and learning.
This book presents the refereed proceedings of the 7th Portuguese Conference on Artificial Intelligence, EPIA'95, held in Funchal, Madeira Island, Portugal, in October 1995. The 30 revised full papers and the 15 poster presentations included were selected during a highly competitive selection process from a total of 167 submissions from all over the world. Among the topics covered are automated reasoning and theorem proving, belief revision, constraint-based reasoning, distributed artificial intelligence, genetic algorithms, machine learning, neural networks, non-monotonic reasoning, planning and case-based reasoning, qualitative reasoning, robotics and control, and theory of computation.
This book constitutes the proceedings of the 15th International Conference on Language and Automata Theory and Applications, LATA 2021, held in Milan, Italy, in March 2021. The 26 full papers presented in this volume were carefully reviewed and selected from 52 submissions. They were organized in topical sections named: algebraic structures; automata; complexity; learning; logics and languages; trees and graphs; and words and strings.
Artificial Intelligence applications build on a rich and proven theoretical background to provide solutions to a wide range of real life problems. The ever expanding abundance of information and computing power enables researchers and users to tackle higly interesting issues for the first time, such as applications providing personalized access and interactivity to multimodal information based on preferences and semantic concepts or human-machine interface systems utilizing information on the affective state of the user. The purpose of the 3rd IFIP Conference on Artificial Intelligence Applications and Innovations (AIAI) is to bring together researchers, engineers, and practitioners interested in the technical advances and business and industrial applications of intelligent systems. AIAI 2006 is focused on providing insights on how AI can be implemented in real world applications.
This book constitutes the thoroughly refereed papers of the 15th International Conference on Implementation and Application of Automata, CIAA 2010, held in Manitoba, Winnipeg, Canada, in August 2010. The 26 revised full papers together with 6 short papers were carefully selected from 52 submissions. The papers cover various topics such as applications of automata in computer-aided verification; natural language processing; pattern matching, data storage and retrieval; bioinformatics; algebra; graph theory; and foundational work on automata theory.
Regular languages have a wide area of applications. This makes it an important task to convert between different forms of regular language representations, and to compress the size of such representations. This book studies modern aspects of compressions and conversions of regular language representations. The first main part presents methods for lossy compression of classical finite automata. Lossy compression allows to reduce the size of a language representation below the limits of classical compression methods, by the cost of introducing tolerable errors to the language. The complexity of many problems related to compression with respect to different error profiles is classified. The other main part is devoted to the study of biautomata, which were recently introduced as a new descriptional model for regular languages. Although biautomata are in many ways similar to finite automata, this book carves out some notable differences. While classical methods for finite automata can successfully be applied to biautomata, one observes a drastic increase of the computational complexity when considering lossy compression for biautomata.
This book constitutes the thoroughly refereed post-conference proceedings of the 13th International Conference on Relational and Algebraic Methods in Computer Science, RAMiCS 13, held in Cambridge, UK, in September 2012. The 23 revised full papers presented were carefully selected from 39 submissions in the general area of relational and algebraic methods in computer science, adding special focus on formal methods for software engineering, logics of programs and links with neighboring disciplines. The papers are structured in specific fields on applications to software specification and correctness, mechanized reasoning in relational algebras, algebraic program derivation, theoretical foundations, relations and algorithms, and properties of specialized relations.
Constraint-based linguistics is intersected by three fields: logic, linguistics, and computer sciences. The central theme that ties these different disciplines together is the notion of a linguistic formalism or metalanguage. This metalanguage has good mathematical properties, is designed to express descriptions of language, and has a semantics that can be implemented on a computer. Constraints, Language and Computation discusses the theory and practice of constraint-based computational linguistics. The book captures both the maturity of the field and some of its more interesting future prospects during a particulary important moment of development in this field.
This book constitutes the refereed proceedings of the 10th Conference on Computability in Europe, CiE 2014, held in Budapest, Hungary, in June 2014. The 42 revised papers presented were carefully reviewed and selected from 78 submissions and included together with 15 invited papers in this proceedings. The conference had six special sessions: computational linguistics, bio-inspired computation, history and philosophy of computing, computability theory, online algorithms and complexity in automata theory.
This book constitutes the proceedings of the 24th International Conference on Implementation and Application of Automata, CIAA 2019, held in Kosice, Slovakia, in July 2019. The 17 regular papers presented together with 2 invited papers in this book were carefully reviewed and selected from 29 initial submissions. The topics of the papers include complexity of languages and language operations, regular expressions, picture languages, jumping automata, input driven and two-dimensional automata, tree languages and tree transducers, architecture of oritatami systems, intruder deduction problem, context sensitive ash codes, rational relations, and algorithms for manipulating sequence binary decision diagrams