You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
When I first participated in exploring theories of nonmonotonic reasoning in the late 1970s, I had no idea of the wealth of conceptual and mathematical results that would emerge from those halting first steps. This book by Wiktor Marek and Miroslaw Truszczynski is an elegant treatment of a large body of these results. It provides the first comprehensive treatment of two influen tial nonmonotonic logics - autoepistemic and default logic - and describes a number of surprising and deep unifying relationships between them. It also relates them to various modal logics studied in the philosophical logic litera ture, and provides a thorough treatment of their applications as foundations for logic p...
This volume constitutes the refereed proceedings of the First International Conference on Rough Sets and Current Trends in Computing, RSCTC'98, held in Warsaw, Poland, in June 1998. The volume presents 82 revised papers carefully selected for inclusion in the proceedings; also included are five invited contributions. The volume is divided in topical sections on rough set methods, statistical inference, grammar systems and molecular computations, logic in rough sets, intelligent control, rough sets in knowledge discovery and data discovery, data mining, evolutionary computation, hybrid methods, etc..
The investigation of computational models of argument is a rich and fascinating interdisciplinary research field with two ultimate aims: the theoretical goal of understanding argumentation as a cognitive phenomenon by modeling it in computer programs, and the practical goal of supporting the development of computer-based systems able to engage in argumentation-related activities with human users or among themselves. The biennial International Conferences on Computational Models of Argument (COMMA) provide a dedicated forum for the presentation and discussion of the latest advancements in the field, and cover both basic research and innovative applications. This book presents the proceedings ...
This proceedings volume contains a selection of revised and extended papers presented at the Second International Workshop on Nonmonotonic and InductiveLogic, NIL '91, which took place at Reinhardsbrunn Castle, December 2-6, 1991. The volume opens with an extended version of a tutorial on nonmonotonic logic by G. Brewka, J. Dix, and K. Konolige. Fifteen selected papers follow, on a variety of topics. The majority of papers belong either to the area of nonmonotonic reasoning or to the field of inductive inference, but some papers integrate research from both areas. The first workshop in this series was held at the University of Karlsruhe in December 1990 and its proceedings were published as Lecture Notes in Artificial Intelligence Volume 543. The series of workshops was made possible by financial support from Volkswagen Stiftung, Hannover. This workshop was also supported by IBM Deutschland GmbH and Siemens AG.
This is the second in a series of workshops that are bringing together researchers from the theoretical end of both the logic programming and artificial intelligence communities to discuss their mutual interests. This workshop emphasizes the relationship between logic programming and non-monotonic reasoning.Luis' Moniz Pereira is Professor in the Department of Computer Science at the Universidade Nova Lisboa, Portugal. Anil Nerode is Professor and Director of the Mathematical Sciences Institute at Cornell University.Topics include: Stable Semantics. Autoepistemic Logic. Abduction. Implementation Issues. Well-founded Semantics. Truth Maintenance. Probabilistic Theories. Applications. Default Logic. Diagnosis. Complexity and Theory. Handling Inconsistency.
Topics covered: Theoretical Foundations. Higher-Order Logics. Non-Monotonic Reasoning. Programming Methodology. Programming Environments. Extensions to Logic Programming. Constraint Satisfaction. Meta-Programming. Language Design and Constructs. Implementation of Logic Programming Languages. Compilation Techniques. Architectures. Parallelism. Reasoning about Programs. Deductive Databases. Applications. 13-16 June 1995, Tokyo, Japan ICLP, which is sponsored by the Association for Logic Programming, is one of two major annual international conferences reporting recent research results in logic programming. Logic programming originates from the discovery that a subset of predicate logic could b...
Andrzej Mostowski was one of the leading 20th century logicians. This volume examines his legacy, devoted both to his scientific heritage and to the memory of him as a great researcher, teacher, organizer of science and person. It includes the bibliography of Mostowski's writings.
This book provides foundations for software specification and formal software development from the perspective of work on algebraic specification, concentrating on developing basic concepts and studying their fundamental properties. These foundations are built on a solid mathematical basis, using elements of universal algebra, category theory and logic, and this mathematical toolbox provides a convenient language for precisely formulating the concepts involved in software specification and development. Once formally defined, these notions become subject to mathematical investigation, and this interplay between mathematics and software engineering yields results that are mathematically intere...
The use of logic in databases started in the late 1960s. In the early 1970s Codd formalized databases in terms of the relational calculus and the relational algebra. A major influence on the use of logic in databases was the development of the field of logic programming. Logic provides a convenient formalism for studying classical database problems and has the important property of being declarative, that is, it allows one to express what she wants rather than how to get it. For a long time, relational calculus and algebra were considered the relational database languages. However, there are simple operations, such as computing the transitive closure of a graph, which cannot be expressed wit...