• DocumentCode
    1132373
  • Title

    Conversion of Predicate-Calculus Axioms to Corresponding Deterministic Programs

  • Author

    Sandewall, Erik

  • Author_Institution
    Linkoeping University
  • Issue
    4
  • fYear
    1976
  • fDate
    4/1/1976 12:00:00 AM
  • Firstpage
    342
  • Lastpage
    346
  • Abstract
    The problem of converting axioms in predicate calculus to deterministic programs, which are to be used as "rules" by a general problem solver (GPS)-type supervisor is considered. It is shown that this can be done, but that the "objects" must then contain procedure closures or "FUNARG-expressions" which are later applied.
  • Keywords
    Closure, deduction, FUNARG-expression, nondeterministic, retrieval, theorem proving.; Artificial intelligence; Calculus; Computer aided software engineering; Computer languages; Control systems; Global Positioning System; High level languages; Information retrieval; Closure, deduction, FUNARG-expression, nondeterministic, retrieval, theorem proving.;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.1976.1674615
  • Filename
    1674615
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1132373