Computational logic

About: Computational logic is a research topic. Over the lifetime, 4185 publications have been published within this topic receiving 135716 citations.

Modern Computer Algebra

Abstract: Computer algebra systems are now ubiquitous in all areas of science and engineering. This highly successful textbook, widely regarded as the 'bible of computer algebra', gives a thorough introduction to the algorithmic basis of the mathematical engine in computer algebra systems. Designed to accompany one- or two-semester courses for advanced undergraduate or graduate students in computer science or mathematics, its comprehensiveness and reliability has also made it an essential reference for professionals in the area. Special features include: detailed study of algorithms including time analysis; implementation reports on several topics; complete proofs of the mathematical underpinnings; and a wide variety of applications (among others, in chemistry, coding theory, cryptography, computational logic, and the design of calendars and musical scales). A great deal of historical information and illustration enlivens the text. In this third edition, errors have been corrected and much of the Fast Euclidean Algorithm chapter has been renovated.

Logic Programming

Abstract: Publisher Summary This chapter focuses on logic programming, which is closely related to PROLOG. Logic programming constitutes the theoretical framework of PROLOG. This close connection led to the adoption of logic programming as the basis for the influential Japanese Fifth Generation Project. The power of logic programming stems from two reasons. First, it is an extremely simple formalism. It also relies on mathematical logic, which developed its own methods and techniques and which provides a rigorous mathematical framework. The chapter presents a self-contained introduction to the theory of logic programming. It also discusses the causal dependence between various concepts and notions and presents the notion of SLD-resolution, which is central to the subject of logic programming.

The Logic of Decision

Abstract: "[This book] proposes new foundations for the Bayesian principle of rational action, and goes on to develop a new logic of desirability and probabtility."-Frederic Schick, "Journal of Philosophy"

A computational logic

Abstract: • Constraint domains in which the possible values that a variable can take are restricted to a finite set. • Examples: Boolean constraints, or integer constraints in which each variable is constrained to lie in within a finite range of integers. • Widely used in constraint programming. • Many real problems can be easily represented using constraint domains, e.g.: scheduling, routing and timetabling. • They involve choosing amongst a finite number of possibilities. • Commercial importance to many businesses: e.g. deciding how air crews should be allocated to aircraft flights. • Developed methods by different research communities: Arc and node consistency techniques (artificial intelligence). Bounds propagation techniques (constraint programming). Integer programming (operations research).