A Fast Consequence Recognition Algorithm for Monadic Logical Programs

  • Authors:

  • M. I. Kratko;G. S. Plechevich

  • Affiliations:

  • Volynsk State University, Lutsk, Ukraine;Aviation Engineering Institute (Tsiolkovskii University of Technology), Moscow, Russia

  • Venue:
  • Automation and Remote Control
  • Year:
  • 2001

Quantified Score

Hi-index 0.02

Visualization

Abstract

A fast algorithm is designed for detecting in linear time whether a given literal expression is a consequence of a monadic logical program, i.e., a program that only includes only single-place symbols of predicates and functions. It can be used for recognizing admissible controls if knowledge about objectives and actions of a system are represented by the monadic program.