China 
Africa 
Explore chapters and articles related to this topic
Principles in Logic Programming
Published in Konar Amit, Artificial Intelligence and Soft Computing, 2018
The main advantage of logic programming lies in the declarative formulation of the problem without specifying an algorithm for its solution. Non-Horn clause based logic programs are currently gaining significance for their inherent advantage of representing negated antecedents. These programs have many interpretations and determination of the least interpretation requires stratification of the clauses. For the real world applications, the constraints of a specific problem are also added with the classical definition of the problem. These programs are referred to as CLP. When the constraints have unequal weights, we call the logic programs HCLP. In HCLP, if solutions satisfying all the constraints are not available, then the solutions that satisfy some of the hierarchically ordered constraints are filtered. Logic programming has been successfully used in many commercial applications including prediction of the share market fluctuations [5] and scheduling teams of players in tournaments [5].
VLSI Architectures for Supercomputing
Published in Hojjat Adeli, Supercomputing in Engineering Analysis, 2020
Since Horn clauses do not specify the execution sequences, logic programming enables users to concentrate more easily on the logic of problem solving without understanding the executional behavior of a program, while providing system designers a great flexibility on directing the behavior. To visualize the flexibility of execution, one can represent a query and its associated clauses as an AND/OR tree (see example below). The solution of a query is then the traversal of the tree. Since the traversal can be performed either forward or backward, and either sequentially or concurrently, all kinds of execution models can be constructed for the solution of logic programs. The concurrent traversal constitutes a large amount of AND and OR parallelism.
Types of Robols and Their Integration into Computer-Integrated Manufacturing Systems
Published in Ulrich Rembold, Robot Technology and Applications, 2020
The general implementation languages for robot control sofware are Pascal, Modula 2, C, and often Assembler. Logic programming languages like Prolog and logic control structures are increasingly being used to implement planning and control systems for intelligent robots. Various hierarchically structured control system architectures have been proposed. The real-time requirements to be fulfilled for fast information processing in autonomous robot systems necessitate the development of innovative hardware architectures. Currently, neural networks with parallel hardware architectures have been proposed for robots. They have a control structure that allows a fast response to exceptions.
On recent applications of paraconsistent logic: an exploratory literature review
Published in Journal of Applied Non-Classical Logics, 2019
One particularly useful formalism in the context of engineering applications is Subrahmanian's annotated logics.1 It was introduced as a foundation for paraconsistent logic programming (Blair & Subrahmanian, 1988). These ideas were closely related to the logic APC for reasoning with inconsistency later proposed by Kifer and Lozinskii (1992), further extended by Kifer and Subrahmanian (1992). The foundations and applications of these logics were further investigated by da Costa, Abe and others (Abe, Akama, & Nakamatsu, 2015; da Costa & Subrahmanian, 1989; Lu, Henschen, Subrahmanian, & da Costa, 1991). Annotated logics, as well as logic programming paradigms based on these logics, have been widely used for applications in knowledge representation and databases (Arenas, Bertossi, & Kifer, 2000; Subrahmanian, 1994).