Using model theory to specify AI programs

Authors:
Alan M. Frisch
Affiliations:
The University of Sussex, Brighton, England
Venue:
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Year:
1985

Citing 2
Cited 4

Worst-case Analysis of Set Union Algorithms

Journal of the ACM (JACM)
Knowledge Retrieval as Limited Inference

Proceedings of the 6th Conference on Automated Deduction

A theory of default reasoning

AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
A theory of default reasoning

AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
Knowledge compilation using horn approximations

AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 2
Approximate Inference In Default Logic And Circumscription

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a method for adapting the traditional devices of model theory to the task of specifying the input/output behavior of artificial intelligence reasoning programs when viewed as inference engines. The method is illustrated by specifying two programs, one a toy example and the other a program for retrieving information from a declarative knowledge base. Close examination shows that many intuitions about the properties of a retriever can be stated rigorously in terms of inference and that the model-theoretic specification can then be used to prove that the retriever has these properties.