Logic production systems: Analysis and synthesis
Many applied systems can be described in the following terms: given is a certain number of objects and a set of rules to construct new object from the original objects and from previously constructed objects. Mathematicians call such systems deductive, or calculi. Artificial intelligence scientists subsequently improved and elaborated the notion of production, retaining the Post operator A {yields} B as a basic element or a core. Production models are generally regarded as lacking a rigorous theory and governed by heuristics. Maslov noted: {open_quotes}We may assume that the language of calculi will become in the near future as natural and as widespread in new applications of discrete mathematics as, for instance, the language of graph theory is today.{close_quotes} Studies whose results are surveyed below were triggered by the development of applications of production systems in dual expert systems and focus around the following topics: (1) formalization of logic production systems (Pospelov has noted that results in the theory of production systems can be obtained by restricting the notion of productions and production systems); (2) analysis of completeness of logic production systems as a tool for realization of Boolean functions; (3) construction of a universal algorithmic model based on a logic production system; (4) construction of algorithms that synthesize the domain of deductive derivability of a given goal fact and analysis of algorithmic complexity of the corresponding problem. It is important to note that the results obtained so far relate to a strictly defined subclass - the subclass of logic production systems and machines. They do not pretend to cover the wider domain of applicability of the apparatus of deductive systems. Classical concepts and propositions of discrete mathematics used in this paper without further explanation are defined in existing literature.
- OSTI ID:
- 457586
- Journal Information:
- Cybernetics and Systems Analysis, Vol. 30, Issue 4; Other Information: PBD: Mar 1995; TN: Translated from Kibernetika i Sistemnyi Analiz; No. 4, 11-22(Jul-Aug 1994)
- Country of Publication:
- United States
- Language:
- English
Similar Records
Problem of identity transformations of nondeterministic program schemes in algorithmic algebra systems
Logical reformulation of quantum mechanics. I. Foundations