A logical calculus for problem solving in highly structured application domains (Q1115646)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A logical calculus for problem solving in highly structured application domains |
scientific article; zbMATH DE number 4087076
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A logical calculus for problem solving in highly structured application domains |
scientific article; zbMATH DE number 4087076 |
Statements
A logical calculus for problem solving in highly structured application domains (English)
0 references
1988
0 references
We propose a modification of the sequential first-order predicate calculus designed to bring the logical system of concepts closer to that of ``artificial intelligence''. We modify the calculus by introducing the notion of a class of objects as a collection of objects having the same structure and provide rules of inference and application of assertions about membership of objects in a certain class, allowing for the internal structure of the objects. We discuss the application of this calculus to the formalization of the central issue of artificial intelligence: finding an adequate representation of the problem as part of the problem solving procedure.
0 references
inference rules
0 references
sequential first-order predicate calculus
0 references
problem solving
0 references
0.89041096
0 references
0.8811505
0 references
0.8708399
0 references
0.8688504
0 references