Listing 1 - 10 of 481 | << page >> |
Sort by
|
Choose an application
Logic programming was based on first-order logic. Higher-order logics can also lead to theories of theorem-proving. This book introduces just such a theory, based on a lambda-calculus formulation of a clausal logic with equality, known as the Clausal Theory of Types. By restricting this logic to Horn clauses, a concise form of logic programming that incorporates functional programming is achieved. The book begins by reviewing the fundamental Skolem-Herbrand-Gödel Theorem and resolution, which are then extrapolated to a higher-order setting; this requires introducing higher-order equational unification which builds in higher-order equational theories and uses higher-order rewriting. The logic programming language derived has the unique property of being sound and complete with respect to Henkin-Andrews general models, and consequently of treating equivalent terms as identical. First published in 1993, the book can be used for graduate courses in theorem-proving, but will be of interest to all working in declarative programming.
Choose an application
Choose an application
Choose an application
Choose an application
The present reprint contains five articles accepted and published in the Special Issue "Logic and Computation 2023" of the MDPI "Mathematics" journal, covering several topics on computing science based on some form of logic. These topics include the model theory for formal logic-based formal specification and programming, logic mining and logic for games. It is hoped that the reprint will be interesting and useful for those working in the area of applying logic to computing.
Choose an application
Choose an application
Functional programming (Computer science) --- Logic programming --- Logic programming. --- Computer programming
Choose an application
Artificial intelligence --- Logic programming --- Intelligence artificielle --- Programmation logique --- Artificial intelligence. --- Logic programming. --- Logic Programming
Choose an application
Choose an application
This book develops the theory of typed feature structures, a data structure that generalizes both first-order terms and feature structures of unification-based grammars to include inheritance, typing, inequality, cycles and intensionality. The resulting synthesis serves as a logical foundation for grammars, logic programming and constraint-based reasoning systems. A logical perspective is adopted which employs an attribute-value description language along with complete equational axiomatizations of the various systems of feature structures. At the same time, efficiency concerns are kept in mind and complexity and representability results are provided. The application of feature structures to phrase structure grammars is described and completeness results are shown for standard evaluation strategies. Definite clause logic programs are treated as a special case of phrase structure grammars. Constraint systems are introduced and an enumeration technique is developed for solving arbitrary attribute-value logic constraints. This book, with its innovative approach to data structure, will be essential reading for researchers in computational linguistics, logic programming and knowledge representation. Its self-contained presentation makes it flexible enough to serve as both a research tool and a text book.
Listing 1 - 10 of 481 | << page >> |
Sort by
|